database

Question 1

What does the acronym LIFO mean?

Answer 1

facilitate last-in-first-out (LIFO)

Question 2

What methods are available on a Stack data structure?

Answer 2

pop,push,peek,print

Question 3

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

Answer 3

keep poping

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

Question 7

How are linked lists different from an array?

Answer 7

linked list, you have to move element one by one

Question 8

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

Answer 8

have to use next from the head, then use next every time