Analysis of Algorithms
91.404 (Section 201)
Reading assignments are in the required text and supporting materials. The following table shows the planned reading schedule. The schedule may be revised slightly as the semester progresses.
|
Lecture Date |
Topic |
Reading |
Homework |
|
|
|
|
|
|
|
Foundations |
Chapters 1-5 |
|
|
Sept 4 |
Introduction/Overview |
Chapter 1 |
assign #1 (Ch 1, 2) |
|
Sept 9, 11 |
Analyzing & Designing Algorithms |
Chapter 2 |
|
|
|
|
|
|
|
|
|
|
|
|
Sept 16, 18, 22 |
Growth of Functions |
Chapter 3 |
assign #2 (Ch 3) |
|
Sept 25, Oct 2 |
Recurrences |
Chapter 4 |
assign #3 (Ch 4) |
|
Oct 7 |
Probability & Randomized Algorithms |
Chapter 5 |
|
|
|
|
|
|
|
|
Sorting |
Chapters 6-8 |
|
|
Oct 9, 14 |
Heapsort/ Priority Queues |
Chapter 6 |
|
|
Oct 16, 21 |
Quicksort |
Chapter 7 |
assign #4 (Ch 6) |
|
Oct 23, Nov 6 |
Sorting in Linear Time |
Chapter 8 |
assign #5 (Ch 7) |
|
Oct 28 |
Review |
Chapters 1-6 |
|
|
Oct 30 |
Midterm Exam |
Chapters 1-6 |
|
Revised for Fall, 2001 in accordance with ACM Computer Science Computing Curricula 2001, Steelman Draft, August, 2001.