data-structures-queues

Question 1

What does the acronym FIFO mean?

Answer 1

First-in-first-out: The first thing “enqueue”d onto the queue is the first thing that be “dequeue”d out.

Question 2

What methods are available on a Queue data structure?

Answer 2

1. enqueue(value) - adds a value to the back of the queue
2. dequeue() - removes the “front” value from the queue and returns it
3. peek() - returns the “front” value of the queue without removing it

Question 3

What must you do to access the value at an arbitrary point in a queue (not just the “front”)?

Answer 3

Keep “dequeue”ing the queue and store each “dequeue”d value in a variable until you reach the arbitrary point. Then you can “enqueue” the “dequeue”d values back onto the queue.