data structures

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, pop, peek(maybe), print(maybe)

Question 3

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

Answer 3

keep popping until you find the item

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 and dequeue

Question 6

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

Answer 6

dequeue until you get where you want to get

Question 7

How are linked lists different from an array?

Answer 7

you don’t have direct access when looking through a linked list, only what’s currently in front

Question 8

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

Answer 8

jump through the next in the list until you find it