MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
| 1. |
Which of the following variant of a hash table has the best cache performance? |
| A. | hash table using a linked list for separate chaining |
| B. | hash table using binary search tree for separate chaining |
| C. | hash table using open addressing |
| D. | hash table using a doubly linked list for separate chaining |
| Answer» D. hash table using a doubly linked list for separate chaining | |