We can keep the collision list short and, on average, bounded by a small constant because:
A. we can use a hash function that produces uniform hashing reasonably well
B. we can experimentally make the hash table array as large as we want until the number of collisions are minimized, on average, to the point where we would like it to be
C. if the hash table is large enough, only an occasional collision will occur
D. All of the above
D
You might also like to view...
What does the black square in the proxy indicate?
What will be an ideal response?
What are the keyboard shortcuts for Print?
What will be an ideal response?
Animated special effects begin as a sequence of ____ images, in which one or more objects are moved or otherwise changed between each frame.
A. 2-D B. 3-D C. double D. triple
If you ____________________, or decrease the number of pixels, information is deleted from the image.
Fill in the blank(s) with the appropriate word(s).