Miscellaneous on Data Structures MCQ question and answer with solution

A. To handle dynamic sets with fast access

B. To provide probabilistic balancing and efficient insertion

C. To maintain large, static datasets

D. To handle dynamic sets with fast access

A. Hash Map

B. Binary Search Tree

C. Interval Tree

D. Segment Tree

A. To handle large datasets with quick access

B. To maintain a balanced binary search tree

C. To support fast dynamic insertions

D. To efficiently manage and search for key prefixes

A. Deque

B. Heap

C. Priority Queue

D. Stack

A. Stack

B. Queue

C. Hash Table

D. Fenwick Tree

A. When checking for membership with a trade-off between accuracy and space

B. When managing dynamic key-value pairs

C. For storing sorted data

D. For implementing priority queues

A. Trie

B. Heap

C. Queue

D. Circular Buffer

A. Heap

B. Linked List

C. Hash Table

D. Segment Tree

A. To maintain strict balancing of the tree

B. To support efficient priority queue operations

C. To provide amortized time bounds for tree operations

D. To handle fixed-size data efficiently

A. Stack

B. LRU Cache

C. Trie

D. Stack