Recent questions tagged infix-postfix

0 votes

0 answers

1

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 (34.1k points) | 93 views

0 votes

1 answer

2

TESTBOOK TEST SERIES
HOW TO SOLVE THIS?

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

0 votes

2 answers

3

Data Structure - Postfix

asked Sep 2, 2018 in Programming by sidlewis Junior (773 points) | 157 views

0 votes

0 answers

4

Gate forum test series

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

0 votes

1 answer

5

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 (8.6k points) | 110 views

0 votes

1 answer

6

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 (11 points) | 337 views

0 votes

1 answer

7

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) | 326 views

+1 vote

1 answer

8

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 Junior (563 points) | 510 views

+6 votes

6 answers

9

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 (35.2k points) | 3k views

+1 vote

1 answer

10

What we can do if unary operator comes in infix notation while converting it into postfix/prefix notations?

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

0 votes

1 answer

11

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 (26.6k points) | 241 views

0 votes

1 answer

12

GATE1989-4-ii
Provide short answers to the following questions: Compute the positive 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 (41.2k points) | 156 views

+3 votes

1 answer

13

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.9k points) | 896 views

+1 vote

0 answers

14

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 (2.2k points) | 571 views

0 votes

4 answers

15

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 (115k points) | 857 views

0 votes

2 answers

16

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 (2.1k points) | 932 views

+20 votes

8 answers

17

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 (385k points) | 2.8k views

+20 votes

2 answers

18

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 (59.9k points) | 2.3k 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