Lecture date | Topics | Reading | Assignments |
---|---|---|---|
August 22 (M) | No class | ||
August 24 (W) | About the course (Notes) | ||
August 26 (F) | What is an algorithm? (Notes) | 1 | |
August 29 (M) | Notation for algorithms; reasoning about algorithms; analysis of algorithms; insertion sort as an example (Notes) | 2 | |
August 31 (W) | Merge sort as another example (Notes) | ||
September 2 (F) | No class | ||
September 5 (M) | Holiday | ||
September 7 (W) | No class | ||
September 9 (F) | No class | ||
September 12 (M) | No class | ||
September 14 (W) | Asymptotic efficiency of algorithms (Notes) | 3 | Reading Quiz 1: HTML, PDF |
September 16 (F) | No class | ||
September 19 (M) | Divide and conquer (Notes) | 4 | |
September 21 (W) | Divide and conquer, continued (Notes) | ||
September 23 (F) | No class | Homework 1: HTML, PDF | |
September 26 (M) | No class | ||
September 28 (W) | No class | ||
September 30 (F) | No class | ||
October 3 (M) | No class | ||
October 5 (W) | No class | ||
October 7 (F) | No class | ||
October 10 (M) | Review of selected topics from Chapter 3 (Notes) | ||
October 12 (W) | No class | ||
October 14 (F) | Class recess | ||
October 17 (M) | No class |
Reading Quiz 2:
HTML,
PDF; Homework 2: HTML, PDF |
|
October 19 (W) |
Quicksort as an example of divide and conquer
(Notes) (notes only; no lecture) |
||
October 21 (F) | TBA | ||
October 24 (M) | TBA | ||
October 26 (W) | TBA | ||
October 28 (F) | TBA | ||
October 31 (M) | TBA | ||
November 2 (W) | TBA | ||
November 4 (F) | TBA | ||
November 7 (M) | TBA | ||
November 9 (W) | TBA | ||
November 11 (F) | TBA | ||
November 14 (M) | TBA | ||
November 16 (W) | TBA | ||
November 18 (F) | TBA | ||
November 21 (M) | Holiday | ||
November 23 (W) | Holiday | ||
November 25 (F) | Holiday | ||
November 28 (M) | TBA | ||
November 30 (W) | TBA | ||
December 2 (F) | TBA | ||
December 5 (M) | Course wrap-up and evaluations |
Links to recorded lectures are in this shared Google Doc.