Infix and Postfix
Prerequisites of the Experiment
- Basic knowledge on Infix, and Postfix
- Basic mathematical expressions and their functionings
- Operation of stack by Push and Pop methods
- A little bit about Expression trees(not necessary)
- And above all, a curiosity to learn and explore!
Overview of the Experiment
- The aim of this experiment is to understand the push and pop operations of stack and conversion of infix expressions to postfix expressions using stack and without using stack.
- The experiment features a series of modules with video lectures, interactive demonstrations, simulations, hands-on practice exercises and quizzes for self analysis.
Experiment Modules & their Weightage
| Module | Weightage | Expectation |
|---|---|---|
| Pre-Test | 5% | Solve All Questions |
| Formally defining the Expressions | 5% | Become able to indentify different expressions |
| Introduction to Infix to Postfix Conversion | 10% | Able to Convert Infix Expression without using stack |
| Conversion using Stack Operations | 25% | Try all operations with atleast two examples using stack |
| Evaluation of the Postfix Expressions | 25% | Able to evaluate any postfix expression(solve atleast two) |
| Post-assessment | 30% | Solve all Questions |