Data Structure

Question 1

What does the acronym LIFO mean?

Answer 1

last-in-first-out (LIFO) operations: the last thing pushed onto the stack is the first thing that can be popped 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

Keep popping until you get to the point you want.

Question 4

What does the acronym FIFO mean?

Answer 4

first-in-first-out (FIFO) operations: the last thing enqueued onto the queue is the first thing that can be dequeued out.

Question 5

What methods are available on a Queue data structure?

Answer 5

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

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

peek( )

Question 6

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

Answer 6

Keep dequeue-ing