Data Structures

Question 1

What does the acronym LIFO mean?

Answer 1

last-in-first-out

the last thing pushed onto the stack is the first thing that can be popped out.

Question 2

What methods are available on a Stack data structure?

Answer 2

print()
pop()
push()
peek()

Question 3

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

Answer 3

pop() them off until you can peek() at the point you want

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

peek()
print()
dequeue()
enqueue()

Question 6

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

Answer 6

dequeue it until we reach the point

Question 7

How are linked lists different from an array?

Answer 7

you cant access the data in linked list with indexes.

Question 8

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

Answer 8

You would need to access the next property of each node to move to the next node