Infix To Prefix Conversion Of Expression

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/COCUBES-PREPARATION/data-structures/stack/infix-postfix-prefix/asset-infix-to-prefix-conversion-of-expression after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Aptitude: Number System, Divisibility Rules, HCF LCM, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Mixture and Alligation, Partnership, Age Problems, Time and Work, Pipe and Cistern, Speed Time and Distance, Algebra, Arithmetic, Data Interpretation, Sequence and Series (Series), Logarithm, Powers and Exponents (Surds and Indices), Permutation and Combination, Probability, Speed Mathematics and Basic Mathematics, Trigonometry
  2. Logical Reasoning: Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Syllogisms, Inequality, Data Sufficiency, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Venn Diagram, Logical Sequence Of Words, Calendar, Clock, Cubes & Dices, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
  3. Verbal Ability: Noun, Pronoun, Adjectives, Verb, Adverb, Tenses, Subject Verb Agreement (Verb Noun Agreement), Articles, Preposition, Conjunction, Modals, Determiner, Vocabulary, 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), Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Construction
  4. Data Structures (Domain Test): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  5. Algorithms (Domain Test): Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms
  6. OOPs (Domain Test): Object Oriented Programming (OOPS)
  7. DBMS (Domain Test): 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
  8. SQL (Domain Test): SQL
  9. Operating Systems (Domain Test): 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
  10. Computer Networks (Domain Test): 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, Mobile Technology, Cloud Computing and IoT, Cyber and Info Security
  11. Coding: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir
  12. Written English Test: English Writing Ability
  13. Psychometric Test: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric 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

  1. 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. 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.

Loading lesson…