DSA

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
print

Question 3

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

Answer 3

pop until you get to that point

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

dequeue
enqueue
peek
print

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 there

Question 7

How are linked lists different from an array?

Answer 7

sequential access - need to start at beginning and jump from node to node until you get there

does not need to be mutated to scan contents (unlike queues and arrays)

Scott’s answer:
array - 1 data structures, to add, must mutate
linked list - multiple data structure; can add nodes without mutating

Question 8

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

Answer 8

list.next.next.next

.next until you get to the item you’re looking for

Question 9

linked list