Data Structures Quiz

What is the time complexity of inserting an element into a max-heap?

• O(1)

• O(log n)

• O(n)

• O(n log n)

In a max-heap, the root node contains the:

• Maximum element

• Minimum element

• Middle element

• Random element

Which of the following is true for a min-heap?

• Parent node is always smaller than or equal to its children

• Parent node is always greater than or equal to its children

• Leaf nodes are greater than their parents

• Elements are sorted in non-decreasing order

What is the time complexity of extracting the maximum element from a max-heap?

• O(1)

• O(log n)

• O(n)

• O(n log n)

Which of the following applications can be implemented using a heap?

• Priority queue

• Graph traversal

• Binary search

• Depth-first search

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

• O(1)

• O(log n)

• O(n)

• O(n log n)

Which of the following techniques is used to handle collisions in a hash table?

• Linear probing

• Binary search

• Depth-first search

• Breadth-first search

What is the primary advantage of using a hash table over an array?

• Fast access to elements

• Memory efficiency

• Simple implementation

• Sorting capability

Which of the following hash functions is commonly used in practice?

• Division method

• Multiplication method

• Mid-square method

• All of the above

What is a "load factor" in the context of a hash table?

• The ratio of the number of elements to the table size

• The ratio of the table size to the number of elements

• The number of collisions divided by the table size

• The number of keys divided by the number of hash functions