Vidyalelo
Data Structure · all questions

Stacks in Data Structures
practice.

Practice every MCQ with options. Use Show answers when you want the correct option and solution.

159

Questions

5/8

Page

Pick an option on a question to see the right answer and solution.

What would be the solution to the given prefix notation?
+ 9 * 3 / 8 4

Select an option to see the answer and solution.

How many stacks are required for applying evaluation of infix expression algorithm?

Select an option to see the answer and solution.

How many stacks are required for evaluation of prefix expression?

Select an option to see the answer and solution.

In Postfix expressions, the operators come after the operands.

Select an option to see the answer and solution.

The system throws an error if parentheses are encountered in an infix expression evaluation algorithm.

Select an option to see the answer and solution.

Out of the following operators (^, *, +, &, $), the one having highest priority is . . . . . . . .

Select an option to see the answer and solution.

Which of the following data structure is used to convert postfix expression to infix expression?

Select an option to see the answer and solution.

Given two processes (conversion of postfix equation to infix notation and conversion of prefix notation to infix notation), which of the following is easier to implement?

Select an option to see the answer and solution.

Express -15 as a 6-bit signed binary number.

Select an option to see the answer and solution.

The equivalent infix expression and value for the postfix form 1 2 + 3 * 4 5 * - will be . . . . . . . .

Select an option to see the answer and solution.

Evaluate the following statement using infix evaluation algorithm and choose the correct answer. 1+2*3-2

Select an option to see the answer and solution.

What is the postfix expression for the infix expression?
a-b-c

Select an option to see the answer and solution.

Which is the predefined method available in Java to convert decimal to binary numbers?

Select an option to see the answer and solution.

What is the corresponding postfix expression for the given infix expression?
a*(b+c)/d

Select an option to see the answer and solution.

What would be the Prefix notation for the given equation?
(a+(b/c)*(d^e)-f)

Select an option to see the answer and solution.

What determines the order of evaluation of a prefix expression?

Select an option to see the answer and solution.

To convert the postfix expression into the infix expression we use stack and scan the postfix expression from left to right.

Select an option to see the answer and solution.

What is the time complexity of reversing a word using stack algorithm?

Select an option to see the answer and solution.

Which of the following statement is invalid with respect to balancing symbols?

Select an option to see the answer and solution.

When the corresponding end bracket/braces/parentheses is not found, what happens?

Select an option to see the answer and solution.