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 Print Pop Push

Question 3

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

Answer 3

You’d have to pop items off until you got to the value
then keep the popped items in an array or something
and then push them back on once you got that value

Question 4

What does the acronym FIFO mean?

Answer 4

First in first out

Question 5

What methods are available on a Stack data structure?

Answer 5

enqueue,deqeue,peek

Question 6

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

Answer 6

you have to dequeue front value until you get to the value you want

Question 7

How are linked lists different from an array?

Answer 7

A linked list is a collection of objects known as a node where node consists of two parts, i.e., data and address. Array elements store in a contiguous memory location

Question 8

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

Answer 8

you keep calling next until you get the value you want