DSA + System Design - 12

What is the time complexity of the push and pop operations in a stack implemented with a linked list?

• O(n)

• O(log n)

• O(1)

• O(n log n)

Given an infix expression: A+B∗(C−D)/E what is the equivalent postfix expression?

• AB+CD−∗E/

• ABCD−∗+E/

• AB+CD∗−E/

• ABCD−∗E/+

How many stacks are required to implement a queue using the stack data structure?

• 1

• 2

• 3

• 4

Which of the following is not an application of stacks?

• Function call management

• Infix to postfix conversion

• Managing a list of items

• Balancing symbols

In a stack implemented using an array, what is the time complexity of accessing the i-th element from the top of the stack?

• O(1)

• O(i)

• O(n-i)

• O(n)

Which of the following conditions indicate that a stack is empty?

• top == stack.length

• top == stack.length - 1

• top == 0

• top == -1

In the context of recursion, the stack is used to store which of the following?

• Static variables

• Global variables

• Local variables and return addresses

• Register values

What will be the time complexity of this pseudocode for reversing a string using a stack?

• O(1)

• O(log n)

• O(n)

• O(n^2)

What is the primary advantage of using a stack to convert an infix expression to a postfix expression?

• Reduces the number of operators

• Handles operator precedence and parentheses

• Increases computational efficiency

• Simplifies the expression

What will be the output of the following pseudocode?

• [1, 3, 5]

• [1, 2, 3]

• [1, 2]

• [1, 5]