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?

Question 3

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

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) - adds value to the “back” of the queue
dequeue( ) - removes the “front” value from the queue and returns it
peek( ); returns the “front” value

Question 6

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

Answer 6

postpone it until you get to it

Question 7

How are linked lists different from an array?

Answer 7

They don’t have index you can access

Question 8

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

Question 9

What methods are available on a linked lists data structure?

Answer 9

.data - contains the node’s value
.next - reference to the next node in the list, if there is one. if there is no “next” node in the list, typically sets the property to null.