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(), .pop(), .peek() (convenience method), and .print() (debugging method)

Question 3

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

Answer 3

Continuously pop until the arbitrary point is reached.

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(), .dequeue(), and .peek() (convenience method).

Question 6

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

Answer 6

Continuously dequeue until the arbitrary point is reached.

Question 7

How are linked lists different from an array?

Answer 7

Linked lists have a

Question 8

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

Answer 8

Continuously next(ing) until the arbitrary point is reached.