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

peek(), which returns the “top” value of the stack without removing it.

print() for debugging.

push() which adds an element to the top of stack.

pop() which removes an element from top of stack.

Question 3

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

Answer 3

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

Gotta pop it to make it

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()
EnQueue()
Dequeue()

Question 6

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

Answer 6

Gotta DQ it to Get it.

Question 7

How are linked lists different from an array?

Answer 7

Linked list relies on references where each node consists of the data and the references to the previous and next element.

Question 8

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

Answer 8

next next next and more next