Stack

Question 1

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

Answer 1

Dequeue until you reach desired value

Question 2

What does the acronym FIFO mean?

Answer 2

First In First out

Question 3

What methods are available on a Queue data structure?

Answer 3

enqueue()
dequeue()
peek()

Question 4

How are linked lists different from an array?

Answer 4

Linked lists are sequential access (like a queue), not random access (like an array).

Question 5

How would you access an arbitrary node in a linked list (not just the “head”)?

Answer 5

You would have to jump from node to node until you reach it. Through the .next property.