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?
A. Stack
B. Queue
C. Linked List
D. Heap
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?
A. Both are easy to implement
B. Conversion of postfix equation to infix equation is harder than converting a prefix notation to infix notation
C. Conversion of postfix equation to infix equation is easier than converting a prefix notation to infix notation
D. Insufficient data
Select an option to see the answer and solution.
Express -15 as a 6-bit signed binary number.
A. 001111
B. 101111
C. 101110
D. 001110
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 . . . . . . . .
A. 1 + 2 * 3 - 4 * 5 and -13
B. (2 + 1) * (3 - 4) * 5 and 13
C. 1 + 2 * (3 - 4) * 5 and -11
D. (1 + 2) * 3 - (4 * 5) and -11
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 A. -ab-c
B. ab - c -
C. - -abc
D. -ab-c
Select an option to see the answer and solution.
Which is the predefined method available in Java to convert decimal to binary numbers?
A. toBinaryInteger(int)
B. toBinaryValue(int)
C. toBinaryNumber(int)
D. toBinaryString(int)
Select an option to see the answer and solution.
What is the corresponding postfix expression for the given infix expression?
a*(b+c)/d A. ab*+cd/
B. ab+*cd/
C. abc*+/d
D. abc+*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) A. -+a*/^bcdef
B. -+a*/bc^def
C. -+a*b/c^def
D. -a+*/bc^def
Select an option to see the answer and solution.
What determines the order of evaluation of a prefix expression?
A. precedence and associativity
B. precedence only
C. associativity only
D. depends on the parser
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?
A. O (N log N)
B. O (N2 )
C. O (N)
D. O (M log N)
Select an option to see the answer and solution.
Which of the following statement is invalid with respect to balancing symbols?
A. [(A+B) + (C-D)]
B. [{A+B}-{C-[D+E]}]
C. ((A+B) + (C+D)
D. {(A+B) + [C+D]}
Select an option to see the answer and solution.
When the corresponding end bracket/braces/parentheses is not found, what happens?
A. The stack is popped
B. Ignore the parentheses
C. An error is reported
D. It is treated as an exception
Select an option to see the answer and solution.