Data Structures

Question 1

What does the acronym LIFO mean?

Answer 1

Last in first out, the last thing pushed onto the stack is the first thing that can be popped out.

Question 2

What methods are available on a Stack data structure?

Answer 2

push, pop, print

Question 3

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

Answer 3

pop until you get to that value

Question 4

What methods are available on a Queue data structure?

Answer 4

enqueue and dequeue

Question 5

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

Answer 5

dequeue until you get to that value

Question 6

What does the acronym FIFO mean?

Answer 6

First in First out.

Question 7

How are linked lists different from an array?

Answer 7

Linked lists are sequential access (like a queue), not random access (like an array).

Question 8

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

Answer 8

you have to use next until you get to the node