ECS122A

TA  Section  Time  Place 

Yuan  A01 (CRN51558)  Mon. 1010:50  Olson 106 
Nima  A02 (CRN51559)  Wed. 1010:50  Olson 106 
Kenan  A03 (CRN51560)  Wed. 3:104:00  Chemistry 176 
Day  Time  Place 

Mondays  3:00  4:00  Kemper 3005, Bai 
5:00  7:00  Kemper 53, Nima  
Tuesdays  10:00  11:00  Kemper 55, Yuan 
5:00  7:00  Kemper 53, Kenan  
Wednesdays  2:00  3:00  Kemper 3005, Bai 
5:00  6:00  Kemper 53, Kenan  
Thursdays  6:008:00  Kemper 53, Yuan 
Fridays  10:00  11:00  Kemper 3005, Bai 
5:00  6:00  Kemper 53, Nima 
Date  Topics  Handouts/Homeworks 

1/8  I. Introduction and getting started  LN: Introduction and getting started Reading: Chaps. 1 and 2 Review: linear recurrences (ECS20) Warmup exercise 
1/10  I. Introduction and getting started (2/3)  Problem set 1 
1/12  I. Introduction and getting started II. Asymptotic notations 
LN: Asymptotic notations Reading: Section 3.1 
1/15  holiday, no class  
1/17 
II. Asymptotic notations III. DivideandConquer (DC) recurrences 
LN: DC recurrences Reading: Section 3.2 Problem set 2 
1/19  III. DivideandConquer recurrences 
Reading: Section 4.4 
1/22  IV. DC algorithms: maximumsubarray IV. DC algorithms: Strassen's method 
LN: maximumsubarray LN: Strassen Reading: Sections 4.1 and 4.2 
1/24  IV. DC algorithms: the closest pair 
LN: closest pair Problem set 3 
1/26  V. Greedy algorithms: activity selection 
LN: activity selection 
1/29  V. Greedy algorithms: Huffman codes 
LN: Huffman codes 
1/31  V. Greedy algorithms: knapsack problem 
LN: knapsack Problem set 3 due Extra reading: money changing 
2/2  VI. Dynamic programming: rod cutting Brief review for midterm I 
LN: rod cutting Reading: section 15.1 Review checklist, Slides Problem set 4 
2/5  Midterm 1  
2/7  VI. Dynamic programming: matrixchain product  LN: matrixchain product Reading: sections 15.2 and 15.3 
2/9  VI. Dynamic programming: longest common subsequence  LN: LCS Reading: section 15.4 
2/12  VI. Dynamic programming: LCS and edit distance  LN: edit distance Problem set 5 
2/14  VI. Dynamic programming: Knapsack problem and summary  LN: knapsack revisited Handout on knapsack Reading: section 15.3 
2/16  VII. Graph algorithms: Intro and BFS 
LN: Graph intro LN: BFS Reading: Sections 22.1 and 22.2, Appendix B.4 
2/19  holiday, no class  ... 
2/21  VII. Graph algorithms: DFS 
LN: DFS Handout: DFS Problem set 6, due 4:00pm, Feb.28 
2/23  VII. Graph algorithms: DFS apps and MST 
LN: DFS apps LN: MST 
2/26  
2/28  Problem set #6 due  
3/2  
3/5  Midterm 2: cover topics in Problem Sets #4, #5 and #6  
3/7  
3/9  
3/12  
3/14  
3/16  ... (instruction ends)  
3/173/19  ... (extra office hours and reviews... to be announced)  
3/20  6:008:00pm, Final Exam  Hunt 100 