The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged infixpostfix
0
votes
0
answers
1
Made Easy Test Series: AlgorithmReverse Polish Notation
Consider the neworder strategy for traversing a binary tree: Visit the root Visit the right subtree using neworder Visit the left subtree using neworder The neworder 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
in
Compiler Design
by
srestha
Veteran
(
111k
points)

70
views
infixpostfix
algorithms
timecomplexity
0
votes
0
answers
2
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
(
211
points)

68
views
madeeasytestseries
datastructure
stack
infixpostfix
0
votes
1
answer
3
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
(
6.7k
points)

105
views
madeeasytestseries
datastructure
stack
infixpostfix
0
votes
0
answers
4
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.5k
points)

136
views
stack
datastructure
infixpostfix
0
votes
1
answer
5
TESTBOOK TEST SERIES
HOW TO SOLVE THIS?
asked
Sep 9, 2018
in
DS
by
Avik Chowdhury
Junior
(
615
points)

51
views
infixpostfix
0
votes
2
answers
6
Data Structure  Postfix
asked
Sep 2, 2018
in
Programming
by
sidlewis
Junior
(
801
points)

176
views
datastructure
infixpostfix
0
votes
0
answers
7
Gate forum test series
asked
Aug 23, 2018
in
DS
by
nag.swarna
(
165
points)

26
views
infixpostfix
0
votes
1
answer
8
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
(
6.6k
points)

159
views
datastructure
infixpostfix
0
votes
1
answer
9
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)

375
views
datastructure
timecomplexity
spacecomplexity
infixpostfix
stack
0
votes
1
answer
10
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)

398
views
datastructure
infixpostfix
+1
vote
1
answer
11
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)

566
views
datastructure
stack
infixpostfix
+6
votes
6
answers
12
ISRO201769
Choose the equivalent prefix form of the following expression (a+(bc))*((de)/(f+gh)) *+abc/de+fgh *+abc/de+fgh *+abc/ed+fgh *+abc/de+fgh
asked
May 7, 2017
in
DS
by
sh!va
Boss
(
31.8k
points)

3.1k
views
isro2017
datastructure
infixpostfix
stack
+1
vote
1
answer
13
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↑hi*j$
asked
Jan 18, 2017
in
DS
by
smartmeet
Active
(
4.8k
points)

504
views
datastructure
stack
infixpostfix
virtualgatetestseries
0
votes
1
answer
14
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
(
24.2k
points)

260
views
datastructure
algorithms
infixpostfix
0
votes
1
answer
15
GATE19894ii
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
(
29.3k
points)

164
views
gate1989
descriptive
compilerdesign
infixpostfix
+3
votes
1
answer
16
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)

930
views
datastructure
infixpostfix
+1
vote
0
answers
17
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)

610
views
datastructure
infixpostfix
0
votes
4
answers
18
UGCNETJune2012II1
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
(
96.1k
points)

984
views
ugcnetjune2012ii
compilerdesign
infixpostfix
+1
vote
3
answers
19
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.1k
points)

1.3k
views
madeeasytestseries
datastructure
stack
infixpostfix
0
votes
2
answers
20
Postfix evaluation
The following postfix 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 postfix 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.5k
points)

1k
views
infixpostfix
datastructure
+20
votes
9
answers
21
GATE199819b
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
(
406k
points)

3k
views
gate1998
stack
infixpostfix
+20
votes
2
answers
22
GATE19971.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
(
52k
points)

2.5k
views
gate1997
normal
infixpostfix
stack
datastructure
To see more, click for the
full list of questions
or
popular tags
.
Quick search syntax
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 Posts
The day that made me an IIScian :)
Unanswered Previous year GATE/TIFR questions
From being a Failure to getting into IISc  (Rank 888, Score 692)
My interview experience at IITs/IISc
IIT Delhi CSE Mtech interview 14 may
Follow @csegate
Recent questions tagged infixpostfix
Recent Blog Comments
@Debargh, Yes. 👍
Thanks. Regarding the probability question, was...
Thanks
What were the Eigen values of A apart from 0? I...
49,540
questions
54,099
answers
187,267
comments
71,006
users