Past Syllabi

COT 4400 EMA 100 Peter M. Maurer

Analysis of Algorithms Course Outline ENB 314

Summer 199 5 11:00AM-1:00PM TR

974-4758

Hours 11:00 12:00 MT

EMAIL: local: maurer remote: [email protected] I normally mantain an open door policy with respect to office visits. You are welcome to come by at any time. The door will be closed -- knock and it will be opened. TA: None Text: Robert Sedgewick , Algorithms in C There will be 2 exams. The first exam will count 1/3 of your grade. The second exam will be comprehensive and will count 2/3 of your grade. Homework will be assigned every day. It will not be graded, but I will call randomly on students to present their solutions. If you haven’t done the homework you will have to construct a solution in “real time,” and I won’t let you weasel out by saying you don’t know how to do it. N o programming exercises will be assigned.

1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19 . 20.

May 16 May 1 8 May 23 May 2 5 May 30 Jun 3 0 Jun 1 Jun 6 Jun 8 Jun 1 3 Jun 1 5 Jun 2 0 Jun 2 2 Jun 2 7 Jun 29 Jul 6 Jul 11 Jul 13 Jul 18 Jul 20

Introduction Analysis and Implementation of Algorithms Sorting Sorting Sorting Sorting Sorting Searching Searching EXAM Searching Searching Graph Algorithms Graph Algorithms Graph Algorithms Graph Algorithms NP-Completeness File Compression Cryptology FINAL EXAM

Ch 6, 7 Ch. 8-13 "" "" "" "" Ch. 14-18 "" "" "" Ch. 29-34 "" "" "" Ch 45 Ch 22 Ch 23

COT 4400-001 ENB 105

Analysis of Algorithms

FALL 1995 3:30-4:45 PM TR

Instructor: Peter M. Maurer Office: ENB 314 Office Hours: MTW 11:00-12:00 AM Phone: 974-4758 Text: Sara Baase, Computer Algorithms, Introduction to Design and Analysis Class Meetings & Tentative Schedule: Date 1. 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. 27. 28.

Aug. 29 Aug. 31 Sept. 5 Sept. 7 Sept. 12 Sept. 14 Sept. 19 Sept. 21 Sept. 26 Sept. 28 Oct. 3 Oct. 5 Oct. 10 Oct. 12 Oct. 11 Oct. 17 Oct. 19 Oct. 24 Oct. 31 Nov. 2 Nov. 7 Nov. 9 Nov. 14 Nov. 16 Nov. 21 Nov. 28 Nov. 30 Dec. 5 Dec. 7

29. Dec. 12

Topic Introduction Mathematical Preliminaries Mathematical Preliminaries Mathematical Preliminaries Recurrence Relations Recurrence Relations Sorting Sorting Sorting Sorting EXAM #1 Graph Algorithms Graph Algorithms Graph Algorithms Graph Algorithms Searching Searching String Matching String Matching String Matching EXAM #2 Polynomials and Matrices Polynomials and Matrices Polynomials and Matrices Polymomials and Matrices Dynamic Programming Dynamic Programming Dynamic Programming NP-Completeness EXAM #3

There will be three equally weighted exams, given on the dates indicated. These three exams will constitute 85% of your final grade. In addition, there will be one programming project, which is due on Dec 7th at 5pm. The programming project will count 15% of your final grade. I have an open-door policy with respect to office hours. You may come to my office at any time. I habitually keep my office door closed and locked. Don’t be afraid to knock.

COT 4400-001 ENB 108


FALL 1996 9:30-10:45 AM MW

Instructor: Peter M. Maurer Office: ENB 314 Office Hours: MTW 2:00 - 3:00 PM Phone: 974-4758 Text: Sara Baase, Computer Algorithms, Introduction to Design and Analysis Class Meetings & Tentative Schedule: Date 1. 2. 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. 27.

Aug. 26 Aug. 28 Sept. 4 Sept. 9 Sept. 11 Sept. 16 Sept. 18 Sept. 23 Sept. 25 Sept. 30 Oct. 2 Oct. 7 Oct. 9 Oct. 14 Oct. 16 Oct. 21 Oct. 23 Oct. 28 Oct. 30 Nov. 4 Nov. 6 Nov. 13 Nov. 18 Nov. 20 Nov. 25 Nov. 27 Dec. 2 Dec. 4 Dec. 9 Final Exam

Topic Introduction Mathematical Preliminaries Mathematical Preliminaries Mathematical Preliminaries Recurrence Relations Recurrence Relations Sorting Sorting Sorting Sorting EXAM #1 Graph Algorithms Graph Algorithms Graph Algorithms Graph Algorithms Searching Searching String Matching String Matching String Matching EXAM #2 Polynomials and Matrices Polynomials and Matrices Polynomials and Matrices Polymomials and Matrices Dynamic Programming Dynamic Programming Dynamic Programming NP-Completeness FRIDAY December 13th, 10:30AM-12:30PM

A Healthy Young 19-Year Old Man, After Taking Analysis of Algorithms.

There will be three equally weighted exams, given on the dates indicated. These three exams will constitute 85% of your final grade. In addition, there will be one programming project, which is due on Dec 7th at 5pm. The programming project will count 15% of your final grade. I have an open-door policy with respect to office hours. You may come to my office at any time. I habitually keep my office door closed and locked. Don’t be afraid to knock.

COT 4400 PHY 118


FALL 1997 9:30-10:45 TR

Instructor: Peter M. Maurer Office: ENB 314 Office Hours: MTW 2:00 - 3:00 PM Phone: 974-4758 Text: Sara Baase, Computer Algorithms, Introduction to Design and Analysis Class Meetings & Tentative Schedule: Date 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. 27. 28. 29.

Aug. 26 Aug. 28 Sept. 2 Sept. 4 Sept. 9 Sept. 11 Sept. 16 Sept. 18 Sept. 23 Sept. 25 Sept. 30 Oct. 2 Oct. 7 Oct. 9 Oct. 14 Oct. 16 Oct. 21 Oct. 23 Oct. 28 Oct. 30 Nov. 4 Nov. 6 Nov. 13 Nov. 18 Nov. 20 Nov. 25 Nov. 27 Dec. 2 Dec. 4 Final Exam

Topic Introduction Mathematical Preliminaries Mathematical Preliminaries Mathematical Preliminaries Recurrence Relations Recurrence Relations Sorting Sorting Sorting Sorting Graph Algorithms EXAM #1 Graph Algorithms Graph Algorithms Graph Algorithms Searching Searching String Matching String Matching String Matching Polynomials and Matrices EXAM #2 Polynomials and Matrices Polynomials and Matrices Polynomials and Matrices Dynamic Programming Dynamic Programming Dynamic Programming NP-Completeness THURSDAY December 11th, 10:30AM-12:30PM

To get to the Gold, you’ve got to break a lot of rocks.

There will be three equally weighted exams, given on the dates indicated. These three exams will constitute 1/3 of your final grade. I have an open-door policy with respect to office hours. You may come to my office at any time. I habitually keep my office door closed and locked. Don’t be afraid to knock.