Evaluation of expression Using Stack

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/UP-POLICE-COMPUTER-OPERATOR/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 the course: About the Course
  2. General Knowledge: Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, GK- Current Affairs, Indian Economy, Static General Knowledge, Environment, Evolution of Indian Banking (Banking & Financial Awareness)
  3. Mental Aptitude and Reasoning: Ratio and Proportion (Ratios), Data Interpretation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Vocabulary, Profit and Loss, Arithmetic, Mental Ability, Percentage, Algebra, Mensuration and Geometry, Age Problems, Clock, Calendar, Verbal Analogy (Word Based Analogy), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Analogy, Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Selection Decision Table (Decision Making), Cubes & Dices, Blood Relations, Venn Diagram, Logical Sequence Of Words, Inequality, Directions (Direction Test), Data Arrangement, Syllogisms, Seating Arrangements, Ranking, Order and Sequence, Time and Work, Ratio and Proportion, Averages, Mixtures and Alligation, Percentages, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Number System, Statistics, Three-Dimensional Patterns and Visualization, Permutations and Combinations, Alphabet and Word Tests, Sequences and Series, Simplification and Approximation, Mathematical Operations, Constraint Puzzles, Numerical Reasoning, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Cubes and Dice, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Profit, Loss and Discount, Mensuration, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Order, Ranking and Sequence, Trigonometry, Probability, Measurement and Quantity Take-Off, Clocks and Calendars, Articles and Determiners, Logical Deduction and Induction, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Modals, Conditionals and Subjunctive, Algebra, Vocabulary, Data Interpretation, Speed, Time and Distance, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Mixture and Alligation, HCF LCM, Combinatorics
  4. CS | Computer Fundamentals: Basics of COA, Number System, Number Representation, C Fundamentals, Algorithm Analysis, Input Output Organisation, Semiconductor Memories and Programmable Logic, Timing, Hazards and Testing, Processor Organization and Instructions, Memory Hierarchy and Input/Output, Number Systems and Codes, Combinational Logic Design, Combinational Logic Circuits, Number Systems and Codes
  5. CS | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, SQL
  6. CS | Workplace productivity Tools: MS Office Applications, Keyboard Shortcuts
  7. CS | Computer Networks: Introduction to CN, Data Communication, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, Application Layer, Hardware Basics, Network Security
  8. CS | The Internet: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Web Publishing & Hosting, Server Side & Security, Emerging Technologies
  9. CS | Emerging Technologies: Artificial Intelligence, Emerging Tech Trends, Introduction to OS, Windows OS, Linux OS, Unix OS, JavaScript-Basics, Internet of Things
  10. CS | Boolean algebra: Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Logic Gates & Hardware, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Semiconductor Memories and Programmable Logic Devices, Logic Families, Arithmetic Circuits, Waveform Generators and Timer Circuits, Minimization of Boolean Functions
  11. CS | Data Structures: Introduction to DS, Array, Stack, Queue
  12. CS | Cryptography: Society, Law & Ethics, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security
  13. UP Police Previous Year Papers:
  14. UP Police Full Mock Tests:
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…