#DS Which Data structure is more suitable

Question

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

Comments

Here answer given is Queue. But Why not heap(priority queue)? Bcoz,packet may come in random order, so priority Q can be used to order them.

Answer 1

The key word here is "synchronization". Here Synchronization means that client should receives data in same manner (i.e sequence) in which server is sending. For this purpose the best data structure is Queue. 

In the question they are talking about the speed of Server and Client, not medium. So data will come in the same sequence to the client in which server will send.

Hence Answer will be "B : Queue". 

Answer 2

i think word synchronization  means in  a proper order  and queue is most sutaible data structure bcz they are in FIFO manner 

but if you use stack then order of data get reverse bcz stack is in LIFO manner so wrong . and priority queue used when data are comes randomly and we want to set the order of data so it also wrong and remaining circular  link list in which we need to maintain the  two pointer and , occupying space, and it requires more processing to insert or delete an element  so QUEUE is answer 

BUT if they give circular queue in option then it will be more efficent theh normal queue

Answer 3

B: Queue is most suitable here

a. Circular Linked List can not be use here as in synchronization we need to compare specific length of bits in the same manner sent by server, so no use of Circular Linked List.

c. as stack can process bits in opposite manner as sent by server.

d. Priority Queue is not used here as no priority based operation are performed in synchronization.