Postfix notation Program plan: Import the required packages into the program. In the Exercise20_14 class, In the main() method, Check length of the argument. If yes, display the error message. Declare the variable. The for loop executes until the length of arguments. If yes, evaluate the expression. In try block, call evaluateExpression() method by passing the input expression. In catch, block, catch the exception. In the evaluateExpression() method. Create an object for Stack. Extract operands and operators. The while loop executes until token to scan the expression. If yes, Extract an expression. Check whether the length of expression is equal to 0. If yes, continue the code. Otherwise, check the expression. If yes, call processAnOperator() method. Otherwise, Call push() method to push an operand into stack. Return the result. In the processAnOperator() method. Check whether operator. If yes, perform the addition operation and push the result to stack. Otherwise, check whether operator. If yes, perform the subtraction operation and push the result to stack. Otherwise, check whether operator. If yes, perform the multiplication operation and push the result to stack. Otherwise, check whether operator. If yes, perform the division operation and push the result to stack.

Question

Want to see the full answer?

Answer 1

Question

Chapter 20, Problem 20.14PE

Program Plan Intro

Postfix notation

Program plan:

Import the required packages into the program.

In the Exercise20_14 class,

In the main() method,

Check length of the argument. If yes, display the error message.

Declare the variable.

The for loop executes until the length of arguments. If yes, evaluate the expression.

In try block, call evaluateExpression() method by passing the input expression.

In catch, block, catch the exception.

In the evaluateExpression() method.

Create an object for Stack.

Extract operands and operators.

The while loop executes until token to scan the expression. If yes,

Extract an expression.

Check whether the length of expression is equal to 0. If yes, continue the code.

Otherwise, check the expression. If yes, call processAnOperator() method.

Otherwise, Call push() method to push an operand into stack.

Return the result.

In the processAnOperator() method.

Check whether operator. If yes, perform the addition operation and push the result to stack.

Otherwise, check whether operator. If yes, perform the subtraction operation and push the result to stack.

Otherwise, check whether operator. If yes, perform the multiplication operation and push the result to stack.

Otherwise, check whether operator. If yes, perform the division operation and push the result to stack.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Suppose that the MinGap method below is added to the Treap class on Blackboard. public int MinGap ( ) Returns the absolute difference between the two closest numbers in the treap. For example, if the numbers are {2, 5, 7, 11, 12, 15, 20} then MinGap would returns 1, the absolute difference between 11 and 12. Requirements 1. Describe in a separate Design Document what additional data is needed and how that data is used to support an time complexity of O(1) for the MinGap method. Show as well that the methods Add and Remove can efficiently maintain this data as items are added and removed. (6 marks) 2. Re-implement the methods Add and Remove of the Treap class to maintain the augmented data in expected O(log n) time. (6 marks) 3. Implement the MinGap method. (4 marks) 4. Test your new method thoroughly. Include your test cases and results in a Test Document. (4 marks)

Suppose that the two Rank methods below are added to the Skip List class on Blackboard. public int Rank (T item) Returns the rank of the given item. public T Rank(int i) Returns the item with the given rank i. Requirements 1. Describe in a separate Design Document what additional data is needed and how that data is used to support an expected time complexity of O(log n) for each of the Rank methods. Show as well that the methods Insert and Remove can efficiently maintain this data as items are inserted and removed. (7 marks) 2. Re-implement the methods Insert and Remove of the Skip List class to maintain the augmented data in expected O(log n) time. Using the Contains method, ensure that added items are distinct. (6 marks) 3. Implement the two Rank methods. (8 marks) 4. Test your new methods thoroughly. Include your test cases and results in a Test Document. (4 marks)