Computer Science 226
Algorithms and Data Structures
Spring 2009


Course Information | Assignments | Exercises | Lectures | Administration

SCHEDULE OF LECTURES

Below are links to the lecture slides. This list is tentative and is to be considered subject to change. Once the lecture moves above the "Lectures below have not yet been updated for Spring 2009" part of the table, it will not significantly change, but minor updates are possible up until the lecture is given. After the lecture, any reported errors will be posted here. Students are fully responsible for all material presented in lectures, even if some of it does not appear in these slides. These slides are intended for the lecture presentations; for reference, use the indicated reading (fourth column in the table below). An effective strategy is to look over the reading material before the lecture, then study it in detail soon afterwards. We have only begun to build the booksite for the 4th edition, but you might find it useful since it contains links to the Java code from lecture. The fifth column in the table gives links into the booksite.

# DATE LECTURE SLIDES BOOK BOOKSITE DEMOS
1 2/2 Intro, Union-find Algs 3(1-4) Chapter 1 0
2 2/4 Analysis of algorithms Intro Java Section 4.1 1.1 - 1.2
3 2/9 Stacks and queues Intro Java Section 4.3 2.6
4 2/11 Elementary sorts Algs 4 Section 3.1 3.1 sorting animations
5 2/16 Mergesort (updated 2/15) Algs 4 Section 3.2 3.2 merging
6 2/18 Quicksort Algs 4 Section 3.3 3.3 partitioning
7 2/23 Priority queues Algs 4 Section 3.4 3.4
8 2/25 Symbol tables Algs 4 Sections 4.1, 4.2 4.1, 4.2 Growing Tree Tool
9 3/2 Balanced BSTs Algs 4 Section 4.3 4.3
10 3/4 Hashing Algs 4 Section 4.4 4.4
11 3/9 Midterm (through lecture 10)
12 3/11 Undirected graphs Algs 3(5) Chapters 17-18 5.1 DFS   BFS   maze
13 3/23 Directed graphs Algs 3(5) Chapter 19 5.2 DFS   topological sort
14 3/25 Minimum spanning trees Algs 3(5) Chapter 20 5.3 Graph applet
15 3/30 Shortest paths Algs 3(5) Chapter 21 5.4 Dijkstra
16 4/1 Radix sorts Algs 3(1-4) Chapter 10 6.1  
17 4/6 Tries Algs 3(1-4) Chapter 15 6.2
18 4/8 Substring search Algs 4 Section 6.3 6.3 DFA   KMP  
19 4/13 Data compression Algs 4 Section 6.5 6.5
20 4/15 Pattern Matching Algs 4 Section 6.4 6.4
21 4/20 Geometric algorithms Algs 2 Chapters 24-25 7.1 - 7.2 convex hull   Voronoi
22 4/22 Geometric search Algs 2 Chapter 26-27 7.3 - 7.4 sweep line intersection
23 4/27 Reductions - 8.5 - 8.6  
24 4/29 Combinatorial search - 8.7 The Longest Path [mp3]

This version of all the slides for Lectures 1-10 is suitable for uploading to a smartphone (if you have 25MB to spare).


Copyright © 2009, Bob Sedgewick and Kevin Wayne.