lec11 - Click to edit Master subtitle style 2/7/11 Sundar...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon

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

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

Unformatted text preview: Click to edit Master subtitle style 2/7/11 Sundar B. CS C341 / I S C361 Data Structures & Algorithms Dictionary Data Structures - Hashing Hash Tables- Bucketing and Hashing- Separate Chaining- Hash functions- Good hash functions- Universal hash functions 11 2/7/11 Sundar B. 2/7/11 Sundar B. Dictionary Data Structures Consider an un-ordered dictionary: Typically, elements (and keys) are unique. Need to optimize find, add, and delete operations (typically in that order). Simplest case: The universe of keys, U, is s.t U is a subset of natural numbers |U| is O(N) where N is the size of the dictionary Representation: In this case, a table T indexed from 0 to |U|-1 is a good representation. 2/7/11 22 Sundar B. 2/7/11 Sundar B. Hash Tables Suppose the set of keys stored in a Dictionary is small compared to the universe (range) of keys: Need a good mapping from (a large set of) values to (a small set of) integers i.e. indices Typically referred to as a hash function h : U --> { 0, 1, , m-1 } where m is the size of the table....
View Full Document

Page1 / 11

lec11 - Click to edit Master subtitle style 2/7/11 Sundar...

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