Stack

Question 1

What is a stack?

Answer 1

A linear data structure that operates on the principle of Last-In, First-Out (LIFO), meaning the most recently added element is the first one to be removed

Question 2

What are the four key operations that you can perform on a stack?

Answer 2

Push (add), Pop (remove), Peek (see the top element), IsEmpty

Question 3

What are some use cases of stacks?

Answer 3

1. Web Browser History
2. Undo Function
3. Function Call Management

Question 4

What is the time complexity of the push operation on a stack?

Answer 4

O(1)

Question 5

What is the time complexity of the pop operation on a stack?

Answer 5

O(1)

Question 6

What is the time complexity of the peek operation on a stack?

Answer 6

O(1)

Question 7

What is the time complexity of the IsEmpty operation on a stack?

Answer 7

O(1)

Question 8

What is the term for popping an element from an empty stack?

Answer 8

Stack Underflow

Question 9

What is the term for pushing an element onto a stack that’s already full?

Answer 9

Stack Overflow