Stacks - Quiz | Analytics

Q: What happens when you try to pop an element from an empty stack?

A. The stack remains unchanged
B. An error occurs
C. The top element is returned with no change to the stack
D. The bottom element is returned with no change to the stack

Correct Option: B
Explanation:

Answer: b) An error occurs

Explanation: Popping an element from an empty stack is considered an error since there is no element to remove.

Q: What are the two primary operations on a stack?

A. Push and pop
B. Insert and delete
C. Enqueue and dequeue
D. Sort and search

Correct Option: A
Explanation:

Answer: a) Push and pop

Explanation: The two primary operations on a stack are push, which adds an element to the top of the stack, and pop, which removes the top element from the stack.

Q: Which of the following is a common problem that can be solved using a stack?

A. Sorting a list of integers
B. Finding the shortest path between two nodes in a graph
C. Evaluating arithmetic expressions
D. Generating all possible subsets of a set

Correct Option: C
Explanation:

Answer: c) Evaluating arithmetic expressions

Explanation: A stack can be used to evaluate arithmetic expressions in postfix notation, which involves pushing operands onto the stack and popping operators from the stack when they are encountered.

Q: Which of the following is an example of a real-world application of a stack?

A. Checking if a sentence is a palindrome
B. Solving a maze
C. Evaluating the postfix notation of an arithmetic expression
D. Storing data in a database

Correct Option: A
Explanation:

Answer: a) Checking if a sentence is a palindrome

Explanation: A stack can be used to check if a sentence is a palindrome by pushing the first half of the sentence onto the stack and then comparing the remaining half to the elements popped from the stack.

Q: Which data structure is commonly used to implement a stack?

A. Array
B. Linked list
C. Binary tree
D. Hash table

Correct Option: B
Explanation:

Answer: b) Linked list

Explanation: A linked list is commonly used to implement a stack since it allows for efficient insertion and deletion at the beginning of the list.

Q: What is a stack in data structure?

A. A data structure that allows elements to be inserted and removed in any order
B. A data structure that allows elements to be inserted and removed from the beginning or end
C. A data structure that allows elements to be inserted and removed from one end only
D. A data structure that allows elements to be inserted and removed from both ends

Correct Option: C
Explanation:

Answer: c) A data structure that allows elements to be inserted and removed from one end only

Explanation: A stack is a data structure that follows the Last-In-First-Out (LIFO) principle, meaning that the element that is inserted last will be the first to be removed. It allows elements to be inserted and removed from the top end only.

Q: Which of the following is a disadvantage of using a stack?

A. It can only store a limited number of elements
B. It is not efficient for searching or sorting elements
C. It requires a lot of memory to implement
D. It can lead to stack overflow errors if the stack becomes too large

Correct Option: D
Explanation:

Answer: d) It can lead to stack overflow errors if the stack becomes too large

Explanation: One potential disadvantage of using a stack is that it can lead to stack overflow errors if the stack becomes too large and exceeds the available memory.

Q: Which of the following is an advantage of using a stack?

A. It allows for efficient insertion and deletion at any position
B. It allows for efficient searching and sorting of elements
C. It follows the First-In-First-Out (FIFO) principle
D. It allows for efficient insertion and deletion at the top end

Correct Option: D
Explanation:

Answer: d) It allows for efficient insertion and deletion at the top end

Explanation: The primary advantage of using a stack is that it allows for efficient insertion and deletion at the top end, making it useful for applications that require temporary storage of data.

Q: Which of the following is not a common application of a stack?

A. Reversing a string
B. Undoing an operation in a text editor
C. Evaluating arithmetic expressions
D. Storing data in a database

Correct Option: D
Explanation:

Answer: d) Storing data in a database

Explanation: While a stack can be used to store data temporarily in memory, it is not commonly used to store data in a database.

Q: What is the time complexity of the push and pop operations on a stack implemented using an array?

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

Correct Option: A
Explanation:

Answer: a) O(1)

Explanation: The push and pop operations on a stack implemented using an array have a time complexity of O(1), since they simply involve adding or removing an element from the end of the array.