Time left:

[All Quizzes] → [Practical Data Structures] → [Hash Map and Heap]


1. ► hash_map is also part of the standard C++

A.
B.

2. ► Heapsort relies on heap to pick the minimum or maximum element

A.
B.

3. ► A good hash function will be collision free

A.
B.

4. ► Heapify operation just takes O(lg(n)) steps

A.
B.

5. ► STL map provides access in lg(n) time

A.
B.

6. ► Elements in hash_map are ordered

A.
B.

7. ► Hash map guarantees constant time value access

A.
B.

8. ► A pointer map ordering varies from one run to another

A.
B.

9. ► In a min-heap, value at a node is always less than that of its children

A.
B.

10. ► STL map is unordered

A.
B.

11. ► Quick sort always performs better than heapsort

A.
B.

12. ► Merging two heaps is a O(lg(n)) operation

A.
B.


© 2016 VirtuQ™ Education All right reserved. | Terms of Use | Privacy Policy