CS 46101/56101 - Spring 2002
Design and Analysis of Algorithms
CS 4/56101 Spring 2002 Course Schedule
Readings should be done in advance of the class session
where they are listed.
Week 1
January 15 Algorithm, the concept, Readings: Chapter 1
January 17 Correctness, analysis, design. Readings: Chapter 2
Week 2
January 22 Growth of Functions, Readings: Chapter 3.
January 24 Recurrences, Readings: Chapter 4.
Week 3
January 29 Heaps, Heapsort, priority queues, Readings: Chapter 6.
January 31 Quicksort. Upper and lower bounds on sorting. Readings: Chapter 7.
Week 4
February 5 Interdisciplinary Lecture, MCS 228, 3:30 - 5:00 p.m.
February 7 Linear time sorting, Readings: Chapter 8.
Week 5
February 12 Stacks, queues, linked lists, Readings: Chapter 10.
February 14 Hash tables, Readings: Chapter 11 Sections 1-4.
Week 6
February 19 **Review **
February 21 ** Midterm Exam I **
Week 7
February 26 Binary Search Trees, Readings: Chapter 12 Sections 1-3.
February 28 Balanced trees, red-black trees, Readings: Chapter 13.
Week 8
March 5 B-Trees, Readings: Chapter 18.
March 7 Augmenting Data Structures, Readings: Chapter 14 Sections 1-2.
Week 9
March 12 Dynamic Programming, Readings: Chapter 15 Section 2 & 4.
March 14 Greedy algorithms, Readings: Chapter 16 Section 1-2.
Week 10
March 19 ** Review **
March 21 Elementary Graph Algorithms Readings: Chapter 22 section 1
Week 11
March 26 ** Spring Break **
March 28 ** Spring Break **
Week 12
April 2 Elementary Graph Algorithms Readings: Chapter 22 sections 2-3
April 4 Minimum Spanning Trees, Readings: Chapter 23.
Week 13
April 9 Single-Source Shortest Paths, Readings: Chapter 24 Sections 1
April 11 Single-Source Shortest Paths, Readings: Chapter 24 Section 2
Week 14
April 16 Dijkstras algorithm, Readings: Chapter 24 Section 3
April 18 String matching, Readings: Chapter 32 Sections 1.
Week 15
April 23 Boyer-Moore & KMP algorithms Readings: Chapter 32 Section 4 & Web Content.
April 25 RSA public-key cryptosystem, Readings: Chapter 31 Section 7.
Week 16
April 30, 2001 NP-Completeness, Polynomial reducibility, Readings: Chapter 34.
May 2, 2001 Course Review
Week 17
May 7 ** Final Exam 3:30 - 5:30 **