Infix To Prefix Conversion Of Expression
Duration: 5 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
- Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
- Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
- Paper 1 | Unit Tests:
- Paper 1 | Full-Length Mock Tests:
- Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
- Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation 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 Timing, Hazards and Testing Logic Families Combinational Logic Design Arithmetic Circuits Semiconductor Memories and Programmable Logic Devices Combinational Logic Circuits Sequential Circuits and State Machines Latches and Flip-Flops Finite State Machines Minimization of Boolean Functions Arithmetic Circuits Registers and Counters Latches and Flip-Flops Number Systems and Codes
- Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
- Paper 2 | Programming and Data Structures: C Fundamentals Control Flow Functions Arrays & Pointers Storage Classes, Structures & Enums DMA, Macros, Scoping & File Handling Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing
- Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
- Paper 2 | Theory Of Computation/Automata Theory: Introduction to TOC Deterministic FA (DFA) Non-Deterministic FA Regular Expressions Grammar Regular Language Properties Moore & Mealy Machines Pushdown Automata & CFG Turing Machines Complexity Theory
- Paper 2 | Compiler Design: 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
- Paper 2 | Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management
- Paper 2 | DataBase Management System/DBMS: Basics of DBMS ER Diagram Relational Model & Functional Dependencies Keys & Integrity Constraints Normalization (1NF - BCNF) Decomposition Properties & 4NF File Organization & Indexing Relational Algebra SQL Relational Calculus Transaction Management Concurrency Control Database Recovery
- Paper 2 | Computer Networks: Introduction to CN 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
- Paper 2 | CS/IT Sectional Mock Tests:
- Complete Paper Full Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This lecture addresses a GATE-2004 question on converting the infix expression "a + b x c - d ^ e ^ f" into postfix notation. The problem states that "+", "-", and "x" are left associative, while "^" is right associative. The precedence order from highest to lowest is ">", "x", "+", "-". The instructor writes the expression on a whiteboard and progressively groups terms based on precedence, underlining sub-expressions such as "b x c" and "d ^ e ^ f". The conversion process involves breaking the expression into smaller parts, converting each sub-expression to postfix form individually, and then combining them according to the operator order. The final answer is derived by applying operators in precedence order, with right-associative exponentiation handled from right to left. The correct postfix form corresponds to option (A) "abc x + def ^ ^ -", reflecting the evaluation order where multiplication and exponentiation are resolved before addition and subtraction.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with a red GATE-2004 question displayed at the top, asking for the postfix form of "a + b x c - d ^ e ^ f". The question specifies that "+", "-", and "x" are left associative, while "^" is right associative, with precedence order (highest to lowest) being ">", "x", "+", "-". Four options are listed: (A) abc x + def ^ ^ -, (B) abc x + de f ^ ^ -, (C) ab + c x d - e ^ f ^, and (D) - + a x bc ^ ^ def. The instructor writes the infix expression in red handwriting below the options to begin the conversion process, adding annotations near option A and writing notes like "3x5+6" with arrows to track conversion steps.
2:00 – 4:51 02:00-04:51
The instructor continues the step-by-step conversion by writing out the expression and underlining specific parts such as "d ^ e ^ f" to focus on precedence grouping. The board shows intermediate steps like "a + bxc - d^e^f" and progressively groups terms based on operator precedence. The instructor explains how to break down the expression into sub-parts like "a + b x c" and "d ^ e ^ f", converting each to postfix form individually. The final step shows the complete postfix conversion being derived at the bottom of the board, with the instructor gesturing while explaining the logic of combining postfix expressions according to right-associative exponentiation rules.
The core teaching concept is infix-to-postfix conversion using operator precedence and associativity rules. The key method involves: (1) identifying the highest-precedence operators first, (2) respecting right-associativity for exponentiation by evaluating from right to left, and (3) progressively grouping sub-expressions before converting. The expression "a + b x c - d ^ e ^ f" is broken into components where "b x c" becomes "bcx", and "d ^ e ^ f" (right-associative) becomes "def^^". The final postfix form combines these as "abcx+def^^-", matching option (A). This demonstrates that postfix notation eliminates the need for parentheses by encoding evaluation order directly in operator placement.

