Pa1 - Programming Assignment 1 Posted on Mon Apr 25 due Mon May 9 CS 130A Data Struc Alg Hashing is very useful if we are only interested in insert

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

View Full Document Right Arrow Icon
Programming Assignment # 1 Posted on Mon, Apr 25, due Mon, May 9 Hashing is very useful if we are only interested in insert , delete , and find operations; e.g., delete (10) or insert (5) or find (100) . But a hash table provides no assistance for searches that depend on the order or rank of an element in a set, e.g., Fnd the smallest element, delete the largest element, etc. ±or the latter type of operation, heaps are more appropriate. On the other hand heaps do not support a general delete operation, e.g., delete (100) ; they only support deleting the min element. In this programming assignment, you will develop a “compound” data structure called Quash , which is composed of both a max-heap (priority queue) and a hash table! The Quash supports inserts, delete and lookup using its hash component, and deleteMax using its heap component. In particular, each element in the set will be inserted in both the heap and the hash table. You will
Background image of page 1

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

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

This note was uploaded on 01/23/2012 for the course CS 130a taught by Professor Staff during the Spring '08 term at UCSB.

Page1 / 2

Pa1 - Programming Assignment 1 Posted on Mon Apr 25 due Mon May 9 CS 130A Data Struc Alg Hashing is very useful if we are only interested in insert

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

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