Computer Science 226
Data Structures and Algorithms
Fall 2002
Course Information | Home Page | Assignments | Exercises | Lectures | Errata

SCHEDULE OF LECTURES

For reference, use the corresponding chapters in Algorithms in C, Parts 1-5, 3rd edition and Algorithms in C, 2nd edition.
 

Date Lecture Chapter(s) Extras
9/12 Introduction 1-5  
9/17 Elementary sorts, shellsort 6 Sorting applets
9/19 Quicksort 7 Sorting applets   Partitioning   Quicksort
9/24 Mergesort 8 Merging   Extra slides
9/26 Priority queues 9  
10/1 Symbol tables 12 Tree applet
10/3 Balanced trees 13 Tree applet
10/10 Linear Selection   Median finding
10/12 Hashing 14  
10/15 Trie searching 15  
10/17 String searching *19  




COS 226 Class Page
rs@cs.princeton.edu
Last modified: September 17, 2002