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

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
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
1
answer
1
Evaluation of Postfix expression using stack
asked
May 6
in
DS
by
JaiKumar Guwalani
(
11
points)

124
views
datastructure
timecomplexity
spacecomplexity
infixpostfix
stack
0
votes
1
answer
2
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
(
1.6k
points)

212
views
datastructure
infixpostfix
+1
vote
1
answer
3
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
(
571
points)

400
views
datastructure
stack
infixpostfix
+6
votes
6
answers
4
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
(
34.1k
points)

2.8k
views
isro2017
datastructure
infixpostfix
stack
+1
vote
1
answer
5
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
(
4.8k
points)

303
views
datastructure
stack
infixpostfix
general
virtualgate
0
votes
1
answer
6
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.1k
points)

164
views
datastructure
algorithms
infixpostfix
0
votes
1
answer
7
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
(
40k
points)

116
views
gate1989
descriptive
compilerdesign
infixpostfix
+3
votes
1
answer
8
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.7k
points)

786
views
datastructure
infixpostfix
+1
vote
0
answers
9
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.1k
points)

453
views
datastructure
infixpostfix
0
votes
4
answers
10
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
(
98.5k
points)

683
views
ugcnetjune2012ii
compilerdesign
infixpostfix
0
votes
2
answers
11
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
(
2k
points)

804
views
infixpostfix
datastructure
+19
votes
5
answers
12
GATE199819b
Compute the post fix equivalent of the following expression $3^*\log(x+1)\frac{a}{2}$
asked
Aug 29, 2015
in
Compiler Design
by
Arjun
Veteran
(
349k
points)

1.9k
views
gate1998
compilerdesign
infixpostfix
+18
votes
2
answers
13
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
(
59.4k
points)

1.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
IISc CSA and CDCS written test and interview Experince
IIIT Hyderabad Interview Experience
My failure, Oh wait SUCCESS journey
ALGORITHMS CHECKLIST:
A Failure who got into IISc
Follow @csegate
Gatecse
Recent questions tagged infixpostfix
Recent Blog Comments
Sir I didn't get an email for GO classroom, ...
any one with marks less than 125 selected?
Thank you @Arjun Sir, @NamitaAIR1, @Priyanka, ...
Your story is very inspiring for the boys like me ...
So you completed your Btech in 5 yrs? How could ...
36,194
questions
43,647
answers
124,088
comments
42,929
users