Data

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

.push()- put something on top
.pop()- take something off the top
.peek()- look at whats on top without taking it off

Question 3

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

Answer 3

• store the items you ‘pop’ off somewhere
• if you can destroy the stack, just keep using pop

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()- add something to the queue
.dequeue()- remove something from the queue

Question 6

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

Answer 6

Dequeue all the items until you reach the point you’re looking for

Question 7

How are linked lists different from an array?

Answer 7

Items in a linked list can only be accessed by sequentially traversing the list. Arrays can directly access desired values.

Question 8

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

Answer 8

Use next node to get where we need to go