Q. Evaluate Postfix expression from given infix expression.
A + B * (C + D) / F + D * E

View solution

Q. Expression in which Operator is written after Operand is called as ________.

View solution

Q. Which of the following is an example of Postfix expression ?

View solution

Q. Convert the following infix expression to postfix expression -
A / B ^ C + D * E - A * C

View solution

Q. Convert the following infix expression to postfix expression -
B * C - C + D / A / ( E + E )

View solution

Q. In Computer generally _________ expressions are preferred.

View solution

Q. Data Structure required to evaluate infix to postfix is __________.

View solution

Q. What will be the postfix form of the above expression -
(A+B)∗(C∗D-E)∗F/G

View solution

Q. If the sequence of operations -

push(1)
push(2)
pop
push(1)
push(2)
pop
pop
pop
push(2)
pop

are performed on a stack, the sequence of popped out values are ?

View solution

Q. Stack cannot be used to

View solution

Q. Expression
1 * 2 ^ 3 * 4 ^ 5 * 6
is evaluated as -

View solution

Q. Which of the following is useful in the implementation of quick sort ?

View solution

Q. List of data in which element can be inserted and removed at the same end is called as __________.

View solution

Q. Adding element to stack means ___________.

View solution

Q. Pushing element in the stack means _____________.

View solution

Q. Post fix form of following infix expression is -
(A + B) * (C + D - E) * F

View solution

Q. Post fix form of following infix expression is -
* + A B - C D

View solution

Q. Stack can be implemented using ___________ and _________.

View solution

Q. Well formed parenthesis can be checked using following data structure ?

View solution

Q. Post fix form of
A + (B * C)
is -

View solution