algos

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 (removes the top value of the stack and returns it), push (adds a value to top of stack)

Question 3

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

Answer 3

pop the values

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 (adds a value to the back of the queue), dequeue (removes a value from the front of the queue and returns it)

Question 6

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

Answer 6

dequeue

Question 7

How are linked lists different from an array?

Answer 7

nodes != elements

Question 8

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

Answer 8

using the .next method