Tree method for conversion

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/COGNIZANT-PREPARATION/data-structures/stack/infix-postfix-prefix/asset-tree-method-for-conversion after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Communication Round: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), 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), Direct and Indirect Speech, Active Passive Voice (Voice), Verbal Analogy (Word Based Analogy), Articles, Preposition, Conjunction, Sentence Construction, English Writing Ability, Communication Assessment
  2. Quantitative Aptitude: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Speed Time and Distance, Percentage, Average, Powers and Exponents (Surds and Indices), Time and Work, Mensuration and Geometry, Age Problems, Pipe and Cistern, Probability, Profit and Loss, Simple Interest and Compound Interest, Algebra
  3. Analytical and Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Directions (Direction Test), Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Logical Sequence Of Words, Puzzle Solving (Puzzles), Syllogisms, Seating Arrangements, Calendar, Clock, Blood Relations, Cubes & Dices, Venn Diagram, Analytical Reasoning (Counting Figures Reasoning)
  4. Cognizant Gaming Aptitude: Gamified / Game Based Aptitude
  5. Java (Cluster 1): Java
  6. ANSI SQL MySQL (Cluster 1,2,3): SQL
  7. HTML, CSS, JavaScript (Cluster 1,3): HTML, CSS, JavaScript
  8. Python (Cluster 2): Python for Placements by Yash Sir
  9. Cloud Fundamentals (Cluster 2): Emerging Tech Trends
  10. C# (Cluster 3): C#
  11. OOPs: Object Oriented Programming (OOPS)
  12. Technical Assessment (Coding): Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Pseudo Codes
  13. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  14. DBMS: 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
  15. Operating Systems: 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
  16. Computer Networks: 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
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video features a lecture by Sanchit Jain from KnowledgeGate, focusing on converting an infix expression to postfix notation. The specific problem is from the GATE 2004 exam. The instructor systematically breaks down the expression `a + b * c - d ^ e ^ f` by constructing an expression tree based on operator precedence and associativity rules. He emphasizes that `+`, `-`, and `*` are left-associative, while `^` is right-associative, with precedence order `^` > `*` > `+` > `-`. The lecture demonstrates how to traverse the tree in post-order to derive the final postfix string.

Chapters

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

    The instructor introduces the problem statement written on the whiteboard: convert the infix expression `a + b * c - d ^ e ^ f` to postfix. He lists the operator properties, noting that `+`, `-`, `*` are left-associative and `^` is right-associative. The precedence order is established as `^` (highest), `*`, `+`, `-` (lowest). He begins constructing the expression tree by identifying the operator with the lowest precedence, which is `-`. This splits the expression into a left sub-expression `a + b * c` and a right sub-expression `d ^ e ^ f`. He then recursively analyzes the left side, identifying `+` as the root for that section, separating `a` and `b * c`. The `b * c` part is resolved with `*` as the operator. Moving to the right side, he highlights the right associativity of `^`, explaining that `d ^ e ^ f` is grouped as `d ^ (e ^ f)`. This dictates that the first `^` is the root of the right subtree, with `d` as the left child and the second `^` as the right child.

  2. 2:00 – 3:12 02:00-03:12

    The instructor completes the expression tree diagram on the board. The root is `-`. The left child is `+`, with `a` as its left child and `*` as its right child (which has `b` and `c` as children). The right child of the root is the first `^`, with `d` as its left child and the second `^` as its right child (which has `e` and `f` as children). He then performs a post-order traversal (Left, Right, Root) to generate the postfix expression. For the left subtree, the traversal yields `abc*+`. For the right subtree, the traversal yields `def^^`. Combining these parts with the root operator `-`, the final postfix expression is `abc*+def^^-`. He compares this result with the multiple-choice options, identifying Option (A) `abc x + def ^ ^ -` as the correct answer. He explicitly points out that Option (B) would be correct if `^` were left-associative, reinforcing the importance of the associativity rule.

The video provides a clear, step-by-step method for converting infix expressions to postfix notation using expression trees. The key learning points are the hierarchy of operator precedence and the impact of associativity on tree structure. Specifically, the right associativity of the exponentiation operator `^` causes the rightmost operator to become a child of the leftmost operator of the same precedence, resulting in the postfix sequence `def^^` rather than `de^f^`. This systematic approach ensures accurate conversion for complex expressions involving mixed operators.

Loading lesson…