CSC 326
LAST HOMEWORK MARKED; AVAILABLE OUTSIDE MY OFFICE.
schedule
See the
official
outline
for the grading scheme, due dates, office hours, etc.
What will be covered:
From the text:
-
Chapter 3: 3.4 Splay Trees, 3.5 Skip Lists. MAYBE.
-
Chapter 8: Network Flow and Matching
-
Chapter 9: Text Processing
-
Chapter 10: Number Theory and Cryptography
-
Chapter 11: Network Algorithms
-
Chapter 12: Computational Geometry
-
Chapter 14: Algorithmic Frameworks
From notes:
-
Binomial Queues. Notes to be provided by instructor.
(Jean Vuillemin's original paper.)
-
Ziv-Lempel Algorithm.
Chapter 1 from the book
"Applied Combinatorics on Words". This is a postscript file.
The Ziv-Lempel algorithm is on pages 82-83.
-
Backtracking.
Notes to be provided by instructor.
Announcements
-
An old final from 2003.
It is a postscript file.
-
Last homework is marked and can be picked up outside my office.
-
Homework #3 can be turned in Friday, March 3 without penalty.
-
Homework #2 is marked and can be picked up outside my office.
-
From the preliminary final exam schedule:
C SC 326 TUE 18 APR 9:00 AM.
-
Room for final:
DSB C114.
Assignments
Code
Links
