data-structures-queues Flashcards

1
Q

What does the acronym FIFO mean?

A

First in first out

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What methods are available on a Queue data structure?

A

Enqueue, dequeue, peek

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

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

A

You have to use the dequeue and enqueue methods to reach the values further in (can use loops)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly