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(value), pop( ), sometimes peek( )

Question 3

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

Answer 3

remove the top values in order to access the value 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

enqueue(value), dequeue( ), sometimes peek( )

Question 6

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

Answer 6

Remove the top values in order to access the value you want

Question 7

How are linked lists different from an array?

Answer 7

Linked lists have sequential access, not random access like arrays

Question 8

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

Answer 8

Use .next to find the node