### Stack MCQ - Multiple Choice Questions and Answers

Welcome to the Stack data structure quiz. This Stack data structure quiz consists of 10+ multiple-choice questions (MCQ) with answers and explanations.

To help you check your understanding, we've curated a 10 multiple-choice questions quiz on Stack data structures. Remember, the goal here is to learn, so try answering each question before checking the answers and explanations.

# 1. What is the primary function of a Stack data structure?

A) LIFO operations
B) FIFO operations
C) Both LIFO and FIFO operations
D) None of the above

A) LIFO operations

## Explanation:

The primary function of a stack is to perform Last-In-First-Out (LIFO) operations.

# 2. Which operation is used to add an element to a Stack?

A) Enqueue
B) Dequeue
C) Push
D) Pop

C) Push

## Explanation:

The operation to add an element to a stack is known as "push".

# 3. Which operation is used to remove an element from a Stack?

A) Enqueue
B) Dequeue
C) Push
D) Pop

D) Pop

## Explanation:

The operation to remove an element from a stack is known as "pop".

# 4. What happens when you try to pop an element from an empty Stack?

A) It returns null
B) It returns the top element
C) It causes an underflow
D) It causes an overflow

C) It causes an underflow

## Explanation:

Attempting to pop an element from an empty stack will cause an underflow.

# 5. What is the time complexity of a push operation in a Stack?

A) O(n)
B) O(n log n)
C) O(1)
D) O(n²)

C) O(1)

## Explanation:

The time complexity of a push operation in a stack is O(1), which means it performs the operation in constant time.

# 6. What is the maximum number of elements a Stack can hold?

A) Stack can hold a limited number of elements
B) Stack can hold an infinite number of elements
C) It depends on the memory available
D) It depends on the data type of the elements

C) It depends on the memory available

## Explanation:

The number of elements a stack can hold depends on the memory available.

# 7. Is the Stack a static data structure?

A) Yes
B) No

B) No

## Explanation:

Stack is not a static data structure. It can grow and shrink at runtime.

# 8. Which of the following applications may use a Stack?

A) Recursion
B) Parsing
C) Browser history
D) All of the above

D) All of the above

## Explanation:

All listed applications use a stack: recursion, parsing, and browser history.

# 9. What is another name for the top of the Stack?

B) Front
C) Rear
D) Peak

D) Peak

## Explanation:

The top of the stack is often referred to as the "peak" or "top".

# 10. What is the time complexity to get the minimum element from the Stack?

A) O(1)
B) O(n)
C) O(n log n)
D) O(n²)

B) O(n)

## Explanation:

If the stack does not maintain a separate data structure to track the minimum element, it requires O(n) time complexity to get the minimum as we need to traverse all elements of the stack.
We hope this quiz helps sharpen your understanding of stack data structures. Stay tuned for more quizzes on various topics in computer science. Keep learning and happy coding!