Practice Question (Gate 1998)

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/ASRB-ICAR-T3-T4-INFORMATION-TECHNOLOGY-PRELIMS-MAINS/data-structures/stack/infix-postfix-prefix/asset-practice-question-gate-1998 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Prelims: General Knowledge: Physics Chemistry Biology History Geography Polity Indian Economy Static General Knowledge GK- Current Affairs Environment
  2. Prelims: General English: Vocabulary Noun Pronoun Adjectives Preposition Articles Direct and Indirect Speech Tenses Conjunction Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Sentence Correction (Error Correction) Sentence Completion (Fill in the blanks) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Cloze Test (Cloze Passage) Verbal Analogy (Word Based Analogy) Sentence Construction Adverb Verb
  3. Prelims: Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) HCF LCM Divisibility Rules Average Sequence and Series (Series) Number System Powers and Exponents (Surds and Indices) Algebra Profit and Loss Simple Interest and Compound Interest Time and Work Pipe and Cistern Speed Time and Distance Mixture and Alligation Mensuration and Geometry Age Problems Partnership Statistics Data Interpretation Arithmetic
  4. Prelims: General Agriculture: Agriculture in India and Tripura Natural Resource Management Fundamentals of Crop Production Horticulture Crop Improvement Crop Protection Social Science
  5. IT Mains: Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management Distributed Systems
  6. IT Mains: Computer Networking: Introduction to CN DLL: Access Control DLL: Flow Control DLL: Error Control 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
  7. IT Mains: DBMS: Basics of DBMS ER Diagram Relational Model & Functional Dependencies Keys & Integrity Constraints Normalization (1NF - BCNF) Decomposition Properties & 4NF Relational Algebra SQL Relational Calculus Transaction Management Concurrency Control Database Recovery Big Data Systems Database Security & Authorization Enhanced Data Models NoSQL
  8. IT Mains: Software Engineering: Fundamentals of Software Engineering Software Requirements and Quality Assurance Software Design, Estimation and Metrics Software Testing Software Maintenance and Configuration Management
  9. IT Mains: Data Structures & Algorithms: Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing Algorithm Analysis Time Complexity Analysis Sorting Algorithms
  10. IT Mains: OOPS with C++ & Java: C Fundamentals OOPS with C++ Java Fundamentals Array, String, IO & References OOPS with Java Generic & Collections Multithreading File Handling & I/O
  11. IT Mains: Python: Introduction to Python Tokens, Variables, Data Types, I/O Operators & Expressions Control Flow & Looping Collections & Strings Functions & Modules
  12. IT Mains: Website Development: Website, Browser & Services Internet Fundamentals Web Design & Development Protocols & Services Web Publishing & Hosting Server Side & Security Emerging Technologies HTML Basics HTML5 CSS JavaScript-Basics .Net Programming PHP
  13. IT Mains: Mobile App Development: Mobile Computing Multimedia
  14. IT Mains: Linux / Windows Server Admin: Unix OS Linux OS
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This short GATE 1998 clip teaches how to convert the infix expression 3 * log(x + 1) - a/2 into postfix notation by building an expression tree and performing a post-order traversal. The instructor first draws the subtree for log(x+1), placing 'log' as a node with '+' below it and 'x' and '1' as leaves. Then the '*' operator is added above, with '3' on the left and the log subtree on the right. Finally, '-' becomes the root, with '*' as its left child and a/2 as its right subtree. The postfix result is obtained by visiting leaves before operators, yielding 3 x 1 + log * a 2 / -. The on-screen text shows the question, the original expression, and handwritten postfix strings, including both a correct traversal and an alternative notation.

Chapters

  1. 0:00 – 1:45 00:00-01:45

    The slide displays the GATE 1998 question 'Compute the postfix equivalent of the following expression' with the formula 3 * log(x + 1) - a/2. The instructor constructs an expression tree: first the 'log' node with '+' child and leaves x and 1, then a '*' node above it with left leaf 3, and finally the '-' root connecting '*' to the a/2 subtree. The postfix traversal is written on screen as 3 x 1 + log * a 2 / -, with an alternative string - * 3 log + x 1 / a 2 also visible.

The central method is infix-to-postfix conversion via expression trees. Operators become internal nodes and operands become leaves; precedence and parentheses determine the tree shape. Postfix notation is read by post-order traversal: left subtree, right subtree, then root. For 3 * log(x + 1) - a/2, the tree has '-' at the root because subtraction is lowest precedence. Its left child is '*', whose children are 3 and log; log's child is '+', with leaves x and 1. The right child of '-' is '/', with leaves a and 2. Traversing gives 3 x 1 + log * a 2 / -. The clip also shows an alternative prefix-like string, but the standard postfix answer is the post-order sequence.

Loading lesson…