 |
 |
|
|
Convert the following infix expression to postfix expression -
A / B ^ C + D * E - A * C
A B C ^ / D E * + A C * -
A B C ^ / D * E + A C * -
A B C ^ / D E * + A * C -
A B C / ^ D E * + A C * -
SHOW ANSWERConvert the following infix expression to postfix expression -
B * C - C + D / A / ( E + E )
B C C - * D / A E E + / +
B C C - * D A / E E + / +
B C C * - D A / E E + / +
B C * C - D A / E E + / +
SHOW ANSWERIn Computer generally _________ expressions are preferred
Infix
Postfix
Prefix
SHOW ANSWERData Structure required to evaluate infix to postfix is __________.
Heap
Pointer
Queue
Stack
SHOW ANSWERWhat will be the postfix form of the above expression -
(A+B)*(C*D-E)*F/G
A B + C D * E - F G * / *
A B + C D E * - F G / * *
None of these
.A B + C D * E - F G / * *
SHOW ANSWERIf 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 ?
2 1 2 2 2
2 2 1 2 2
2 1 2 2 1
2 2 1 1 2
SHOW ANSWERStack cannot be used to -
Evaluation of Expression in Postfix form
Reversing String
Allocating Resources and Scheduling
Implementation of Recursion
SHOW ANSWERExpression
1 * 2 ^ 3 * 4 ^ 5 * 6
is evaluated as -
32^30
162^30
173458
49152
SHOW ANSWERWhich of the following is useful in the implementation of quick sort ?
Set
List
Stack
Queue
SHOW ANSWERList of data in which element can be inserted and removed at the same end is called as __________.
List
Array
Stack
Queue
SHOW ANSWERAdding element to stack means ___________.
Placing element at the top
Placing element at the rear end
Placing element at the front end
None of these
SHOW ANSWERPushing element in the stack means _____________.
Searching element in the stack
Sorting element from the stack
Removing element from the stack
Adding element in the stack
SHOW ANSWERPost fix form of following infix expression is -
(A + B) * (C + D - E) * F
AB + CD - EF + - * *
AB + CDE + - * F *
AB + CD + E - * F *
ABCDEF*-+*+
SHOW ANSWER
