EMERGING TRENDS IN SOFTWARE ENGINEERING
MISCELLANEOUS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
*There exists datasets for which a hash table has O(n) performance for insertion, deletion, and searching-the same as for a linked list.
|
|
True
|
|
|
False
|
|
|
Either A or B
|
|
|
None of the above
|
Explanation:
Detailed explanation-1: -c. Like HashMap, Hashtable also stores key/value pairs. However, neither keys nor. values can be null.
Detailed explanation-2: -The hash table is an array of linked lists. Data elements that hash to the same value are stored in a linked list originating from the index equivalent of their hash value.
There is 1 question to complete.