The postfix form of A ^ B * C D + E/ F/ (G + H) – McqOptions

MCQOPTIONS

1.	The postfix form of A ^ B * C D + E/ F/ (G + H)
A.	AB^C*D-EF/GH+/+
B.	AB^CD-EP/GH+/+*
C.	ABCDEFGH+//+-*^
D.	AB^D +EFGH +//*+
Answer» B. AB^CD-EP/GH+/+*

Discussion

No Comment Found

Related MCQs

A .. is a linear list in which insertions and deletions are made to from either end of the structure.
An infix expression can be converted to a postfix expression using a ..
Aposterior analysis are more accurate than apriori analysis because
Assume that the operators +,-, X are left associative and ^ is right associative.The order of precedence (from highest to lowest) is ^, X, +, -. The postfix expression for the infix expression a + b X c d ^ e ^ f is
Consider these functions:push() : push an element into the stackpop() : pop the top-of-the-stack elementtop() : returns the item stored in top-of-the-stack-nodeWhat will be the output after performing these sequence of operationspush(20);push(4);top();pop();pop();pop();push(5);top();
Convert the following infix expression to postfix expression -A / B ^ C + D * E A * C
Convert the following infix expression to postfix expression -B * C C + D / A / ( E + E )
Convert the following infix expressions into its equivalent postfix expressions(A + B D)/(E F)+G
Expression1 * 2 ^ 3 * 4 ^ 5 * 6is evaluated as
Given below is the Node class to perform basic list operations and a Stack class with a no arg constructor. Select from the options the appropriate push() operation that can be included in the Stack class. Also first is the top-of-the-stack.