Question

In: Computer Science

Following is an infix expression. &n

Following is an infix expression.

((A ^ B) ^ C ^ M * W / X ) ^ Y ^ Z

Convert it into postfix and prefix using stack and verify through binary tree.
Evaluate infix, postfix and prefix with the following values.

A = 2, B = 2, C = 3, M = 1, W = 4, X = 8, Y = 1, Z = 3

Expert Solution

2

3

4

5

6

7

8

9

10

venereology answered 1 year ago

Write a program that takes an infix expression as input and produces a postfix expression. The...

Write a program that takes an infix expression as input and produces a postfix expression. The infix and postfix expressions are in the form of vectors of strings. We will test with a main method that takes a file name as input from the command line. We will test your implementation using printPostFix() method. There are sample input and output files in this folder. You may edit the header file. Example 1 infix expression = apple + banana * cat...

Implement an infix expression to postfix expression convertor in C++. Note: - Support +, -, *,...

Implement an infix expression to postfix expression convertor in C++. Note: - Support +, -, *, /, ( and ) in infix expressions. - Operands will be nonnegative only. - Assume infix expressions are valid and well formatted (one blank space to separate operand/operator) For example, - 3 * 4 + 5 ➔ 3 4 * 5 + - 3 + 4 * 5 ➔ 3 4 5 * + - (3 + 4) * (5 + 6) ➔ 3...

Use the algorithm below to evaluate the following infix expression: a) a + 3 * 4...

Use the algorithm below to evaluate the following infix expression: a) a + 3 * 4 – 9 b) ( 2 + 6 ) / ( 3 – 5 ) . Algorithm WRITE STEP BY STEP Scan the characters in the infix expression. While there are characters left in the infix expression: Check the next character in the expression. 1. If the next character is operand, remove it from the expression and push it onto the operand stack. 2. If...

Write a program that performs the following two tasks: Reads an arithmetic expression in an infix...

Write a program that performs the following two tasks: Reads an arithmetic expression in an infix form, stores it in a queue (infix queue) and converts it to a postfix form (saved in a postfix queue). Evaluates the postfix expression. Use the algorithms described in class/ lecture notes. Use linked lists to implement the Queue and Stack ADTs. Using Java built-in classes will result in 0 points. You must use your own Stack and Queue classes (my code is a...

Convert an infix expression to its postfix representation in JAVA

Write a C++ program that converts an infix expression, which includes (, ), +, -, *,...

Write a C++ program that converts an infix expression, which includes (, ), +, -, *, and / operations to postfix notation. The program should allow the user to enter an infix expression using lower case characters, then it will display the result of conversion on the screen. (Note: Use the STL stack class to accomplish the solution.).

In Java, write class InfixToPostfixConverter co convert an ordinary infix arithmetic expression (assume a valid expression...

In Java, write class InfixToPostfixConverter co convert an ordinary infix arithmetic expression (assume a valid expression is entered) with single-digit integers (to make things easier) such as (6 + 2) • 5 - 8 / 4 to a postfix expression. The postfix version (no parentheses are needed) of this infix expression is 6 2 + 5 * 8 4 / - The program should read the expression into StringBuilder or String infix and use the Stack and Stack Interface class...

For the following infix expression, build the corresponding expression tree. 1.1 ab 1.2 a+bc 1.3 a+b*c/d-e...

For the following infix expression, build the corresponding expression tree. 1.1 a*b 1.2 a+b*c 1.3 a+b*c/d-e Perform pre-order and post-order traversal of the above binary expression trees. What relationship exists among these scans and prefix and postfix notation for the expression?

Using java.util.Stack and java.util.StringTokenizer to write a program that converts an infix expression to a postfix...

Using java.util.Stack and java.util.StringTokenizer to write a program that converts an infix expression to a postfix expression using data from infix.dat. Make sure your program can handle negative number. If the input expression can’t be converted, display error message.(1.5 points) (Should remove parentheses) infix.dat 5 * 6 + -10 3 - 2 + 4 7 ( 3 * 4 - (2 + 5)) * 4 / 2 10 + 6 * 11 -(3 * 2 + 14) / 2 2...

Using a stack, write a program that turns a simple infix arithmetic expression into a postfix...

Using a stack, write a program that turns a simple infix arithmetic expression into a postfix expression. For example, 1 + 2 * 3 becomes 2 3 * 1 +. Also, evaluate the expression to ensure the expression is correct.