
Computer Science 226 
#  Lecture Notes  Chapter(s)  Inclass Demos 
1  Introduction  15  
2  Elementary sorts  6  Sorting applets 
3  Mergesort, Quicksort  7, 8 
Partitioning
Quicksort applets
Merging Mergesort applets 
4  Priority queues  9  Sort summary 
5  Symbol tables  12  Growing Tree Tool 
6  Balanced trees  13  Growing Tree Tool 
7  Hashing  14  
8  Radix sorts  10  3way partitioning C code 
9  Trie searching  15  C code 
10  String searching  19*  KMP demo C code 
11  Midterm  
12  Pattern matching  20*, 21*  Deque simulation of NFSA 
13  Data compression  22*  Huffman demo LZW demo 
14  Geometric algorithms  24*, 25*  Convex hull applet Applications 
15  Geometric search  26*, 27*  Voronoi applet 
16  Undirected graphs  17, 18  DFS BFS Euler Maze C code 
17  Minimum spanning tree  20  Graph applet Applications 
18  Directed graphs  19  DFS Topological sort C code 
19  Shortest paths  21  Dijkstra demo 
20  Max flow, min cut  22  Augmenting path demo C code 
21  Minimum cost flow  22  
22  Linear programming  article  
23  Reductions    
24  All questions answered   