Evaluation of Postfix Expression

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/NIACL-AO-IT-SPECIALIST/data-structure-it-specialist/stack/eval-of-expressions/asset-evaluation-of-postfix-expression after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Aptitude: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Speed Mathematics and Basic Mathematics, Algebra, Percentage, Profit and Loss, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Time and Work, Mensuration and Geometry, Partnership
  2. Reasoning Ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Seating Arrangements, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Directions (Direction Test), Ranking, Order and Sequence, Syllogisms, Blood Relations, Puzzle Solving (Puzzles), Inequality, Machine Input-Output
  3. English Language: Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Construction, Pronoun, Preposition, Conjunction, Adverb, Verb, Modals, Articles, Determiner, Interjection
  4. General Awareness: Evolution of Indian Banking (Banking & Financial Awareness), GK- Current Affairs, Static General Knowledge, Indian Economy
  5. C Concepts + MCQs (IT Specialist): C Programming by Yash Sir, C Language Core
  6. Java (IT Specialist): Java
  7. Python (IT Specialist): Python for Placements by Yash Sir, Python Basics
  8. OOPs (IT Specialist): Object Oriented Programming (OOPS)
  9. DBMS (IT Specialist): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  10. SQL (IT Specialist): SQL
  11. Software Engineering (IT Specialist): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Data Structure (IT Specialist): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  13. Operating System (IT Specialist): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  14. Compiler Design (IT Specialist): Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  15. Computer Architecture (IT Specialist): Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
  16. Data Communication & Networking (IT Specialist): Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security
  17. Descriptive Test (Main Exam): English Writing Ability
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video demonstrates the step-by-step evaluation of a postfix expression using a stack data structure. The instructor presents the expression `8 2 3 * 1 / + 4 1 * 2 / +` and systematically processes each token from left to right. He explains that operands are pushed onto the stack, while operators trigger the popping of the top two elements, performing the operation, and pushing the result back. The process continues until the entire expression is traversed, leaving the final result at the top of the stack. This method avoids the need for parentheses and simplifies the evaluation process significantly, making it a standard technique in computer science for parsing mathematical expressions.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The instructor begins by writing the postfix expression `8 2 3 * 1 / + 4 1 * 2 / +` on the screen. He draws a vertical stack to track the values. He pushes the initial operands 8, 2, and 3 onto the stack. Upon encountering the multiplication operator `*`, he pops 3 and 2, calculates `2 * 3 = 6`, and pushes 6 back. He continues this process, pushing 1, then dividing the top two elements (6 / 1 = 6). Next, he adds the top two elements (8 + 6 = 14). He then pushes 4 and 1, multiplies them (4 * 1 = 4), pushes 2, divides (4 / 2 = 2), and finally adds the remaining elements (14 + 2 = 16). The instructor meticulously crosses off each processed number and operator on the original expression to keep track of progress and ensure no tokens are missed. He writes intermediate calculations like `2*3`, `6/1`, and `8+6` next to the stack to show the logic.

  2. 2:00 – 2:10 02:00-02:10

    The instructor finalizes the calculation. He circles the final result `16` written on the board, confirming the evaluation of the postfix expression is complete. He briefly summarizes that the stack method yields the correct answer.

This lesson illustrates the algorithmic approach to evaluating postfix notation, a fundamental concept in computer science. By visualizing stack operations, students see how intermediate results are managed and how the final value is derived without parentheses. The visual tracking of the stack and crossed-out operators provide a clear pedagogical tool for understanding expression evaluation algorithms.

Loading lesson…