Computer Science 385
Analysis of Algorithms
Spring 2011, Siena College
Lecture 25: More Graphs; Huffman Codes
Date: Tuesday, April 19, 2011
Agenda
- Announcements
- Tomorrow: I plan to be around for much of the day, though
120 students will have priority during their usual lab meeting
times
- Problem set 6 due tomorrow
- but... late penalty clock will not run over break
(starts 9 AM next Tuesday)
- Looking ahead to the final: take home due at the scheduled time?
- Lecture assignment recap
- Dijkstra's Algorithm example
- Dijkstra's Algorithm implementation discussion
- Using the mapping system to display results
- Huffman codes
Lecture Assignment 25
Due at the start of class, Tuesday, April 26.
Please submit answers to these questions
either as a hard copy (typeset or handwritten are OK) or by email to
jteresco AT siena.edu by the start of class. Please use a clear subject line
when submitting by email (e.g., CS 385 Lecture
Assignment 25, Joe Student). We will discuss these
questions at the start of class, so no late submissions are
accepted.
- Levitin Exercise 9.4.1, p. 332.
Links