Week of Monday Wednesday Thursday Friday
January 3
  • Welcome to CSE 326
  • Stacks and Queues
  • Lists
  • Multi-lists
Project #1 distributed 		aMAZEing slides from section.
  • Proof by Induction
  • Asymptotic Analysis
Quiz #1 (Postscript) distributed
January 10
  • Silicon Downs
  • Asymptotic Analysis
HW#1 DUE! (Postscript)
  • Priority Queues
  • Heaps
Quiz #2 (Postscript) distributed PROJECT #1 DUE!
  • Heaps
  • d-Heaps
January 17 No class. Martin Luther King Day. HW#2 DUE! (Postscript) Project #2 distributed
  • Mergeable Priority Queues
  • Skew heaps
  • Leftist heaps
Quiz #3 (Postscript) distributed
Dynamic programming (DNA sequence alignment) slides:

Proving asymptotic bounds notes:

  • Tree Review
  • Binary Search Trees
January 24
  • BSTs continued
HW#3 DUE! (Postscript)
  • B-Trees
  • 2-3 Trees/2-3-4 Trees
Midterm review worksheet:
  • AVL Trees
January 31 PROJECT #2 DUE!
  • AVL Trees
  • Splay Trees
Official midterm review worksheet:
  • Splay Trees
Midterm Exam
February 7 Project #3 distributed
  • Hash tables
  • Hash functions
  • Hash tables continued
  • Collision resolution
Quiz #4 (Postscript) distributed
Amortized analysis of rehashing:
  • Hash tables continued
  • Case study
  • Extendible hashing
February 14
  • How to make a good maze
  • Disjoint Set Union/Find ADT
  • Weighted union
  • Path compression
HW#4 DUE! (Postscript)
  • New operations in leftist heaps
  • Binomial Queues
  • Treaps
  • Randomized Skip Lists
PROJECT #3 DUE! at 5PM. One late day buys you 10PM Friday.
Quiz #5 (Postscript) distributed

Debugging tactics:

Worksheet: 		Project IV distributed
Wrap-up and homework review in class.
February 21 No class. Presidents Day.
  • k-D Trees
  • Quad Trees
HW#5 DUE! (Postscript)

Sorting by Comparison Slides (Selection Sort, Quick Sort, Merge Sort and lower bound on sorting by comparison):

Sorting in (kind of) Linear Time Slides (BinSort, Radix Sort, Radix Sorting other data types):
February 28 Sorting and the Memory Hierarchy:
  • Topological sort
  • Graph properties
Some graphs you might have seen under different circumstances: Unofficial Final Review Worksheet (shhh. don't tell Darth):
  • Dijkstra's Algorithm: Shortest path
  • Kruskal's Algorithm: Minimum spanning tree
March 6
  • Greedy algorithms
  • Divide&Conquer algorithms
  • Dynamic Programming
PROJECT IV DUE! at 10PM, Tuesday, March 7; NO LATE DAYS!
  • Backtracking
  • Randomized algorithms
  • Course Overview
Official Final Exam Worksheet:
Final exam is 2:30-4:20 p.m. Monday, Mar. 13, 2000