lec0406-Hashing1 - Announcements MP 6 available Due 4/15...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
Suppose we have the following data… …and we want to be able to retrieve a name, given a locker number. Locker Number Name 103 Jay Hathaway 92 Linda Stencel 330 Bonnie Cook 46 Rick Brown 124 Kim Petersen Now suppose our keys are not so nicely described… Course Number -> Schedule info Color -> BMP Vertex -> Set of incident edges Flight number -> arrival information URL -> html page Announcements: MP 6 available. Due 4/15, 11:59p. Today: Hashing Introduction:
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Some general vocabulary A dictionary is a structure supporting the following: void insert(kType & k, dType & d) void remove(kType & k) dType find(kType & k) An associative array IS a dictionary – Overloads the [] operator for insert and find: myDictionary[“Miguel”] = 22; dType d = myDictionary[“Miguel”];
Background image of page 2
(defn) Keyspace – a (mathematical) description of the keys for a set of data. Goal: use a function to map the keyspace into a small set of integers. What’s fuzzy about this goal?
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/26/2012 for the course CS CS 225 taught by Professor Heeren during the Spring '09 term at University of Illinois, Urbana Champaign.

Page1 / 12

lec0406-Hashing1 - Announcements MP 6 available Due 4/15...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online