Channi Studies

Linear Probing A hash table with linear probing handles a collision by starting at the key's mapped bucket, and then linearly searches subsequent buckets until an empty bucket is found.  Item 124 should be inserted into bucket 4 since 124 % 10 = 4, but bucket 4 is already occupied, so it searched for next null (empty) bucket appearing linearly starting from the original bucket. Since bucket 5 wa..

Hash TableA hash table is data structure that stores unordered items by mapping (or hashing) each item to a location in an array (or vector).Ex. Given an array with indices 0 ... 9 to store integers from 0 ... 5000, the modulo (remainder) operator can b usd to map 25 to index 5 (25 % 10 = 5), and 149 to index 9 (149 % 10 = 9). A hash table's main advantage is that searching, inserting, and remov..

A deque (pronounced "deck" and short for double-ended queue) is an ADT in which items can be inserted and removed at both the front and back. The deque push-front operation inserts an item at the front of the deque, and the push-back operation inserts at the back of the deque. The pop-front operation removes and returns the item at the front of the deque, and the pop-back operation removes and r..

Circular QueueA queue is an ADT in which items are inserted at the end of the queue and removed from the front of the queue.The queue enqueue oepration inserts an item at the end of the queue.The queue dequeue operation removes and returns the item at the front of the queue. A queue is reffered to as a first-in first-out (FIFO) ADT. Remembering queue = FIFO and stack = LIFO can make your life ea..