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

This page is a log in reverse temporal order of
notes on lectures, assignments, handouts etc.
This page will be updated after each class session with the newest material
appearing at the top.
Please reload this page if you may be viewing a stale copy from your browser cache.
Latest update: Dec 12

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

Reading: Chapter 34
Dec 4: P, NP, NPC.

Reading: Chapter 34
Dec 2: FFT as Vandermonde matrix decomposition

Reading: Chapter 30
Nov 25: polynomial, integer, and matrix multiplication

Reading: Chapter 28.4, 30
Nov 20: APSP, transitive closure, and Gaussian elim.

Reading: Chapter 25, 28.2
Nov 18: APSP, transitive closure, and mat mul

Reading: in Chapter 25
Nov 13: Dijkstra's alg, matrix ops

Reading: read section 24.3
Nov 11: BFS, DFS, strong components

Reading: read chapter 22.
Nov 6: More MST

Reading: read chapter 24.
Nov 4: Minimal Spanning Trees

Reading: read chapter 23.
Oct 30: midterm
Oct 28: Union-Find

Reading: read chapter 21.
Oct 23: review, Fibonacci Heaps

Reading: read chapter 20.

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

Reading: scan CLR chapter 17, read chapter 20.
Oct 16: Binomial Heaps

Reading: CLR chapter 19.
Oct 14: red-black trees, Binomial Heaps

Reading: CLR chapter 19.
Oct 9: B-trees, red-black trees

Reading: scan CLR chapter 12, read chapter 13.
Oct 7: Hash, B-trees

Reading: CLR chapter 18.
Oct 2:
Remarks on multiple array representation, Hash tables, B-trees if time permits.

Reading: scan CLR chapter 10, read chapter 11.
Sept 30: Towards an extension of the Master theorem.
Finish on select().

Homework: problem G assigned, due Oct 11.

Reading: CLR Chapter 9.
Sept 25: Order statistics, Finding medians.

Reading: CLR Chapter 9.

Homework: problem F assigned, due Oct 9.

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

Reading: CLR Chapter 8.1.

Handout: ~saunders/621/sort/*.
Sept 18: University closed in honor of hurricane Isabel.
Sept 16: heapSort quickSort.

Reading: CLR Chapter 6, 7.

Homework: problem D and E assigned, D due on Sept 30, E on Oct 7.
Sept 11: Master Theorem, mergeSort

Reading: CLR Chapters 2, 4.

Homework: problems B and C assigned, due Sept 25.
Sept 9: Measuring cost less precisely (but more usefully).

Example problem: Given a set of points in the plain, find a pair with minimal

Heapsort.
distance apart.

Reading: CLR Chapters 3, 4, 33.4.
Sept 4: Algorithm analysis introduced with a
straightforward problem, a slightly interesting problem,
and a challenging problem.

Reading: Scan CLR chapters 1-2, read sections 9.1.

Homework: problem A assigned, due Sept 18.
####
saunders@cis.udel.edu