In all readings,
omit all average case analysis/randomized versions of
algorithms until last 2 weeks of class.
Exact readings and covered chapters (for future homework and exam purposes)
will only
crystallize in the schedule below once we actually pass the relevant
week
Chapters that are lightly covered in class and need more extensive reading
are usually marked with an asterisk below.
Generally, all subsections in the covered chapters need to be
studied by the student. Any exceptions to this rule will be mentioned in class.
Week |
Lecture
| Notes
|
1 |
| |
| Aug 23Motivation + Basics |
|
| Reading Assmt:I.1,2,3(*),4(*); II.8(*),9 . |
| Event: |
|
2 |
| Aug 28 Basics: I.2 (loop correctness analysis),
I.8(efficient use of data properties and representation)
I.2,4;II.9(recursion technique and complexity analysis via recurrences)
|
| Aug 30 |
|
| Reading Assmt: II.6; III.12,13,14; |
| Event: |
|
3 |
| Sep 4 Datastructure issues: design and
analysis examples; II.6(heaps); III.13(Balanced binary trees);
III.14(datastructure augmentation and interval trees)
|
| Sep 6
|
|
| Reading Assmt: IV.15,16, 17
|
| Event : HW1 out
|
|
4 |
| Sep 11Advanced
analysis techniques: Amortized analysis
IV.17;
|
| Sep 13
Design techniques and foundations:
IV.15(recursion with ``dynamic programming'' i.e, storing key subsolutions);
IV.16 (Greedy algorithms and matroids)
|
| Sep
|
|
| Reading Assmt : VI.22,23,24,25
|
| Event : |
|
5 |
| Sep 18Advanced
analysis techniques: Amortized analysis
IV.17;
|
| Sep 20
Design techniques and foundations:
IV.15(recursion with ``dynamic programming'' i.e, storing key subsolutions);
IV.16 (Greedy algorithms and matroids)
|
| Sep
|
|
| Reading Assmt : VI.22,23,24,25
|
| Event : HW1 in |
|
6 |
| Sep 25 Graph algorithms: VI.22,23(spanning trees and their uses); VI.24,25(shortest paths)
|
| Sep 27
|
|
| Reading Assmt: VI.26;
|
| Event : HW2 out
|
|
6 |
| Oct 2
VI.26(Network flow).
|
| Oct 4
|
|
| Reading Assmt: VII.30,31
|
| Event : |
|
8 |
|
| Reading Assmt: |
| Event: HW2 in; Extra 2 hr review session |
|
9 |
| Oct 16 Midterm
|
| Oct 18 VII.33 (computational geometry)
|
|
| Reading Assmt: VII.33(computational geometry). |
| Event: MIDTERM; HW3 out
|
|
10 |
| Oct 23VII.33(computational geometry)
|
| Oct 25 |
|
| Reading Assmt: VII.31.5-7; 32.1-2(Number theory and
string matching)
|
| Event:
|
|
11 |
| Oct 30 VII.31.5-7; (Number theory and string
matching)
|
| Nov 1
|
|
| Reading Assmt: I.5,II.7(randomization and average case) |
| Event: HW3 in, HW4 out |
|
12 |
| Nov 6I.5,II.7(randomization)
|
| Nov 8
|
|
| Reading Assmt: VII.34
|
| Event:
|
|
13 |
| Nov 13VII.34 (NP completeness and reducibility)
|
| Nov 15
|
|
| Reading Assmt: VII.35
|
| Event: HW4 in;Takehome(?) final out;extra review session |
|
14 |
| Nov 20VII.35 Approximation algorithms
|
| Nov 22
|
|
| Reading Assmt: II.8 |
| Event:
|
|
15 |
| Nov 27 Lower bounds (II.8, etc.)
|
| Nov 29
|
|
| Reading Assmt: |
| Event: Takehome(?) final in |
|
16 |
|
|