Register

Recent questions tagged infix-prefix

0 votes
1 answer
32
Evaluation of postfix
Result for evaluating the following post fix 105+606/*8- I'm confused whether it is correct postfix expression.
Result for evaluating the following post fix105+606/*8-I'm confused whether it is correct postfix expression.
User Avatar
0 votes
1 answer
33
ace test
is ans is D or C???
is ans is D or C???
User Avatar
2 votes
1 answer
34
Infix to postfix stack size
How is ans 15 for this question Please can anybody solve this
How is ans 15 for this question Please can anybody solve this
User Avatar
9 votes
3 answers
35
ISRO2017-69
Choose the equivalent prefix form of the following expression (a+(b-c))*((d-e)/(f+g-h)) *+a-bc/-de-+fgh *+a-bc-/de-+fgh *+a-bc/-ed-+fgh *+ab-c/-de-+fgh
Choose the equivalent prefix form of the following expression(a+(b-c))*((d-e)/(f+g-h))*+a-bc/-de-+fgh*+a-bc-/de-+fgh*+a-bc/-ed-+fgh*+ab-c/-de-+fgh
User Avatar
1 votes
2 answers
37
Virtual Gate Test Series: Programming & DS - Infix Notation
What we can do if the unary operator comes in infix notation while converting it into postfix/prefix notations? For example, this $a = -b+c*d/e+f↑g↑h-i*j$
What we can do if the unary operator comes in infix notation while converting it into postfix/prefix notations? For example, this $a = -b+c*d/e+f↑g↑h-i*j$
User Avatar
0 votes
1 answer
38
Postorder vs Reverse polish notation
1. Is postorder same as Reverse polish notation(Postfix)? 2. Is inorder same as polish notation(infix)?
1. Is postorder same as Reverse polish notation(Postfix)?2. Is inorder same as polish notation(infix)?
User Avatar
4 votes
1 answer
39
GATE CSE 1989 | Question: 4-ii
Compute the postfix equivalent of the following infix arithmetic expression $a + b \ast c + d * e \uparrow f$ where $\uparrow$ represents exponentiation. Assume normal operator precedences.
Compute the postfix equivalent of the following infix arithmetic expression$a + b \ast c + d * e \uparrow f$where $\uparrow$ represents exponentiation. Assume normal ope...
User Avatar
1 votes
0 answers
41
Postfix and Prefix
Conver the following infix to Postfix and Prefix $log ( 3 ! )^ {log4} *log log ((6/7)*4+x)!$ $ sin 2x cos (3x+4) $ Please use stack method to solve . Diagram would be appreciated
Conver the following infix to Postfix and Prefix $log ( 3 ! )^ {log4} *log log ((6/7)*4+x)!$$ sin 2x cos (3x+4) $ Please use stack method to solve . Diagram would be app...
User Avatar
0 votes
1 answer
42
GATE Overflow | Data Structures | Test 1 | Question: 4
The postfix expression for the infix expression $A + B*C/D +E$ is AB+*CD/E+ ABC*D/+E+ AB+C*D/E+ A+*BCD/E+
The postfix expression for the infix expression$$A + B*C/D +E$$isAB+*CD/E+ABC*D/+E+AB+C*D/E+A+*BCD/E+
User Avatar
2 votes
2 answers
43
Infix to postfix
Convert the infix to postfix and prefix expression 1) log3! ^log4 *log log 6/7*4! 2)log3!^sin 2*cos 3
Convert the infix to postfix and prefix expression1) log3! ^log4 *log log 6/7*4!2)log3!^sin 2*cos 3
User Avatar
0 votes
2 answers
44
UGC NET CSE | August 2016 | Part 2 | Question: 25
Given the following prefix expression : $^{*} + 3 + 3 ↑ 3 + 3 3 3$ What is the value of the prefix expression ? $2178$ $2199$ $2205$ $2232$
Given the following prefix expression :$^{*} + 3 + 3 ↑ 3 + 3 3 3$What is the value of the prefix expression ?$2178$ $2199$$2205$ $2232$
User Avatar
2 votes
2 answers
45
UGC NET CSE | June 2012 | Part 2 | Question: 1
The postfix expression AB + CD -* can be evaluated using a stack tree queue linked list
The postfix expression AB + CD -* can be evaluated using astacktreequeuelinked list
User Avatar
4 votes
2 answers
46
ISRO2009-28
The infix expression $A+(B-C)^*D$ is correctly represented in prefix notation as $A+B-C^*D$ $+A^*-BCD$ $ABC-D^*+$ $A+BC-D^*$
The infix expression $A+(B-C)^*D$ is correctly represented in prefix notation as$A+B-C^*D$$+A^*-BCD$$ABC-D^*+$$A+BC-D^*$
User Avatar
2 votes
3 answers
47
MadeEasy Test Series: Programming & DS - Infix Postfix
Consider the following expression with infix notation A * B - (C + D) * (E / 5) ^ F What is the maximum height of the operator stack during conversion from infix to postfix ? a) 3 b) 4 c) 5 d) 6
Consider the following expression with infix notationA * B - (C + D) * (E / 5) ^ F What is the maximum height of the operator stack during conversion from infix to postfi...
User Avatar
44 votes
9 answers
50
GATE CSE 1998 | Question: 19b
Compute the post fix equivalent of the following expression $3^*\log(x+1)-\frac{a}{2}$
Compute the post fix equivalent of the following expression $3^*\log(x+1)-\frac{a}{2}$
User Avatar
0 votes
1 answer
51
Postfix expression for the following image ?
q.26 : I do not understand the output . Why are real , integer and to coming?
q.26 : I do not understand the output . Why are real , integer and to coming?
User Avatar
28 votes
3 answers
52
GATE CSE 1997 | Question: 1.7
Which of the following is essential for converting an infix expression to the postfix form efficiently? An operator stack An operand stack An operand stack and an operator stack A parse tree
Which of the following is essential for converting an infix expression to the postfix form efficiently?An operator stackAn operand stackAn operand stack and an operator s...
User Avatar
32 votes
5 answers
54
GATE CSE 2004 | Question: 38, ISRO2009-27
Assume that the operators $+, -, \times$ are left associative and $^\hat{}$ is right associative. The order of precedence (from highest to lowest) is $ \ ^\hat{}, \times, +, -$ ... $-+a\times bc \ \ \hat{} \ \ \ \hat{} \ \ def$
Assume that the operators $+, -, \times$ are left associative and $^\hat{}$ is right associative. The order of precedence (from highest to lowest) is $ \ ^\hat{}, \times,...
User Avatar
Page: