CSE 101: ALGORITHMS -- Reading



Date Topic Reading
Sep 25 Analyzing algorithms Chapter 0
Sep 28 Introduction to graphs 3.1
Sep 30 Depth-first search in undirected graphs 3.2
Oct 2 DFS in undirected graphs 3.2
Oct 5 DFS in directed graphs 3.3
Oct 7 DFS in directed graphs 3.3
Oct 9 Strongly connected components 3.4
Oct 12 Divide and conquer: mergesort 2.2, 2.3
Oct 14 Medians and selection 2.4
Oct 16 Lower bound on sorting  
Oct 19 Integer multiplication 2.1
Oct 21 Greedy algorithms 5.1
Oct 23 Midterm 1 (chapters 0,2,3)  
Oct 26 Greedy algorithms 5.1
Oct 28 Greedy algorithms  
Oct 30 Greedy algorithms 4.1, 4.2, 4.3, 4.4
Nov 2 Greedy algorithms 5.4
Nov 4 Dynamic programming 6.1
Nov 6 Dynamic programming 6.2, 6.3
Nov 9 Dynamic programming 6.4, 6.6
Nov 11 No class: Veteran's Day  
Nov 13 Dynamic programming 6.7
Nov 16 Dynamic programming  
Nov 18 Hashing and sketching  
Nov 20 Midterm 2 (chapters 4,5,6)  
Nov 23 Hashing and sketching  
Nov 25 Review of basic probability Notes
Nov 27 No class: Thanksgiving  
Nov 30 Hashing and sketching  
Dec 2 Hashing and sketching  
Dec 4 NP-completeness and beyond