Create an appropriate Java Postfix calculator class using th ealgorithm below. Your program should accept at least five elements (data1, data2, data3, data4, data5) and will perform an appropriate postfix operation given the following scenarios: data1 data2 + data3 * data4 - data1 data2 * data3 data1 - / data4 data5 * + data1data3 - data2^ data4+ Use the following values for each input: data1 = 1; data2 = 2; data3 = 4 data4 = 5 data5 = 3 Ensure that your program has the required class and a test class. Algorithm: Algorithm evaluatePostfix(postfix) // Evaluates postfix expression. valueStack = a new empty stack while (postfix has characters left to parse) { nextCharacter = next nonblank character of postfix switch (nextCharacter) { case variable: valueStack.push(value of the variable nextCharacter) break case '+' : case '-' : case '*' : case '/' : case '^' : operabdTwo = valueStack.pop() operandOne = valueStack.pop() result = the result if the operation in nextCharacter and its operands operandOne and operandTwo valueStack.push(result) break default : break //Ignore unexpected characters } } return valueStack.peek()
OOPs
In today's technology-driven world, computer programming skills are in high demand. The object-oriented programming (OOP) approach is very much useful while designing and maintaining software programs. Object-oriented programming (OOP) is a basic programming paradigm that almost every developer has used at some stage in their career.
Constructor
The easiest way to think of a constructor in object-oriented programming (OOP) languages is:
Don't copy from otherwbsite i will rate
Create an appropriate Java Postfix calculator class using th ealgorithm below. Your program should accept at least five elements (data1, data2, data3, data4, data5) and will perform an appropriate postfix operation given the following scenarios:
- data1 data2 + data3 * data4 -
- data1 data2 * data3 data1 - / data4 data5 * +
- data1data3 - data2^ data4+
Use the following values for each input:
data1 = 1;
data2 = 2;
data3 = 4
data4 = 5
data5 = 3
Ensure that your program has the required class and a test class.
Algorithm evaluatePostfix(postfix)
// Evaluates postfix expression.
valueStack = a new empty stack
while (postfix has characters left to parse)
{
nextCharacter = next nonblank character of postfix
switch (nextCharacter)
{
case variable:
valueStack.push(value of the variable nextCharacter)
break
case '+' : case '-' : case '*' : case '/' : case '^' :
operabdTwo = valueStack.pop()
operandOne = valueStack.pop()
result = the result if the operation in nextCharacter and its operands
operandOne and operandTwo
valueStack.push(result)
break
default : break //Ignore unexpected characters
}
}
return valueStack.peek()
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
