APPROXIMATE course contents and APPROXIMATE timetable:
Aug 31 - Algorithms, problems, programs
Sep 5 - Sorting and runtime
7 - Review of calculus, induction, and infinity
12 - More induction
14 - Probability [hwk 1 due]
19 - Probability
21 - Order of functions [hwk 2 due]
26 - Order of functions
28 - Recurrence equations [hwk 3 due]
Oct 3 - Master Theorem
5 - Summations [hwk 4 due]
10 - Summations
12 - Quicksort [hwk 5 due]
17 - Heapsort
19 - Sorting bounds [hwk 6 due]
24 - Review
26 - EXAM I
Oct 31 - Graphs, trees, and search
Nov 2 - ch 3: Depth-first search [hwk 7 due]
7 - ch 3: Topological sort
9 - ch 4: Breadth-first search [hwk 8 due]
14 - ch 4: Dijkstra's algorithm
16 - ch 5: Kruskal's algorithm, Union-Find [hwk 9 due]
21 - Brains and parallel architectures
23 - THANKSGIVING
28 - ch 8: Search and complexity (and AVL trees)
30 - ch 8: Complexity and parallelism [hwk 10 due]
Dec 5 - ch 10: Quantum parallelism
7 - Review [hwk 11 due]
12 - EXAM II
19 - FINAL EXAM 1:30--3:300pm in regular classroom (CSI 1115)