title: Choice of Data Structures
body: <p>I've found the question below in the CS GRE sample test but can't be sure if it's a) or e) Can anyone point out which one it is?</p>
  
  <p>Thanks in advance</p>
  
  <p>Which data structure would be most appropriate to implement a collection of values with the following three characteristics?</p>
  
  <p>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</p>