Class Lecture Slides

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.

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 ).

You are also welcome to send anonymous feedback (positive or negative) to the course staff. It is completely confidential. You can choose to send feedback to the instructor, to the TAs, or to both.

Unit 1 (1/5/2004, 1/7/2004): Introduction.

Unit 2 (1/7/2004 , 1/9/2004 ): Pointers and Lists.

Unit 3 (1/12/2004 ): Stacks and Queues.

Unit 4 (1/14/2004 , 1/16/2004 ): Trees, Binary Trees, Search Trees.

Reading : Chapters 4.1, 4.2, 4.3

Unit 5 ( 1/16/2004 , 1/21/2004 ): AVL Trees.

Have some funwith binary search trees.

Unit 6 ( 1/23/2004 ): Splay Trees.

Unit 7 ( 1/26/2004 ): B Trees and Rank Trees.

Slides in PDF  Demo of B-tree insertion 1    2

Unit 8 ( 1/28/2004, 1/30/2004 ): Binary Heaps.

Unit 9 ( 2/2/2004 ): Binomial Queues.

Unit 10 ( 2/4/2004, 2/11/2004 ): Hashing.

Slides in PDF  ,  Open Addressing examples

Unit 11 ( 2/13/2004 ): Graph Algorithms – Introduction and Topological Sort.

Reading : Chapters 9.1 and 9.2

Unit 12 ( 2/18/2004  - 2/25/2004 ): Graph Algorithms – BFS, DFS, Shortest path algorithms.

Slides in PDF  (colored printing is recommended, or bring a non-black pen with you to the lecture).

Reading : Chapters 9.3, 9.6, 10.3.4

Unit 13 ( 2/25/2004  - 2/27/2004 ): Disjoint Union/Find.

Unit 14 ( 3/1/2004  - 3/3/2004 ): Graph Algorithms - Minimum Spanning Tree.

Slides in PDF  (colored printing is recommended, or bring blue and red pens with you to the lecture).