Data Science

Question 1

What does the acronym LIFO mean?

Answer 1

Last-in-first-out (LIFO) operations: 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(), and peek(), which returns the “top” value of the stack without removing it.

Question 3

What is Big O notation?

Answer 3

The Big O notation is used to express the upper bound of the runtime of an algorithm and thus measure the worst-case time complexity of an algorithm.

It is a way to measure an algorithm’s efficiency. It measures the time it takes to run your function as the input grows. Or in other words, how well does the function scale.

Question 4

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

Answer 4

Pop values off the top until you access the value that matches what you’re looking for.

Question 5

What does the acronym FIFO mean?

Answer 5

First in, first out

Question 6

What methods are available on a Queue data structure?

Answer 6

Enqueue, dequeue, peek, print

Question 7

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

Answer 7

Dequeue values until you reach that point, and enqueuing dequeued values if need be.