CSE21P6 - Data Structure Lab

Expression Conversion and Evaluation

Term 161

Exp 2. Write a program to implement postfix evaluation algorithm for finding solution of a given postfix expression.

1. 2 3 4 + * 6 -
2. 7 8 + 3 2 + /

Exp 7. Write a C program to evaluate the following infix expression:

P = 10/(8-4)+2*(10+04)

Term 191

Exp 11. Write a C program to evaluate the following infix expression:

P = 20/(8-4)+2*(10+04)

Term 201

Exp 6. Write a program to convert the given infix expression to it's postfix format.

Exp 11. Write a program to evaluate the following of prefix expression: - + 8 / + 6 3 2

Term 211

Exp 8. Design, develop, and implement a program for converting an infix expression to postfix expression. Program should support for both parenthesized and free parenthesized expressions with the operators: +, -, *, /, % (Remainder), ^ (power) and alphanumeric operands.