\ Convert the following infix expression into postfix one: (A+B^D)/(D-F)+G PS: you have to illustrate the different steps of this conversion one by one.

C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter18: Stacks And Queues
Section: Chapter Questions
Problem 21SA
icon
Related questions
Question

Q1 \ Convert the following infix expression into postfix one:

(A+B^D)/(D-F)+G

PS: you have to illustrate the different steps of this conversion one by one.

501324-3 Fall 2021
Assignment
501324-3 Fall 2021
Assignment
Topics: Stack – Queue - Tree
Consider that you have a stack S and a queue Q. Draw S and Q after executing the
following operations (Op).
Topics: Stack – Queue - Tree
You have to indicate for each operation, the stack or the queue content in addition
to the index value of the top (stack) or the front and the rear (queue)
Question 1:
Convert the following infix expression into postfix one]
(A+B^D)/(D-E)±G
Stack S; Queue Q;
PS: you have to illustrate the different steps of this conversion one by one.
int a=3, b=7
Token #
Postfix Expression
Stack
Scan
Opl: Qengueue(atb);
Op2: S.push(a-b);
. Ор3: S.push),
Ор4: а-роp();
• Op5: Qenqueue(a);
Op6: SRush(Q.degueueO);
Op7: Qenqueue(b);
• Op8: Qengueue(S.pop0 + b);
Qengueue(Q.deaueueO);
1
14
Op9
Op10: Qenequeue(S.pop0);
18
19
Operation
Stack S
Queue Q
1
10
11
2
12
13
3
14
15
4
The final solution is:
Question 2:
Evaluate the postfix expression ABCD+* /
Where A = 66, B = 1, C = 12 and D=10
8
9
Question 3: (Final Exam-Fall2018)
Transcribed Image Text:501324-3 Fall 2021 Assignment 501324-3 Fall 2021 Assignment Topics: Stack – Queue - Tree Consider that you have a stack S and a queue Q. Draw S and Q after executing the following operations (Op). Topics: Stack – Queue - Tree You have to indicate for each operation, the stack or the queue content in addition to the index value of the top (stack) or the front and the rear (queue) Question 1: Convert the following infix expression into postfix one] (A+B^D)/(D-E)±G Stack S; Queue Q; PS: you have to illustrate the different steps of this conversion one by one. int a=3, b=7 Token # Postfix Expression Stack Scan Opl: Qengueue(atb); Op2: S.push(a-b); . Ор3: S.push), Ор4: а-роp(); • Op5: Qenqueue(a); Op6: SRush(Q.degueueO); Op7: Qenqueue(b); • Op8: Qengueue(S.pop0 + b); Qengueue(Q.deaueueO); 1 14 Op9 Op10: Qenequeue(S.pop0); 18 19 Operation Stack S Queue Q 1 10 11 2 12 13 3 14 15 4 The final solution is: Question 2: Evaluate the postfix expression ABCD+* / Where A = 66, B = 1, C = 12 and D=10 8 9 Question 3: (Final Exam-Fall2018)
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Form and its Elements
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning