
Computer Science 226
Algorithms and Data Structures
Spring 2010


Course Information 
Assignments 
Exercises 
Lectures 
Exams 
Booksite
SCHEDULE OF LECTURES
Below are links to the lecture slides.
This list is tentative and is to be considered subject to change. Minor updates
are possible at any time. Substantive updates (not unlikely the evening
before a lecture) will be marked with the date of change.
Here are the reported errata.
#
 DATE
 LECTURE SLIDES
 READINGS
 BOOKSITE
 DEMOS

1

2/1

Intro
·
Union find

Algs 4, Section 1.5

1.5


2

2/3

Analysis of algorithms

Intro Java, Section 4.1

1.4


3

2/8

Stacks and queues (new 2/7)

Intro Java, Section 4.3

1.3


4

2/10

Elementary sorts

Algs 4, Section 2.1

2.1

sorting animations

5

2/15

Mergesort

Algs 4, Section 2.2

2.2

sorting animations

6

2/17

Quicksort

Algs 4, Section 2.3

2.3


7

2/22

Priority queues

Algs 4, Section 2.4
+ collisions

2.4


8

2/24

Symbol tables ·
BSTs

Algs 4, Sections 3.1–3.2

3.1–3.2


9

3/1

Balanced search trees

Algs 4, Section 3.3

3.3


10

3/3

Hash tables
·
Applications

Algs 4, Sections 3.4–3.5

3.4–3.5


11

3/8

Midterm (through lecture 10)

12

3/10

Undirected graphs (new 3/10)

stay tuned

4.1

DFS
BFS
maze

13

3/22

Directed graphs (fixed 3/23)

stay tuned

4.2

DFS
topological sort

14

3/24

Minimum spanning trees (new 3/23)

Algs 4, Section 4.3

4.3

Graph applet

15

3/29

Shortest paths (new 3/28)

Algs 4, Section 4.4

4.4

Dijkstra

16

3/31

Radix sorts

Algs 4, Section 5.1

5.1

string sorting

17

4/5

Tries

Algs 4, Section 5.2

5.2


18

4/7

Data compression

Algs 4, Section 5.5

5.5


19

4/12

Substring search

Algs 4, Section 5.3

5.3

substring search

20

4/14

Regular expressions

Algs 4, Section 5.4

5.4


21

4/19

Geometric primitives

Algs 2, Chapters 24–25

9.1

convex hull
Voronoi

22

4/21

Geometric search·Intersection

Algs 2, Chapter 26–27

9.2–9.3

sweep line intersection

23

4/26

Reductions·Intractability





24

4/28

Combinatorial search




The Longest Path [mp3]

This file with
all the slides for Lectures 110
(28 MB) is suitable for uploading to a portable device, as is
this file with
all the slides for Lectures 1224
(40 MB) and this file with
all the slides for the course
(66 MB). These files do not reflect changes made as the semester progresses.
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).
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.
Copyright © 2009, Bob Sedgewick and Kevin Wayne.