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

Question 3

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

Answer 3

Pop each of the values that are on top of the intended value

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 values until you reach the arbitrary point

Question 7

How are linked lists different from an array?

Answer 7

Each node contains a reference to the next node, ending with a null value. No indeces to access specific points

Question 8

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

Answer 8

Using .next an arbitrary number of times