Week 12 Quiz Questions

Question 1

What does the acronym LIFO mean?

Answer 1

last in first out

Question 2

What methods are available on a Stack data structure?

Answer 2

push(), pop(), peek()

Question 3

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

Answer 3

must remove items from the top of stack until you get to the arbitrary point

Question 4

What does the acronym FIFO mean?

Answer 4

first in first out

Question 5

What methods are available on a Queue data structure?

Answer 5

dequeue(), enqueue(value)

Question 6

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

Answer 6

keep removing items (dequeuing) from the front until you get the wanted valiue