Consider a situation where a client receives packets from a server. There may be differences in speed of the client and the server. Which data structure is best suited for synchronization?
(A) Circular Linked List
(B) Queue
(C) Stack
(D) Priority Queue
Answer: (B)
Explanation: Since packets need to be processed in First In First Out order, a queue can be used for synchronization.
Quiz of this Question
Recommended Posts:
- Data Structures | Misc | Question 8
- Data Structures | Misc | Question 10
- Data Structures | Misc | Question 1
- Data Structures | Misc | Question 4
- Data Structures | Misc | Question 6
- Data Structures | Misc | Question 5
- Data Structures | Misc | Question 7
- Data Structures | Misc | Question 2
- Data Structures | Misc | Question 3
- Introduction to Data Structures | 10 most commonly used Data Structures
- Data Structures | Stack | Question 4
- Data Structures | Queue | Question 8
- Data Structures | Stack | Question 5
- Data Structures | Heap | Question 2
- Data Structures | Graph | Question 2
- Data Structures | Hash | Question 5
- Data Structures | Graph | Question 3
- Data Structures | Hash | Question 1
- Data Structures | Array | Question 1
- Data Structures | Hash | Question 2
