Evaluation of expression Using Stack

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/IBPS-SO-IT-PRELIMS/data-structures/stack/eval-of-expressions/asset-evaluation-of-expression-using-stack after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. English Language: Vocabulary, Noun, Adjectives, Tenses, Pronoun, Adverb, Preposition, Conjunction, Active Passive Voice (Voice), Articles, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage)
  3. Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Puzzle Solving (Puzzles), Seating Arrangements, Blood Relations, Syllogisms, Inequality, Directions (Direction Test), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Clock, Calendar, Analytical Reasoning (Counting Figures Reasoning), Selection Decision Table (Decision Making), Cubes & Dices, Machine Input-Output
  4. Quantitative Aptitude: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Algebra, Speed Mathematics and Basic Mathematics, Percentage, Average, Time and Work, Simple Interest and Compound Interest, Profit and Loss, Age Problems, Partnership, Mensuration and Geometry, Probability, IBPS Specific Videos
  5. Data Structures - Professional Knowledge: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms- Professional Knowledge: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  7. Python- Professional Knowledge: Python for Placements by Yash Sir, Python Basics
  8. Operating System- Professional Knowledge: Introduction to OS, Process Management, CPU Scheduling, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management
  9. DBMS + SQL- Professional Knowledge: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), File Organization & Indexing, SQL, Transaction Management, Concurrency Control
  10. Computer Networks- Professional Knowledge: Introduction to CN, Data Communication, Net Layer: IP Addressing, Net Layer: IPv4 & Proto, Application Layer, Hardware basics, Network Security
  11. Software Engineering- Professional Knowledge: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Computer Organization & Microprocessor- Professional Knowledge: Basics of COA, Cache Memory Organization, Programming the Basic Computer
  13. Digital Logic Design- Professional Knowledge: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  14. Theory of Computation- Professional Knowledge: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Regular Language Properties, Pushdown Automata & CFG, Turing Machines
  15. Compiler Design- Professional Knowledge: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Intermediate Code Gen, Code Optimization
  16. Programming Languages- Professional Knowledge: C Programming by Yash Sir, Object Oriented Programming (OOPS), Programming in C++, Java, C Language Core
  17. Emerging Tech- Professional Knowledge: Emerging Tech Trends
  18. Artificial Intelligence: Artificial Intelligence
  19. Unit Test - Professional Knowledge:
  20. Full Length Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture focuses on the application of stacks in computer science, specifically for evaluating arithmetic expressions in postfix notation. The instructor, Sanchit Jain Sir from Knowledge Gate, presents a specific problem from the GATE 2015 exam. The problem asks to evaluate the postfix expression `10 5 + 60 6 / * 8 -`. The solution involves using a stack to store operands and performing operations as operators are encountered. The instructor systematically walks through the expression, pushing numbers onto the stack and performing calculations when an operator appears, ultimately arriving at the correct answer among the provided choices.

Chapters

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

    The video begins with a title slide indicating a 'Break' and the topic 'Application of Stack: Arithmetic Expression Evaluation'. The instructor introduces a GATE 2015 question asking for the result of the postfix expression `10 5 + 60 6 / * 8 -`, with options (A) 284, (B) 213, (C) 142, and (D) 71. He writes the expression on the board and begins the evaluation process. He draws a stack diagram and pushes the first two operands, 10 and 5. Upon encountering the `+` operator, he pops 5 and 10, calculates their sum (15), and pushes the result back onto the stack. Next, he pushes the operands 60 and 6. When the `/` operator is encountered, he pops 6 and 60, performs the division (60 divided by 6 equals 10), and pushes the result 10 onto the stack. At this point, the stack contains 15 and 10, ready for the next operation.

  2. 2:00 – 4:27 02:00-04:27

    Continuing from the previous state, the instructor encounters the `*` operator. He pops the top two elements, 10 and 15, and multiplies them (15 * 10 = 150), pushing the result 150 back onto the stack. He then pushes the next operand, 8, onto the stack. Finally, he encounters the `-` operator. He pops 8 and 150, subtracting 8 from 150 to get the final result of 142. The instructor marks option (C) 142 as the correct answer, completing the step-by-step demonstration of postfix expression evaluation using a stack. He emphasizes the visual representation of the stack growing and shrinking as operations are performed.

This lecture segment effectively demonstrates the practical application of the stack data structure in parsing and evaluating mathematical expressions. By breaking down the GATE 2015 problem, the instructor illustrates the Last-In-First-Out (LIFO) nature of stacks, where operands are stored until an operator triggers a calculation. The example emphasizes the correct order of operands for non-commutative operations like subtraction and division, ensuring students understand how postfix notation simplifies expression evaluation without parentheses. The visual board work reinforces the abstract concept of stack operations.

Loading lesson…