GRE Computer Science Practice Book - Question 08
8. Which data structure would be most appropriate to implement a collection of values with the following
three characteristics?
• Items are retrieved and removed from the collection in FIFO order.
• There is no a priori limit on the number of items in the collection.
• The size of an item is large relative to the 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) Array
(D) Binary tree
(E) Hash table
