Computer Science 385
Analysis of Algorithms
Spring 2011, Siena College
Lecture 19: Sorting by Counting; Hashing
Date: Tuesday, March 29, 2011
Agenda
- Announcements
- Class may begin a few minutes late on Thursday due to a
morning medical appointment.
- Problem set 4 due this afternoon.
- Note remaining schedule.
- Exam 2 coming next week: topic cutoff is hashing (which we
should come close to finishing today). Details on the exam coming
Thursday.
- Lecture assignment recap
- Mini Problem Set 5 out
- Sorting by counting
- Hashing
- map/dictionary structure idea
- hash functions: definition and some possibilities
Lecture Assignment 19
Due at the start of class, Thursday, March 31, 2011.
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 19, Joe Student). We will discuss these
questions at the start of class, so no late submissions are
accepted.
- Levitin Exercise 7.1.3, p. 254.
- Levitin Exercise 7.1.4, p. 254.