• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

GATE | GATE 2017 MOCK II | Question 21

Which data structure would be the most appropriate to implement a collection of values with the following three characteristics?
i) Items are retrieved and removed from the collection in FIFO order.
ii) There is no priori limit to the number of items in the collection.
iii) The size of an item is large relative to storage required for a memory address.

(A)

Singly linked list with head and tail pointers

(B)

Doubly linked list with only a head pointer

(C)

Binary tree

(D)

Hash table

Answer

Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :
Share your thoughts in the comments