post final project

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

pop(), push(), peek()

Question 3

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

Answer 3

you need to remove the values above until you get to the one that you want

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 and enqueue and peek

Question 6

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

Answer 6

you need to dequeue the values until you get to the value that you want