
Computer Science 226 
#  LECTURE NOTES  CHAPTER  BOOKSITE  DEMOS 

1  Unionfind  1  0  
2  Analysis of algorithms  2  1.1  1.2  
3  Stacks and queues  34  2.6  
4  Elementary sorts  6  3.1  
5  Efficient sorts  78  3.2  3.3  merging partitioning 
6  Advanced topics in sorting  8  3.5  
7  Priority queues  9  3.4  
8  Elementary symbol tables  12  4.1  
9  Binary search trees  12, 13  4.2  Growing Tree Tool 
10  Balanced BSTs  13  4.3  
11  Hashing  14  4.4  
Midterm (through lecture 10)  
13  Undirected graphs  1718  5.1  DFS BFS maze 
14  Directed graphs  19  5.2  DFS topological sort 
15  Minimum spanning trees  20  5.3  Graph applet 
16  Shortest paths  21  5.4  Dijkstra 
17  Radix sorts  10  6.1  
18  Tries  15  6.2  
19  Pattern matching  19*  6.3  6.4  DFA KMP 
20  Data compression  22*  6.5  Huffman* LZW* 
21  Geometric algorithms  2425*  7.1  7.2  convex hulls 
22  Geometric search  2627*  7.3  7.4  sweep line intersection 
23  Reductions    8.5  
24  Combinatorial search    8.7  The Longest Path [mp3] 