Most of the slides are based on previous lecture notes of this course as given in University of Washington by Linda Shapiro (Spring 2003), Jean-Loup Baer (Winter 2003), Richard Ladner (Autumn 2002), Raj Rao (Spring 2001) and Doug Johnson (Spring 2002).
Other slides are based on previous lecture notes as given in the Technion, Israel, by Alon Itai, Dan Gaiger, and myself. You are welcome to enjoy the Hebrew version!
Slides should appear here before class and will be available in PDF format (4 slides per page - for printing).
Please let me know if you have any remarks / suggestions, or if you find errors in the slides (email to tami@cs.washington.edu ).
Unit 1 (9/29/2003, 10/1/2003): Introduction.
Unit 2 (10/1/2003): Pointers.
Unit 3 (10/3/2003, 10/6/2003): Lists.
Unit 4 (10/8/2003): Stacks and Queues.
Unit 5 (10/10/2003): Fundamentals.
Unit 6 (10/13/2003, 10/15/2003): Trees.
Unit 7 (10/17/2003, 10/20/2003): AVL Trees.
Unit 8 (10/22/2003): Splay Trees.
Unit 9 (10/24/2003, 10/27/2003): Binary Heaps.
Unit 10 (10/29/2003): Binomal Queues.
Unit 11 (10/31/2003, 11/5/2003): Hashing.
Unit 12 (11/7/2003, 11/10/2003): Graph Algorithms: Introduction, Topological Sort.
Unit 13 (11/12/2003, 11/14/2003, 11/17/2003): Graph Traversals: BFS, DFS. Shortest Path Algorithms.
Unit 14 (11/19/2003, 11/21/2003): Disjoint Union-Find.
Unit 15 (11/24/2003, 11/26/2003): Minimum Spanning Tree.
Slides in PDF Graph Coloring (Bonus material, will not included in the exam) Slides in PDF
Unit 16 (12/1/2003, 12/3/2003): Sorting (part I)
Unit 17 (12/3/2003-12/5/2003): Sorting (part II)
Note:
the lecture notes are grouped here in topics (units). We might cover one unit in more than one lecture.