Computer Science 226
Data Structures and Algorithms
Spring 2002
Course Information | Announcements | Assignments | Exercises | Lectures | Errata

SCHEDULE OF LECTURES

The following list of the lectures has links to the .pdf files that are being used to make the slides used in lecture. Students are fully responsible for all material presented in lectures, even if some of it does not appear in these notes. These notes are intended for the lecture presentations; for reference, use the corresponding chapters in Algorithms in C, Parts 1-5, 3rd edition and Algorithms in C, 2nd edition. An effective strategy is to look over the indicated chapter before the lecture, then read it in detail soon afterwards.

# Lecture Notes Chapter(s) In-class Demos
1 Introduction 1-5  
2 Elementary sorts, shellsort 6 Sorting applets
3 Quicksort 7 Partitioning   Quicksort
4 Mergesort, analysis of algorithms 8 Merging   Extra slides
5 Priority queues 9  
6 Radix sorts 10  
7 Symbol tables 12 Binary tree applet
8 Balanced trees 13 Binary tree applet
9 Hashing 14  
10 Trie searching 15  
11 String searching *19  
12 Midterm
13 Pattern matching (revised) *20-21 Deque simulation of NFSA  
14 Data compression (revised) *22 Huffman   LZW
15 Geometric algorithms *24, *25  
16 Geometric search *26, *27  
17 Undirected graphs (revised) 17, 18 DFS   BFS   Rat maze
19 Minimum spanning tree (revised) 20 Graph applet
18 Directed graphs 19  
20 Shortest paths 21  
21 Max flow, min cut 22 Augmenting path demo
22 Minimum cost flow 22  
23 Linear programming (revised) -  
24 All questions answered -  

The chapters denoted by * are from the second edition. All other chapters are from the third edition.


COS 226 Class Page
rs@cs.princeton.edu
Last modified: February 7, 2002