CSE 326: Data Structures, Autumn 2003

Main Page

Previous Quarters

CSE Home

About Us

Search

Contact Info

Calendar and Lecture Slides NOTE: All future dates and topics are subject to change; check back frequently! Week of Monday Wednesday Thursday Friday Sep 29 Introduction Stacks and Queues Read 1.1-1.3, Chapters 2 & 3 Asymptotic analysis Big-O and other Notations Project 1 released Read section 4.1   Priority queues & heaps Binary Heaps Read chapter 6 Quiz #1 Oct 6 Leftist Heaps Read chapter 6 Skew Heaps Binomial Queues Finish reading Chapter 6 Start reading Chapter 4 Project #1 due tonight! Homework #1 released   Trees Binary Search Trees Read Chapter 4 Oct 13 Balanced Search Trees AVL Trees Read Chapter 4 Quiz #2 Splay Trees   Finish Splay Trees Project 2 description Homework #1 discussion Project 2, Phase A released Oct 20 B-trees Finish reading Chapter 4 Project 2, Phase B released Group Quiz #3 Project 2, Phase A due! Start reading Chapter 5   Finish B-trees Hashing (1) Review: Heaps and Trees Start reading Chapter 5 Oct 27 Hashing (2) Project 2 due! Read chapter 5 Homework 2 released Hashing (3) Group Quiz #4 Read chapter 5   Midterm Review Homework 2 due! Nov 3 MIDTERM Disjoint Set ADT (1) Read Chapter 8 Project 3 released Disjoint Set ADT (2) Sorting Basics Read Chapter 8 Start reading Chapter 7 Nov 10 Comparison-based Sorting Feedback thru CIDR Read Chapter 7 Sorting Lower Bounds Breaking the n log n Barrier Read Chapter 7   Sorting Lower Bounds, on white-board External Sorting, on white-board Read till 7.10.4 Nov 17 Graphs Topological Sort Project 3, in-progress checkin! Group Quiz #5 Project 3 due! Shortest Path Algorithms Nov 24 Quiz #5 Discussion Shortest Path Algorithms continued Minimum Spanning Trees Homework #3 released No section - Thanksgiving! No class - Thanksgiving! Dec 1 Amortized Analysis (general technique and skew heaps bound), on white board Read Sections 11.1-11.3 Randomized Data Structures (Treaps, Skip Lists)   Guest lecture #1 Information Retrieval - by Ethan-Phelps Goodman Homework 3 due! Dec 8 Guest lecture #2 Zero-knowledge Proofs and Sets - by William Pentney Final Review Quiz #6 Class survey, tablet survey No class Dec 8 FINAL   CREDITS Most of the lecture slides presented here were originally developed by Steve Wolfman for Winter 2000 CSE 326, and later modified and re-organized by Bart Niswonger, Hannah Tang, Brian Tjaden, and Luke McDowell. Rajesh Rao crafted a new set of slides for Winter 2003, some of which are used here as well.

	Department of Computer Science & Engineering University of Washington Box 352350 Seattle, WA  98195-2350 (206) 543-1695 voice, (206) 543-2969 FAX [comments to cse326-staff at cs.washington.edu]