CS 341 Lecture Schedule

Algorithms

Week of 13 September 1999 (Week 1)

Topics: Introduction to the course (Chapter 2), asymptotic notation (Chapter 3), analysis of algorithms (Chapter 4).

Week of 20 September 1999 (Week 2)

Topics: Analysis of algorithms (Chapter 4), divide-and-conquer (Chapter 7), recurrence relations (Chapters 4,7)

Week of 27 September 1999 (Week 3)

Topics: Divide-and-conquer (Chapter 7), Greedy algorithms (Chapter 6)

Special dates: Assignment 1 due October 1.

Week of 4 October 1999 (Week 4)

Topics: Greedy algorithms (Chapter 6)

Week of 11 October 1999 (Week 5)

Topics: Dynamic programming (Chapter 8)

Special dates: Assignment 2 due October 15.

Week of 18 October 1999 (Week 6)

Topics: Dynamic programming (Chapter 8), Exploring graphs (Chapter 9)

Special dates: Midterm on October 20, time and place TBA.

Week of 25 October 1999 (Week 7)

Topics: Exploring graphs (Chapter 9)

Week of 1 November 1999 (Week 8)

Special dates: Assignment 3 due November 7.

Week of 8 November 1999 (Week 9)

Week of 15 November 1999 (Week 10)

Topics: NP-completeness (Chapter 12)

Special dates: Assignment 4 due November 21.

Week of 22 November 1999 (Week 11)

Topics: Approximate algorithms (Chapter 13)

Week of 29 November 1999 (Week 12)

Topics: Approximate algorithms (Chapter 13)

Special dates: Assignment 5 due December 3.