Introduction to Algorithms and Data Structures, Fall 2004, Episode 4
Subject : Dictionaries and hashing
Text : chap. 11.1-11.3.1 (omit proofs)
Prerequisites : big-O notation, dynamic sets, surjective functions, doubly-linked list (insert,search, delete)
Comments : This is a leftover from episode 3, so read more comments and exercises there. The second part of the lecture will be devoted to the 1st Major Week Assignment.
Time : Monday, 20 Sep, 9:00–12:00 (3×45min), Room 2A12
Tutorial : 13:00–16:00 (3×45min), Room 2A12
This week's lecture is supplemented by a week assignment called Major Week Assignment 1. You should hand in your solution for Week assignment 1 no later than on 24th September at 13.00. There will be a session devoted to this week assignment during the second part of lecture, on the 20th of September, but start working on it as soon as possible.
No programming assignment this week. Work on the Major Week Assignment 1 instead.
|
|
|
|
last updated 20 Sep, 2004Volodya Shavrukov, Andrzej Wąsowski |