In which data structure would you use a hash table?
A. For sorted data storage
B. For maintaining hierarchical relationships
C. For implementing a priority queue
D. For fast data retrieval and storage
Answer: Option D
A. For sorted data storage
B. For maintaining hierarchical relationships
C. For implementing a priority queue
D. For fast data retrieval and storage
Answer: Option D
Which data structure is commonly used to implement a stack in function call management?
A. Stack
B. Queue
C. List
D. Tree
What data structure is most appropriate for implementing a scheduling system for processes?
A. Stack
B. Hash Table
C. Priority Queue
D. Binary Search Tree
Which data structure is used to implement a LRU (Least Recently Used) cache?
A. Linked List
B. Deque
C. Hash Table
D. Linked List
Join The Discussion