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 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
peak()

Question 3

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

Answer 3

access the value by pop() method until you get to the 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
peek() - returns the “front” value of the queue without removing it.

Question 6

What must you do to access the value at an arbitrary point in a queue

Answer 6

dequeue() and peek() repeatedly until the arbitrary point comes up.

Question 7

How are linked lists different from an array?

Answer 7

linked lists are sequential access like a queue and not random access like an array

Question 8

How would you access an arbitrary node in a linked list?

Answer 8

You use series of .next