Using the algorithm evaluatePostfix, given in Segment 5.18 (or
see the algorithm evaluatePostfix in this pdf), evaluate the
following postfix expression. Assume that a = 2, b = 3, c = 4, d =
5, and e = 6.
? ? ∗ ? ? − / ? ? ∗ +
Homework Answers
a b * c a * - / d e * +
a = 2, b = 3, c = 4, d = 5, and e = 6
| value/symbol | Operation | Stack |
| a | push(2) | [2] |
| b | push(3) | [2 3] |
| * | pop();pop(); 2*3 = 6 | [6] |
| c | push(4) | [6 4] |
| a | push(2) | [6 4 2] |
| - | pop();pop(); 4-2 = 2 | [6 2] |
| / | pop();pop(); 6/2 = 3 | [3] |
| d | push(5) | [3 5] |
| e | push(6) | [3 5 6] |
| * | pop(); pop(); 5*6 = 30 | [3 30] |
| + | pop();pop(); 3 + 30 = 33 | [33] |
Answer = 33
Add Answer to:
Using the algorithm evaluatePostfix, given in Segment 5.18 (or
see the algorithm evaluatePostfix in this pdf),...
Write a java code to implement the infix to postfix algorithm as described below: Algorithm convertTo...
Write a java code to implement the infix to postfix algorithm as
described below:
Algorithm convertTo Post fix ( infix) // Converts an infix expression to an equivalent postfix expression operatorStack = a new empty stack postfix = anew empty string while (infix has characters left to parse) nextCharacter =next nonblank character of infix switch (nextCharacter) { case variable: Append nextCharacter to postfix break case 'A' operatorStack.push (nextCharacter) break case '+ case '-' : case '*' : case '/' while...
Evaluateeg EvaluateInFix.java: import java.util.Stack; import java.util.Scanner; public class EvaluateInfix { public static void main(String[] args)...
Evaluateeg
EvaluateInFix.java:
import java.util.Stack;
import java.util.Scanner;
public class EvaluateInfix
{
public static void main(String[] args)
{
Scanner keyboard = new Scanner(System.in);
System.out.println("This program an inFix Expression: ");
System.out.print("Enter an inFix Expression that you want to
evaluate (or enter ! to exit): ");
String aString = keyboard.nextLine();
while (!aString.equals("!"))
{
System.out.println (evaluateinFix(aString));
System.out.print("Enter an inFix Expression that you
want to evaluate (or enter ! to exit): ");
aString = keyboard.nextLine();
} // end while...
I need assistance with this code. Is there any way I can create this stack class (dealing with infix to postfix then postfix evaluation) without utilizing <stdio.h> and <math.h>? ________...
I need assistance with this code. Is there any way I can create
this stack class (dealing with infix to postfix then postfix
evaluation) without utilizing <stdio.h> and
<math.h>?
____________________________________________________________________________________________
C++ Program:
#include <iostream>
#include <string>
#include <stdio.h>
#include <math.h>
using namespace std;
//Stack class
class STACK
{
private:
char *str;
int N;
public:
//Constructor
STACK(int maxN)
{
str = new char[maxN];
N = -1;
}
//Function that checks for empty
int empty()
{
return (N == -1);
}
//Push...
Python Issue Postfix notation (also known as Reverse Polish Notation or RPN in short) is a...
Python Issue Postfix notation (also known as Reverse Polish Notation or RPN in short) is a mathematical notation in which operators follow all of its operands. It is different from infix notation in which operators are placed between its operands. The algorithm to evaluate any postfix expression is based on stack and is pretty simple: Initialize empty stack For every token in the postfix expression (scanned from left to right): If the token is an operand (number), push it on...
In c++ Section 1. Stack ADT – Overview Data Items The data items in a stack...
In c++ Section 1. Stack ADT – Overview Data Items The data items in a stack are of generic DataType. This means use should use templating and your Node class. Structure The stack data items are linearly ordered from the most recently added (the top) to the least recently added (the bottom). This is a LIFO scheme. Data items are inserted onto (pushed) and removed from (popped) the top of the stack. Operations Constructor. Creates an empty stack. Copy constructor....
Stacks are used by compilers to help in the process of evaluating expressions and generating machine...
Stacks are used by compilers to help in the process of
evaluating expressions and generating machine language code.In this
exercise, we investigate how compilers evaluate arithmetic
expressions consisting only of constants, operators and
parentheses. Humans generally write expressions like 3 + 4and 7 /
9in which the operator (+ or / here) is written between its
operands—this is called infix notation. Computers “prefer” postfix
notation in which the operator is written to the right of its two
operands. The preceding...
I'm having trouble writing this code, can some help me? Step 1: Capturing the input The...
I'm having trouble writing this code, can some help me? Step 1: Capturing the input The first step is to write a functionGetInput()that inputs the expression from the keyboard and returns the tokens---the operands and operators---in a queue. You must write this function. To make the input easier to process, the operands and operators will be separated by one or more spaces, and the expression will be followed by #. For example, here’s a valid input to your program: 6...
How to code up the postfixEval function using the instructions in the comments of the function?...
How to code up the postfixEval function using the instructions in the comments of the function? // postfixEvalTest.cpp #include "Token.h" #include <iostream> #include <vector> #include <stack> using namespace std; // postfix evaluate function prototype double postfixEval(vector<Token> &expr); int main() { vector<Token> postfix; postfix.push_back(Token(VALUE,4.0)); postfix.push_back(Token(VALUE,3.0)); postfix.push_back(Token(VALUE,2.0)); postfix.push_back(Token(OPERATOR,'*')); postfix.push_back(Token(OPERATOR,'+')); postfix.push_back(Token(VALUE,18.0)); postfix.push_back(Token(VALUE,6.0)); postfix.push_back(Token(OPERATOR,'/')); postfix.push_back(Token(OPERATOR,'-')); double result = 0.0; //result = postfixEval(postfix); cout << "The result of 4 3 2 * + 18 6 / - .... is " << result << endl; vector<Token>...
You are to write a program name expressionTree.java that evaluates an infix expression entered by the...
You are to write a program name expressionTree.java that evaluates an infix expression entered by the user. The expression may contain the following tokens: (1) Integer constants (a series of decimal digits). (2) One alphabetic character - "x" (representing a value to be supplied later). (3) Binary operators (+, -, *, / and % (modulo)). (4) Parentheses You will parse the input expression creating an expression tree with the tokens, then use the postOrder tree traversal algorithm to extract...
Programming Assignment 2 – RPN Calculator – Infix to Postfix Conversion and The Evaluations of the Postfix Expression. You are to design and implement and algorithm in Java, to input an Infix expressi...
Programming Assignment 2 – RPN Calculator – Infix to Postfix Conversion and The Evaluations of the Postfix Expression. You are to design and implement and algorithm in Java, to input an Infix expression , convert to a postfix expression and finally evaluate the postfix expression… Follow the examples done during class lectures… We are used to infix notation - ”3 + 4” - where the operator is between the operands. There is also prefix notation, where the operand comes before...
Write a java code to implement the infix to postfix algorithm as
described below:
Algorithm convertTo Post fix ( infix) // Converts an infix expression to an equivalent postfix expression operatorStack = a new empty stack postfix = anew empty string while (infix has characters left to parse) nextCharacter =next nonblank character of infix switch (nextCharacter) { case variable: Append nextCharacter to postfix break case 'A' operatorStack.push (nextCharacter) break case '+ case '-' : case '*' : case '/' while...
Evaluateeg
EvaluateInFix.java:
import java.util.Stack;
import java.util.Scanner;
public class EvaluateInfix
{
public static void main(String[] args)
{
Scanner keyboard = new Scanner(System.in);
System.out.println("This program an inFix Expression: ");
System.out.print("Enter an inFix Expression that you want to
evaluate (or enter ! to exit): ");
String aString = keyboard.nextLine();
while (!aString.equals("!"))
{
System.out.println (evaluateinFix(aString));
System.out.print("Enter an inFix Expression that you
want to evaluate (or enter ! to exit): ");
aString = keyboard.nextLine();
} // end while...
I need assistance with this code. Is there any way I can create
this stack class (dealing with infix to postfix then postfix
evaluation) without utilizing <stdio.h> and
<math.h>?
____________________________________________________________________________________________
C++ Program:
#include <iostream>
#include <string>
#include <stdio.h>
#include <math.h>
using namespace std;
//Stack class
class STACK
{
private:
char *str;
int N;
public:
//Constructor
STACK(int maxN)
{
str = new char[maxN];
N = -1;
}
//Function that checks for empty
int empty()
{
return (N == -1);
}
//Push...
Stacks are used by compilers to help in the process of
evaluating expressions and generating machine language code.In this
exercise, we investigate how compilers evaluate arithmetic
expressions consisting only of constants, operators and
parentheses. Humans generally write expressions like 3 + 4and 7 /
9in which the operator (+ or / here) is written between its
operands—this is called infix notation. Computers “prefer” postfix
notation in which the operator is written to the right of its two
operands. The preceding...
Most questions answered within 3 hours.
-
Calculate the pH of each of the following solutions.
0.50 M HBr
3.1×10−4 M KOH
4.2×10−5...
asked 1 hour ago -
For the year ended December 31, Depot Max’s cost of merchandise
sold was $85,600. Inventory at the...
asked 1 hour ago -
Week 10 - Professional Memo Assignment
Professional Memo Assignment
Your mission for this week, should you...
asked 1 hour ago -
Write a Python program that stores the data for each
player on the team, and it...
asked 1 hour ago -
In
the last 3 months, mike never knows when he is going to get his
allowance...
asked 1 hour ago -
Is Ca(OH)2 a Bronsted base, Lewis base, or both? Why?
asked 1 hour ago -
1A- Why don’t voters complain about U.S. tariffs on imported
sugar?
Because sugar is only a...
asked 1 hour ago -
Cash Payback Period
Primera Banco is evaluating two capital investment proposals for
a drive-up ATM kiosk,...
asked 1 hour ago -
Create a button in Swift (Xcode) that will create a charge,
create a charge using Stripe's...
asked 1 hour ago -
The reaction rate of CO and NO2 in the reaction
CO(g) + NO2(g) → CO2(g) +...
asked 1 hour ago -
Imagine that a chemist puts 6.40 mol each of
C3H8 and O2 in a 1.00-L container...
asked 2 hours ago -
How much money should be invested today in order to have $8340
at the end of...
asked 2 hours ago