prog1 - CMPSC 130A: Winter 2011 Programming Assignment 1...

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

View Full Document Right Arrow Icon
CMPSC 130A: Winter 2011 Programming Assignment 1 Assigned: Jan 27 Due: Feb 8 (11:59 PM) Hashing is 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., find the smallest element, delete the smallest element, etc. For 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 min-heap (priority queue) and a hash table! The Quash supports insert, delete and lookup using its hash component, and deleteMin using its heap component. In particular, each element in the set will be inserted in both the heap and the hash table. You will need to include pointers in both directions between the 2 instances of the element in the heap and in the hash table. Operations should be executed as follows:
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.

Page1 / 2

prog1 - CMPSC 130A: Winter 2011 Programming Assignment 1...

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