data-structures-queues

Question 1

What does the acronym FIFO mean?

Answer 1

first in first out

Question 2

What methods are available on a Queue data structure?

Answer 2

• enqueue(value) - adds a value to the “back” of the queue

- dequeue() - removes the “front” value from the queue and returns it

Question 3

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

Answer 3

manipulate the dequeue and the enqueue until you retrieve the value