ECS 122A - Syllabus and Reading Assignments
|
| Lecture |
By |
Topic |
Reading |
| Lect 1 - F 9/26 |
Black
| Introduction. Cake cutting |
1 |
| Lect 2 - M 9/29 |
Rogaway
| Divide-and-conquer paradigm. Mergesort. Exact and asymptotic analysis |
2, 3, 4.1-4.3 |
| Lect 3 - W 10/1 |
Rogaway
| Closest Pair of Points in the Plane |
Handout A |
| Disc 1 - W 10/1 |
Black
| Solving recurrence relations |
. |
| Lect 4 - F 10/3 |
Rogaway
| Quicksort |
8 |
| Lect 5 - M 10/6 |
Black, Rogaway
| Selection (probabilistic and deterministic) |
10 |
| Lect 6 - W 10/8 |
Black
| Deterministic selection analysis. Lower bounds |
9.1 |
| Disc 2 - W 10/8 |
Rogaway
| O, Theta, Omega, o. |
. |
| Lect 7 - F 10/10 |
Black
| Lower Bounds on Sorting and Selection |
Handout B |
| Lect 8 - M 10/13 |
Rogaway
| Dynamic programming. 0/1 Knapsack |
16.1-16.3 |
| Lect 9 - W 10/15 |
Black
| Dynamic programming: 2-Person Job Scheduling. Optimal BSTs |
Handout C |
| Disc 3 - W 10/15 |
Rogaway
| Another lower bound: finding the MIN and MAX |
. |
| Lect 10 - F 10/17 |
Rogaway
| Program Checking - 1. Ideas, and Matrix Multiplication |
Handout D |
| Lect 11 - M 10/20 |
Rogaway
| Program Checking - 2. Finish Matrix Multiplication. Sorting |
. |
| Lect 12 - W 10/22 |
Rogaway
| Hasing and Universal Hash Families |
12.1-12.3 |
| Disc 4 - W 10/22 |
Black
| More DP examples: Coin Changing |
. |
| Lect 13 - F 10/24 |
Black
| Hashing and MACing |
Handout E |
| Lect 14 - M 10/27 |
Black
| Greedy - 1 |
17.1 - 17.3 |
| T 10/28 |
Rogaway |
Midterm review session, 7-9 pm, 115 Hutch |
. |
| Lect 15 - W 10/29 |
Black
| Greedy - 2. Stable Marriages |
Handout F |
| Disc 5 - W 10/29 |
Black
| Midterm Review |
. |
| R 10/30 |
- |
Evening midterm exam, 7-9 pm, 1130 Hart |
. |
| Lect 16 - F 10/31 |
Rogaway |
Finish Stable Marriages. Kruskal's algorithm. Discuss Midterm |
24 |
| Lect 17 - M 11/3 |
Rogaway |
Graph terminology. Kruskal's algorithm |
5.4, 24 |
| Lect 18 - W 10/5 |
Rogaway |
Proving Kruskal's algorithm correct. The Union/Find data structure |
22.1-22.3 |
| Disc 6 - W 11/05 |
Black
| PS6 discussion and Greedy Example: Fractional Knapsack |
. |
| Lect 19 - F 11/7 |
Rogaway |
Improving Union/Find.
Amortized running times |
22.1-22.3 |
| Lect 20 - M 11/10 |
Black |
Amortized Analysis with examples |
18 |
| Lect 21 - W 11/12 |
Black |
DFS/BFS and applications |
23.1-4 |
| Disc 7 - W 11/12 |
Black
| Topological Sort, Dynamic Hashing, and PS7 hints |
. |
| Lect 22 - F 11/14 |
Black |
Heaps and Heapsort |
7 |
| Lect 23 - M 11/17 |
Black |
Dijkstra's Shortest Path Algorithm |
25.1-3 |
| Lect 24 - W 11/19 |
Rogaway |
NP Completeness - 1. Using rdxns to show hardness. HP, HC, LP
| 36 |
| Disc 8 - W 11/19 |
Black, Rogaway
| Ham-Cycle < Longest Path. HW help. Proving Dijkstra's alg correct |
. |
| Lect 25 - F 11/21 |
Rogaway |
NP Completeness - 2 |
. |
| Lect 26 - M 11/24 |
Rogaway |
NP Completeness - 3 |
. |
| W 11/26 |
- |
Class cancelled (to compensate for evening MT) |
. |
| Lect 27 - M 12/01 |
Rogaway |
Data Compression. Huffman Codes and Lempel-Ziv |
17.3. Handout G |
| Lect 28 - W 12/03 |
Black |
String matching - Naive and Z-Algorithm Evaluations |
Handout H |
| Disc 9 - W 12/03 |
Black
| Practice NP-Completeness reductions; Homework Help |
. |
| Lect 29 - F 12/05 |
Black |
Z-Algorithm and Analysis |
. |
| M 12/08 |
Black |
Final review session |
. |
| W 12/10 |
- |
Final exam |
. |