Sonata Previous Years Solved Sample Placement Papers
-
Out of the following operators (
^
,*
,+
,&
,$
), the one having the highest priority is?
(a) +
(b) $
(c) ^
(d) &
Answer: (c)
Explanation: According to the infix-to-prefix algorithm, exponentiation (^
) has the highest priority among the given operators. -
Out of the following operators (
|
,*
,+
,&
,$
), the one having the lowest priority is?
(a) +
(b) $
(c) |
(d) &
Answer: (c)
Explanation: Logical OR (|
) has the lowest precedence among the given operators, as defined in the infix-to-prefix algorithm. -
When an operand is read, which of the following is done?
a) It is placed on to the output
b) It is placed in operator stack
c) It is ignored
d) Operator stack is emptied
Answer: a
Explanation: While converting an infix expression to a postfix expression, when an operand is read, it is placed on to the output. When an operator is read, it is placed in the operator stack.
-
What should be done when a left parenthesis ‘(‘ is encountered?
a) It is ignored
b) It is placed in the output
c) It is placed in the operator stack
d) The contents of the operator stack is emptied
Answer: c
Explanation: When a left parenthesis is encountered, it is placed on to the operator stack. When the corresponding right parenthesis is encountered, the stack is popped until the left parenthesis and remove both the parenthesis.
-
What would be the Prefix notation for the given equation?
A+(B*C)
(a) +A*CB
(b) *B+AC
(c) +A*BC
(d) *A+CB
Answer: (c)
Explanation: Reverse the equation or scan from right to left. Apply the infix-to-postfix algorithm. Inside the brackets, the result isCB*
, and outside the brackets, it isA+
. Reversing gives+A*BC
. -
What would be the Prefix notation for the given equation?
(A*B)+(C*D)
(a) +*AB*CD
(b) *+AB*CD
(c) **AB+CD
(d) +*BA*CD
Answer: (a)
Explanation: Reverse the equation or scan from right to left. Apply the infix-to-postfix algorithm. Brackets evaluate toDC*
andBA*
, resulting in+*AB*CD
after reversal. -
What would be the Prefix notation for the given equation?
A+B*C^D
(a) +A*B^CD
(b) +A^B*CD
(c) *A+B^CD
(d) ^A*B+CD
Answer: (a)
Explanation: Reverse the equation or scan from right to left. Apply the infix-to-prefix algorithm. The order of precedence is+*
and^
. The reversed expression evaluates to+A*B^CD
.