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...
FIGURE 3-1The line in Figure 3-1 above was drawn using the ColorPanel class.
Answer the following statement true (T) or false (F)
Doug wants to store hyperlinks to Word documents in a field. Explain how this is done. Use the file, Vail.docx as a reference for the hyperlink data for the first record.
What will be an ideal response?
Codec is an acronym for which of the following?
A. Encoder/decoder B. Compression/decompression C. Compatible/non-compatible D. Commissioned/decommissioned
Which of the following fire extinguisher classifications should be used on an electrical fire?
A. Class A B. Class B C. Class C D. Class D