Describe why a very large hash table will likely increase the performance (i.e. faster additions and lookup) at the expense of wasting memory, and vice versa, why a small hash table will use less memory but result in a decrease in performance.
What will be an ideal response?
A larger hash table decreases the chance of a collision. At every collision point we end up performing a linear search through a linked list. In the worst case, if every item hashed to the same number we would store everything in a single linked list. In the best case the hash table is large enough so that only a single item is stored at every hash location.
You might also like to view...
Answer the following statements true (T) or false (F)
1. The bubble sort can only sort in ascending order. 2. The sort() method is valuable because it keeps elements of parallel arrays In the correct order. 3. When JavaScript arrays are passed to a function, they are passed by reference. 4. The type of sort routine that, if sorting from smallest to largest, will end up with the smallest item in the first place after the first pass is the bubble sort. 5. If the highest index value in an array is N, to complete a selection sort, N – 1 passes must be made.
The acronym PDF stands for:
A) Portable Document Format. B) Presentation Distribution Format. C) Personal Document Format. D) Private Digital Format.
A ____________________ is a graphic organizer used to map out the various scenes or actions that will take place.
Fill in the blank(s) with the appropriate word(s).
To create 3D RAM or flash memory chips, the memory cells are stacked on top of one another in layers.
Answer the following statement true (T) or false (F)