Hash tables are fast because:
A. arrays, used in hash tables, are fast
B. they take less memory space and can easily fit in the cache of a typical computer
C. if we have uniform hashing, then insertion, searching, and deleting are all (1 ) operations
D. they use the binary search algorithm when searching for elements
C
Computer Science & Information Technology
You might also like to view...
A(n) ________ stores the locations of all records for a given field to improve database performance when searching for records on that field
Fill in the blank(s) with correct word
Computer Science & Information Technology
Webmail is a free service accessed using a browser, but its services cannot be accessed using Microsoft Outlook.
Answer the following statement true (T) or false (F)
Computer Science & Information Technology