Data Structures

Question 1

What does the acronym LIFO mean?

Answer 1

Last-in-first-out
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, and peek operation

Question 3

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

Answer 3

Because of the LIFO rule. You must pop all the values above the arbitrary point in order to get access to it.

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

Enqueue, dequeue, 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 must dequeue all the values above the arbitrary point in order to get access to it.

Question 7

What is the time-complexity of a queue?

Answer 7

Linear time