Recent questions tagged infix-postfix

+2 votes

1 answer

1

ISRO2020-4
Convert the pre-fix expression to in-fix $-*+ABC*-DE+FG$ $(A-B)*C+(D*E)-(F+G)$ $(A+B)*C-(D-E)*(F-G)$ $(A+B-C)*(D-E)*(F+G)$ $(A+B)*C-(D*E)-(F+G)$

asked 6 days ago in DS by Satbir Boss (23.8k points) | 115 views

0 votes

0 answers

2

Made Easy Test Series: Algorithm-Reverse Polish Notation
Consider the new-order strategy for traversing a binary tree: Visit the root Visit the right subtree using new-order Visit the left subtree using new-order The new-order traversal of expression tree corresponding to the reverse polish expression 3 4 * 5 – 2 ^ 6 7 * 1 + – What will be expression, any procedure for it??

asked May 16, 2019 in Compiler Design by srestha Veteran (118k points) | 107 views

+1 vote

0 answers

3

MadeEasy Subject Test 2019: Programming & DS - Stack
I THING THERE IS MISTAKE BECAUSE BRACKET ARE CLOSING AFTER ELEMENT E SO ALL OPERATORS HOULD BE POPED AND AND ACCORDING TO ME ANWER SHOLD BE 2… TRY AND CORRECT IF I M WRONG !!!! THANKS IN ADVANCE!!!

asked Dec 7, 2018 in Programming by CHïntän ÞäTël (217 points) | 94 views

+1 vote

1 answer

4

MadeEasy Test Series: Programming & DS - Stack
My doubt : What should we consider ^ operator as Bitwise XOR ? or Exponentiation

asked Dec 1, 2018 in DS by jatin khachane 1 Loyal (7.4k points) | 152 views

0 votes

0 answers

5

Infix to postfix (Complicated declarations)
Please convert it to postfix by using stack and explain in detail void (*bsd_signal(int sig, void (*func)(int)))(int);

asked Oct 20, 2018 in Programming by Mk Utkarsh Boss (36.4k points) | 170 views

0 votes

1 answer

6

TESTBOOK TEST SERIES
HOW TO SOLVE THIS?

asked Sep 9, 2018 in DS by Avik Chowdhury Junior (639 points) | 57 views

0 votes

2 answers

7

Data Structure - Postfix

asked Sep 2, 2018 in Programming by sidlewis Junior (903 points) | 193 views

0 votes

0 answers

8

Gate forum test series

asked Aug 23, 2018 in DS by nag.swarna (185 points) | 31 views

0 votes

1 answer

9

Postfix Expression
Let The value of below expression is A. 6 2 3 + - 3 8 2 / + * 3 ^ 3 + and Let the value of below expression is Y: 2 A * 16 + What is value of sqrt(Y) Ans. 16

asked Aug 22, 2018 in DS by Na462 Loyal (7k points) | 192 views

0 votes

1 answer

10

Evaluation of Postfix expression using stack
What is time and space complexity to evaluate postfix expression ?

asked May 6, 2018 in DS by JaiKumar Guwalani (19 points) | 426 views

0 votes

1 answer

11

Evaluation of postfix
Result for evaluating the following post fix 105+606/*8- I'm confused whether it is correct postfix expression.

asked Dec 12, 2017 in Programming by Ananya Jaiswal 1 Active (2.2k points) | 431 views

+1 vote

1 answer

12

Infix to postfix stack size
How is ans 15 for this question Please can anybody solve this

asked Jul 15, 2017 in Programming by Himanshu Goyal (379 points) | 642 views

+7 votes

6 answers

13

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

asked May 7, 2017 in DS by sh!va Boss (32.9k points) | 3.3k views

+1 vote

1 answer

14

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$

asked Jan 18, 2017 in DS by smartmeet Active (4.9k points) | 541 views

0 votes

1 answer

15

Postorder vs Reverse polish notation
1. Is postorder same as Reverse polish notation(Postfix)? 2. Is inorder same as polish notation(infix)?

asked Dec 18, 2016 in DS by rahul sharma 5 Boss (25.6k points) | 290 views

+1 vote

1 answer

16

GATE1989-4-ii
Provide short answers to the following questions: Compute the postfix equivalent of the following infix arithmetic expression $a + b * c + d * e ↑ f$ where $↑$ represents exponentiation. Assume normal operator precedences.

asked Nov 30, 2016 in Compiler Design by makhdoom ghaya Boss (30.7k points) | 236 views

+3 votes

1 answer

17

infix, prefix, postfix
Time required to evaluate a. prefix, b. infix, c. postfix_____O(n) ? for expression evaluation (infix, prefix, postfix) operand stack needed____True? for conversion from one to another notation operator stack needed_____True? time required for conversion from infix to ... { infix, prefix, postfix } require more scan__? PS: i googled for all this but not found anthing exact..

asked Nov 26, 2016 in DS by 2018 Loyal (6.8k points) | 981 views

+1 vote

0 answers

18

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

asked Nov 10, 2016 in DS by PEKKA Active (1.9k points) | 638 views

+1 vote

2 answers

19

UGCNET-June2012-II-1
The postfix expression AB + CD -* can be evaluated using a stack tree queue linked list

asked Jul 4, 2016 in Compiler Design by jothee Veteran (105k points) | 1.1k views

+1 vote

3 answers

20

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

asked Jan 28, 2016 in DS by Tushar Shinde Active (2.2k points) | 1.4k views

0 votes

2 answers

21

Postfix evaluation
The following post-fix expression with single digit operands is evaluated using stack, $16\;2\;4\;\wedge \; / \;4\;3\;*\;+\;6\;2\;*\;-$ Note that $\wedge$ is the exponential operator. What is the maximum height of the stack and the final value of post-fix evaluation respectively are a. $3,\;1$ b. $4,\;1$ c. $3,\;12$ d. $2,\;1$

asked Dec 15, 2015 in DS by tiger Active (1.6k points) | 1.1k views

+23 votes

9 answers

22

GATE1998-19b
Compute the post fix equivalent of the following expression $3^*\log(x+1)-\frac{a}{2}$

asked Aug 29, 2015 in DS by Arjun Veteran (430k points) | 3.5k views

+21 votes

2 answers

23

GATE1997-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

asked Sep 29, 2014 in DS by Kathleen Veteran (52.2k points) | 2.8k views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Recent questions tagged infix-postfix

Recent Posts

Recent Blog Comments