This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Programming Assignment #3 CS163: Data Structures Problem Statement: Hash tables are very useful in situations where an individual wants to quickly find their data by the value or search key. You could think of them as similar to an array, except the client program uses a key instead of an index to get to the data. The key is then mapped through the hash function which turns it into an index! You have decided to write a table abstract data type, using a hash table/function with chaining (for collision resolution), to support quick access to your contacts list. Enter in someones name (keyword) and the matching information will be provided. It will run through your hash function (maybe it adds up every character or every other characters ascii value) and mods it by the table size and provides an index to the hash table where it can traverse the chain to find a match...
View Full Document
This note was uploaded on 10/16/2011 for the course CS 163 taught by Professor Fant during the Spring '09 term at Portland State.
- Spring '09