Podcast
Questions and Answers
What is the search complexity if the index can be instantaneously derived from the object key?
What is the search complexity if the index can be instantaneously derived from the object key?
- O(n^2)
- O(n)
- O(lg n)
- O(1) (correct)
What is the main purpose of a hash function?
What is the main purpose of a hash function?
- To compute the table index from the key (correct)
- To delete a specific key
- To search for a specific key
- To sort the data
What is the ideal property of a hash function?
What is the ideal property of a hash function?
- It must be easy to calculate (correct)
- Each index is more likely to be generated for each key
- It must be difficult to calculate
- It must always generate the same index for each key
What is the name of the data structure that uses a hash function to map keys to indexes associated with values?
What is the name of the data structure that uses a hash function to map keys to indexes associated with values?
What is the name of the technique that instantly calculates the index of the object?
What is the name of the technique that instantly calculates the index of the object?
What is the name of the ideal hash function that generates a different hash value for each key?
What is the name of the ideal hash function that generates a different hash value for each key?
What is the advantage of using a hash table?
What is the advantage of using a hash table?
What is the worst-case search complexity for an unsorted array?
What is the worst-case search complexity for an unsorted array?
What is the average-case search complexity for a sorted array?
What is the average-case search complexity for a sorted array?
What is the best-case search complexity for a hash table?
What is the best-case search complexity for a hash table?
Flashcards are hidden until you start studying
