ISRO-DS-2016
Duration: 4 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
- 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
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Computer Architecture: Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
- C Language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Computer Networks: 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
- 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
- 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
- Engineering Mathematics: Permutation and Combination, Linear Algebra, Calculus, Probability, Statistics, Signal Space and Optimum Detection, Probability, Statistics, Combinatorics
- General Aptitude: Ratio and Proportion (Ratios), Data Interpretation, Logarithm, Number System, HCF LCM, 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), Percentage, Mensuration and Geometry, Mental Ability, Arithmetic, Profit and Loss, Powers and Exponents (Surds and Indices), Average, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Syllogisms, Venn Diagram, Seating Arrangements, Blood Relations, Directions (Direction Test), Analogy, Algebra, Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Cubes & Dices, Ranking, Order and Sequence, Mixture and Alligation, Age Problems, Clock, Selection Decision Table (Decision Making), Data Arrangement, Ratio and Proportion, Vocabulary, Averages, Mixtures and Alligation, Percentages, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Statistics, Three-Dimensional Patterns and Visualization, Permutations and Combinations, Trigonometry, Simplification and Approximation, Constraint Puzzles, Numerical Reasoning, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Direction Sense, Assembling and Grouping of Shapes, Cubes and Dice, Profit, Loss and Discount, Mensuration, Probability, Measurement and Quantity Take-Off, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Order, Ranking and Sequence, Logical Deduction and Induction, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Clocks and Calendars, Time and Work, Algebra, Data Interpretation, Speed, Time and Distance, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Calendar, Alphabet and Word Tests, Sequences and Series, Powers, Surds and Logarithms, Number System, Transformation of Shapes
- English (Verbal Aptitude): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Preposition, Direct and Indirect Speech, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Correction (Error Correction), Verbal Analogy (Word Based Analogy), Conjunction, Verb, Articles, Adverb, Modals, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Articles and Determiners, Adjectives and Adverbs, Modals, Conditionals and Subjunctive, Voice and Reported Speech, Blood Relations, Tenses, Vocabulary
- Live Classes Recordings(Earlier Batch): GATE 2026 Live Class
- Full Mock Test:
- Previous Year Papers:
- GATE 2026 Counselling: Counselling and Guidance Sessions
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This educational video segment addresses a Data Structure problem from the ISRO-2016 examination, focusing on postfix expression evaluation using a stack. The core task involves determining the top two elements of the stack after evaluating the first multiplication operator in a specific expression. The problem statement is presented clearly on screen, defining the input as '823 ^ / 23 * + 51 * -' with single-digit operands. The notation '^' is explicitly identified as the exponentiation operator, distinguishing it from standard arithmetic operations. The multiple-choice options provided are (A) 6,1; (B) 5,7; (C) 3,2; and (D) 1,5. The instructional approach demonstrates the step-by-step application of stack operations to solve this computational problem.
Chapters
0:00 – 2:00 00:00-02:00
The video introduces a Data Structure problem from the ISRO-2016 exam regarding postfix expression evaluation. The on-screen text displays the question: 'The following postfix expression with single digit operands is evaluated using a stack: 823 ^ / 23 * + 51 * -'. A note clarifies that '^' represents exponentiation. The specific query asks for the top two elements of the stack after the first '*' operator is evaluated. Multiple-choice options (A) 6,1; (B) 5,7; (C) 3,2; and (D) 1,5 are listed. The instructor begins by initializing the stack with operands from the expression, pushing 8, then 2, and finally 3 onto the stack structure. The first operator encountered is '^', which triggers an operation on the top two elements, 2 and 3. The visual evidence shows the stack diagram being populated with these initial values before any arithmetic reduction occurs.
2:00 – 3:49 02:00-03:49
The instructor proceeds to solve the postfix expression problem by demonstrating stack operations. The visual content shows the evaluation of '823 ^ / 23 * + 51 * -'. After processing the initial operands and the exponentiation operator '^', the stack state is updated. The instructor highlights the progression towards evaluating the first multiplication operator '*'. Handwritten notes appear on screen, including '2*3', indicating a calculation step. The instructor analyzes the stack state to identify the top two elements required by the question. Option (A) 6,1 is selected as the correct answer based on the intermediate stack configuration. The teaching cues emphasize understanding operator precedence and associativity in postfix notation, specifically how operands are pushed and popped during evaluation. The final visual evidence confirms the selection of option (A) 6,1 as the solution to the ISRO-2016 problem.
The video provides a focused tutorial on applying stack data structures to evaluate postfix expressions, a common topic in computer science examinations. The problem presented requires careful tracking of stack states as operators are encountered sequentially. Key concepts include the distinction between prefix, infix, and postfix notations, though the focus remains strictly on postfix. The exponentiation operator '^' is treated as a standard binary operator requiring two operands from the stack top. The solution process involves pushing single-digit integers onto the stack and performing arithmetic operations when operators appear. The specific question targets an intermediate state rather than the final result, testing the student's ability to trace execution flow. The correct answer (A) 6,1 is derived from the specific sequence of operations defined by the expression '823 ^ / 23 * + 51 * -'. This example serves as a practical application of stack theory, reinforcing the Last-In-First-Out (LIFO) principle essential for expression evaluation algorithms.

