CSE 326 -- Winter 2001

For future lectures, the schedule is tentative.

Week 1
Wed, Jan 3 Course Introduction, mathematics review
Course Organization handout
Fri, Jan 5 Proof by induction, recursion, RAM model
HW #1 out

Week 2
Mon, Jan 8 Big-Oh notation, Binary Search
Wed, Jan 10 Binary Search, Selection Sort, ADTs
Fri, Jan 12 ADTs, lists
HW #1 in

Week 3
Mon, Jan 15 HOLIDAY -- Martin Luther King, Jr.
Wed, Jan 17 HW #1 review, Project #1 discussion, programming tips
Fri, Jan 19 HW #1 review (conclude), lists, stacks, trees

Week 4
Mon, Jan 22 Binary search trees
Project #1 in
HW #2 out
Wed, Jan 24 AVL trees I
Fri, Jan 26 AVL trees II

Week 5
Mon, Jan 29 Splay trees
HW #2 in
HW #3 out
Wed, Jan 31 B-trees
Fri, Feb 2 MIDTERM (closed book, closed notes)

Week 6
Mon, Feb 5 Midterm review/return
Wed, Feb 7 Hashing I
HW #3 in
Project #2 out
Fri, Feb 9 Hashing II (analysis)

Week 7
Mon, Feb 12 Heaps
Wed, Feb 14 Graphs I: representation, topological sort
Fri, Feb 16 Graphs: Shortest path algorithms: unweighted, Dijkstra
Project #2 in
Project #3 out
HW #4 out

Week 8
Mon, Feb 19 HOLIDAY -- President's Day
Wed, Feb 21 Graphs: shortest path: negative weights, acyclic; Prim's MST algorithm
Fri, Feb 23 Graphs: Union/Find, Kruskal's MST algorithm

Week 9
Mon, Feb 26 Sorting I: basic algorithms
HW #4 in
HW #5 out
Wed, Feb 28 Sorting II: Shellsort, heapsort, mergesort
Fri, Mar 2 Sorting III: quicksort, quickselect

Week 10
Mon, Feb 26 Sorting: decision trees, bucket sort, external sorting
Project #3 in
Wed, Feb 28 Randomized Algorithms: primality, matrix product verification
HW #5 in
Fri, Mar 2 Review

FINAL EXAM: Monday, March 12, 2:30-4:20pm