Posted: April 5th, 2023

CS221- Data StructuresAssignment

CS221- Data Structures
Assignment 2
[Linked List, Stack, and Applications]
Deadline: 21
st October 2022 11:59PM
Group Size: Maximum two individuals
Problem Statement:
In this assignment, you have to write a program to convert an infix expression to postfix
and then solve it using a stack. The stack should be implemented using an array.
Your program should do the following things.
1. Take as input a mathematical expression
For example: 12 + 3 * 8 * (3/4-2)
2. Convert the equation in a postfix notation
3. Solve the input expression
4. Your program must have separate functions for addition, subtraction, and others
5. Display the following as output after clearing the screen
a. The input equation
b. Postfix form of the input equation
c. Answer to the input equation
Note:
The equation may be of any complexity try to write a generic code.
Submission guidelines:
 I need help writing my essay – research paper email your assignment at CS221fall2022@gmail.com
 Email subject must be, CS221-A2-RegNo.1-RegNo.2. For example CS221-A2-2021234-2021333
 Your submission file must also be named CS221-A2-RegNo.1-RegNo.2. For example CS221-A2-
2021234-2021333

+++++

To convert an infix expression to postfix notation, you can use the following algorithm:

Create an empty stack for operators and an empty list for the output postfix notation.
Scan the infix expression from left to right.
If the current token is an operand, append it to the output list.
If the current token is an operator, push it onto the operator stack if it has higher precedence than the top of the stack, or pop operators from the stack and append them to the output list until the stack is empty or the top operator has lower precedence than the current operator. Then push the current operator onto the stack.
If the current token is an opening parenthesis, push it onto the stack.
If the current token is a closing parenthesis, pop operators from the stack and append them to the output list until an opening parenthesis is encountered. Discard both the opening and closing parentheses.
Repeat steps 3-6 until the end of the infix expression.
Pop any remaining operators from the stack and append them to the output list.
To evaluate the postfix expression, you can use a stack implemented using an array.

Create an empty stack for operands.
Scan the postfix expression from left to right.
If the current token is an operand, push it onto the operand stack.
If the current token is an operator, pop two operands from the stack, apply the operator to the operands, and push the result back onto the stack.
Repeat steps 3-4 until the end of the postfix expression.
The final result will be the only remaining element on the operand stack.
You can write separate functions for addition, subtraction, multiplication, division, etc., and call them based on the operator encountered in the postfix expression.

After implementing the above algorithm, you can display the input equation, the postfix form of the input equation, and the answer to the input equation. You can clear the screen using the appropriate command for your operating system.

Make sure to test your code thoroughly with different inputs of varying complexity. Good luck with your assignment!

Order | Check Discount