Dark Mode

Recent questions tagged infix-prefix

1 vote

1 answer

31

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

JaiKumar Guwalani asked in DS May 6, 2018

by JaiKumar Guwalani

2.7k views

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.

Ananya Jaiswal 1 asked in Programming in C Dec 12, 2017

by Ananya Jaiswal 1

2.5k views

0 votes

1 answer

33

ace test
is ans is D or C???

ADITYA CHAURASIYA 5 asked in DS Sep 28, 2017

by ADITYA CHAURASIYA 5

355 views

2 votes

1 answer

34

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

Himanshu Goyal asked in Programming in C Jul 14, 2017

by Himanshu Goyal

5.4k views

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

sh!va asked in DS May 7, 2017

by sh!va

12.9k views

2 votes

2 answers

36

Test by Bikram | Mock GATE | Test 2 | Question: 24
Which of the following expressions evaluates to the largest number? The prefix expression $+ $*$ - 2 3 5 7$ The postfix expression $2 3 + 5 $*$ 7 -$ The infix expression $\left ( 2+3 \right )$ * $\left ( 5-7 \right )$ The postfix expression $2$ $3$ + $5$ $7$ $-$ *

Bikram asked in DS Jan 24, 2017

by Bikram

497 views

1 vote

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$

smartmeet asked in DS Jan 18, 2017

1.0k views

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)?

rahul sharma 5 asked in DS Dec 18, 2016

by rahul sharma 5

1.6k views

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.

makhdoom ghaya asked in DS Nov 29, 2016

by makhdoom ghaya

1.9k views

3 votes

1 answer

40

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

2018 asked in DS Nov 26, 2016

by 2018

2.9k views

1 vote

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

PEKKA asked in DS Nov 10, 2016

by PEKKA

1.3k views

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+

Arjun asked in DS Oct 10, 2016

by Arjun

409 views

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

Amit puri asked in DS Sep 29, 2016

2.7k views

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$

makhdoom ghaya asked in DS Sep 26, 2016

by makhdoom ghaya

5.0k views

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

go_editor asked in DS Jul 4, 2016

3.8k views

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^*$

go_editor asked in DS Jun 14, 2016

3.4k views

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

Tushar Shinde asked in DS Jan 28, 2016

by Tushar Shinde

3.7k views

0 votes

2 answers

48

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$

tiger asked in DS Dec 15, 2015

by tiger

5.3k views

2 votes

1 answer

49

evaluation of prefix expression takes O(n^2)....true?

admin asked in DS Oct 19, 2015

by admin

1.4k views

43 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}$

Arjun asked in DS Aug 29, 2015

by Arjun

15.6k views

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?

prasitamukherjee asked in DS Jul 16, 2015

by prasitamukherjee

547 views

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

Kathleen asked in DS Sep 29, 2014

8.5k views

33 votes

4 answers

53

GATE CSE 2007 | Question: 38, ISRO2016-27
The following postfix expression with single digit operands is evaluated using a stack: $8 \ 2 \ 3 \ {}^\hat{} ∕ \ 2 \ 3 * + 5 \ 1 * -$ Note that $^\hat{}$ is the exponentiation operator. The top two elements of the stack after the first $*$ is evaluated are $6, 1$ $5, 7$ $3, 2$ $1, 5$

Kathleen asked in DS Sep 21, 2014

16.5k views

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$

Kathleen asked in DS Sep 18, 2014

12.8k views

Page:

Recent questions tagged infix-prefix