data

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 poped out.

Question 2

What methods are available on a Stack data structure?

Answer 2

push(value) - adds a value to the “top” of the stack

pop() - removes the top value from the stack and returns it

Question 3

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

Answer 3

remove the top until we get to where we want in stack.

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

Question 6

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

Answer 6

remove from the front until we get to where we want in queue.

Question 7

How are linked lists different from an array?

Answer 7

Linked lists are sequential access (like a queue), not random access (like an array).

Question 8

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

Answer 8

in order to go to a specific place in the list, you have to start at the beginning, then jump from node to node until you get there.