### CISC 621 Agorithm Design and Analysis -- course log page

Homework assignments     Textbook     Initial syllabus     Saunders' homepage,
Emails: David Saunders saunders@cis.udel.edu, TA George Oikonomou goikonom@udel.edu, Entire class CISC621-010-03F@udel.edu.

• Dec 9: Cook's thm, polynomial time reductions, review

• Dec 4: P, NP, NPC.

• Dec 2: FFT as Vandermonde matrix decomposition

• Nov 25: polynomial, integer, and matrix multiplication

• Nov 20: APSP, transitive closure, and Gaussian elim.

• Nov 18: APSP, transitive closure, and mat mul

• Nov 13: Dijkstra's alg, matrix ops

• Nov 11: BFS, DFS, strong components

• Nov 6: More MST

• Nov 4: Minimal Spanning Trees

• Oct 30: midterm

• Oct 28: Union-Find

• Oct 23: review, Fibonacci Heaps
Handout: ~saunders/621/binomialHeapA.h (accelerated)
Handout: ~saunders/621/binomialHeapD.h (decrease-key)
Handout: ~saunders/621/review.html (midterm review sheet)

• Oct 21: Accelerated Binomial Heaps

• Oct 16: Binomial Heaps

• Oct 14: red-black trees, Binomial Heaps

• Oct 9: B-trees, red-black trees

• Oct 7: Hash, B-trees

• Oct 2: Remarks on multiple array representation, Hash tables, B-trees if time permits.

• Sept 30: Towards an extension of the Master theorem. Finish on select().
Homework: problem G assigned, due Oct 11.

• Sept 25: Order statistics, Finding medians.
Homework: problem F assigned, due Oct 9.
Handout: ~saunders/621/select/*.

• Sept 23: introspectiveSort, A sorting lower bound.
Handout: ~saunders/621/sort/*.

• Sept 18: University closed in honor of hurricane Isabel.

• Sept 16: heapSort quickSort.
Homework: problem D and E assigned, D due on Sept 30, E on Oct 7.

• Sept 11: Master Theorem, mergeSort