DSA + System Design 11

Which of the following properties is crucial for a good hash function?

• Slow computation

• Producing the same hash for different inputs

• Producing a unique hash for every unique input

• Large output size

What is the load factor in a hash table?

• The ratio of the number of entries to the number of slots

• The time complexity of hashing

• The speed of hash function computation

• The size of the hash table

what is the average case time complexity of searching an element in a hash table?

• O(1)

• O(log n)

• O(n)

• O(n log n)

Which of the following is true about unordered_set / HashSet / set?

• Elements are sorted in ascending order

• Elements are accessed using an index

• Duplicate elements are not allowed

• Insertion and lookup operations have a time complexity of O(log n)

What is the primary advantage of using an unordered_set over a set in C++?

• Faster lookup and insertion

• Maintains sorted order

• Uses less memory

• Supports duplicates

Which data structure is used at backend for inbuild unordered_set / hashset / set.

• Array

• Linkedlist

• Hash table

• tree

What is the time complexity of searching an element in hash table in worst case?

• O(1)

• O(logn)

• O(n)

• O(n^2)

What are the main "patterns in problems", which can be solve using hashing?

• Duplicate Detection

• Frequency Counting

• efficient data retrieval

• String Anagrams

• All of the Above

What are the features of "Ineuron System Design & DSA" course

• Basic to Advance

• Lots of practice problems

• Maang based problem solving in class

• Doubt Support

Hashing is used to optimize which type of operation in graph algorithms?

• Depth-First Search (DFS)

• Breadth-First Search (BFS)

• Topological sorting

• Dijkstra's shortest path algorithm