Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged infix-prefix
0
votes
2
answers
1
Stacks
The maximum size of the operator stack when converting the following infix to postfix expression a ^ b * c * d + e * f ^ g (assume that “^” has highest precedence and right associativity) and also output the postfix expression.
vivek1211
asked
in
Programming
Nov 6
by
vivek1211
70
views
data-structures
stack
infix-prefix
0
votes
0
answers
2
postfix expression
I want to know which evaluation is wrong here: a-b-c = ab-c- or a-b-c = abc- – a * b *c = ab*c* a*b*c = abc** 3 . a+b-c = ab+c- a+b-c = abc-+
Overflow04
asked
in
Programming
Oct 2
by
Overflow04
105
views
self-doubt
infix-prefix
programming-in-c
0
votes
1
answer
3
The expression in postfix notation corresponding to the prefix notation ++A*B+CD*+EFG is
Arunava Samanta
asked
in
DS
Jun 28
by
Arunava Samanta
97
views
infix-prefix
2
votes
3
answers
4
TIFR CSE 2021 | Part B | Question: 3
What is the prefix expression corresponding to the expression: $\left ( \left ( 9+8 \right ) \ast 7+\left ( 6\ast \left ( 5+4 \right ) \right )\ast 3\right )+2?$ You may assume that $\ast$ has precedence over $+$? $\ast + +\: 987 \ast \ast \: 6 + + \:5432$ ... $+ + \ast +\: 987 \ast \ast \: 6 + \:5432$ $+ \ast + \ast \: 987+ + \: 6 \ast \:5432$
soujanyareddy13
asked
in
DS
Mar 25, 2021
by
soujanyareddy13
348
views
tifr2021
data-structures
stack
infix-prefix
2
votes
2
answers
5
NIELIT 2017 July Scientist B (CS) - Section B: 6
Assume that the operators $+,-,\times$ are left associative and $\wedge$ is right associative. The order of precedence(from highest to lowest) is $\wedge,\times, +,-$ ... $abc\times+de\wedge f\wedge-$ $ab+c\times d-e\wedge f\wedge $ $-+a\times bc\wedge\wedge def$
Lakshman Patel RJIT
asked
in
DS
Mar 30, 2020
by
Lakshman Patel RJIT
819
views
nielit2017july-scientistb-cs
data-structures
stack
infix-prefix
3
votes
2
answers
6
ISRO2020-4
Convert the pre-fix expression to in-fix $- ^{\ast} +ABC^{\ast} – DE+FG$ $(A-B)^{\ast}C+(D^{\ast}E)-(F+G)$ $(A+B)^{\ast}C-(D-E)^{\ast}(F-G)$ $(A+B-C)^{\ast}(D-E)^{\ast}(F+G)$ $(A+B)^{\ast}C-(D^{\ast}E)-(F+G)$
Satbir
asked
in
DS
Jan 13, 2020
by
Satbir
1.4k
views
isro-2020
data-structures
infix-prefix
normal
1
vote
0
answers
7
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??
srestha
asked
in
Compiler Design
May 16, 2019
by
srestha
431
views
infix-prefix
algorithms
time-complexity
1
vote
0
answers
8
Applied Course | Mock GATE | Test 1 | Question: 42
What is the maximum number of activation records inserted into stack while converting following infix expression to postfix expression is Infix expression: $\text{7+5*3^2/(9-2^2)+6*4}$
Applied Course
asked
in
DS
Jan 16, 2019
by
Applied Course
459
views
applied-course-2019-mock1
numerical-answers
data-structures
stack
infix-prefix
0
votes
1
answer
9
# stack
infix ,postfix ,prefix expression evalution stack use as operator or operand?
amit166
asked
in
DS
Jan 10, 2019
by
amit166
265
views
data-structures
stack
infix-prefix
2
votes
0
answers
10
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!!!
CHïntän ÞäTël
asked
in
Programming
Dec 7, 2018
by
CHïntän ÞäTël
324
views
made-easy-test-series
data-structures
stack
infix-prefix
2
votes
2
answers
11
MadeEasy Test Series: Programming & DS - Stack
My doubt : What should we consider ^ operator as Bitwise XOR ? or Exponentiation
jatin khachane 1
asked
in
DS
Dec 1, 2018
by
jatin khachane 1
752
views
made-easy-test-series
data-structures
stack
infix-prefix
0
votes
0
answers
12
Infix to prefix
What is the stack size while implementing this infix to postfix expression using operator stack? a+b+c+d+e
Avir Singh
asked
in
Algorithms
Nov 28, 2018
by
Avir Singh
298
views
infix-prefix
0
votes
0
answers
13
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);
Mk Utkarsh
asked
in
Programming
Oct 20, 2018
by
Mk Utkarsh
559
views
stack
data-structures
infix-prefix
0
votes
1
answer
14
TESTBOOK TEST SERIES
HOW TO SOLVE THIS?
Avik Chowdhury
asked
in
DS
Sep 9, 2018
by
Avik Chowdhury
285
views
infix-prefix
0
votes
2
answers
15
Data Structure - Postfix
sidlewis
asked
in
Programming
Sep 2, 2018
by
sidlewis
1.5k
views
data-structures
infix-prefix
0
votes
0
answers
16
Gate forum test series
nag.swarna
asked
in
DS
Aug 23, 2018
by
nag.swarna
183
views
infix-prefix
1
vote
1
answer
17
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.1k
views
data-structures
time-complexity
space-complexity
infix-prefix
stack
0
votes
1
answer
18
Postfix evaluation question
Hello all, Can anyone solve this postfix evaluation, i am trying to solve it but i really dont know how to solve the divide operator. 3 4 * 2 5 + / 2 5 4 + *2
theway789
asked
in
DS
May 2, 2018
by
theway789
1.2k
views
data-structures
stack
infix-prefix
0
votes
1
answer
19
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
Dec 12, 2017
by
Ananya Jaiswal 1
2.2k
views
data-structures
infix-prefix
0
votes
1
answer
20
ace test
is ans is D or C???
ADITYA CHAURASIYA 5
asked
in
DS
Sep 28, 2017
by
ADITYA CHAURASIYA 5
184
views
ace-test-series
infix-prefix
data-structures
2
votes
1
answer
21
Infix to postfix stack size
How is ans 15 for this question Please can anybody solve this
Himanshu Goyal
asked
in
Programming
Jul 15, 2017
by
Himanshu Goyal
4.0k
views
data-structures
stack
infix-prefix
9
votes
3
answers
22
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
11.2k
views
isro2017
data-structures
infix-prefix
stack
2
votes
2
answers
23
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
GATE
Jan 24, 2017
by
Bikram
192
views
tbb-mockgate-2
compiler-design
intermediate-code
infix-prefix
1
vote
2
answers
24
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
by
smartmeet
803
views
data-structures
stack
infix-prefix
virtual-gate-test-series
0
votes
1
answer
25
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.2k
views
data-structures
algorithms
infix-prefix
4
votes
1
answer
26
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 30, 2016
by
makhdoom ghaya
1.3k
views
gate1989
descriptive
data-structures
stack
infix-prefix
3
votes
1
answer
27
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.3k
views
data-structures
infix-prefix
1
vote
0
answers
28
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
989
views
data-structures
infix-prefix
Page:
1
2
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Life happens, just chill and do hardwork
ISRO RECRUITMENT FOR SCIENTIST B THROUGH GATE
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(648)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(855)
Recent questions tagged infix-prefix
Recent Blog Comments
The counts of answered, marked etc in the exam...
Tests have been sent and all tests will be...
@GO Classes @Deepak Poonia @Sachin...
@GO Classes @Deepak Poonia sir...
Maximum age limit changed from 35 yrs. to 28...