Practice Question (Gate 1991)
Duration: 2 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About the course: About the Course
- General Knowledge: Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, GK- Current Affairs, Indian Economy, Static General Knowledge, Environment, Evolution of Indian Banking (Banking & Financial Awareness)
- Mental Aptitude and Reasoning: Ratio and Proportion (Ratios), Data Interpretation, Permutation and Combination, Number System, 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), Vocabulary, Profit and Loss, Arithmetic, Mental Ability, Percentage, Algebra, Mensuration and Geometry, Age Problems, Clock, Calendar, Verbal Analogy (Word Based Analogy), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Analogy, Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Selection Decision Table (Decision Making), Cubes & Dices, Blood Relations, Venn Diagram, Logical Sequence Of Words, Inequality, Directions (Direction Test), Data Arrangement, Syllogisms, Seating Arrangements, Ranking, Order and Sequence, Time and Work, Ratio and Proportion, Averages, Mixtures and Alligation, Percentages, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Number System, Statistics, Three-Dimensional Patterns and Visualization, Permutations and Combinations, Alphabet and Word Tests, Sequences and Series, Simplification and Approximation, Mathematical Operations, Constraint Puzzles, Numerical Reasoning, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Cubes and Dice, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Profit, Loss and Discount, Mensuration, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Order, Ranking and Sequence, Trigonometry, Probability, Measurement and Quantity Take-Off, Clocks and Calendars, Articles and Determiners, Logical Deduction and Induction, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Modals, Conditionals and Subjunctive, Algebra, Vocabulary, Data Interpretation, Speed, Time and Distance, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Mixture and Alligation, HCF LCM, Combinatorics
- CS | Computer Fundamentals: Basics of COA, Number System, Number Representation, C Fundamentals, Algorithm Analysis, Input Output Organisation, Semiconductor Memories and Programmable Logic, Timing, Hazards and Testing, Processor Organization and Instructions, Memory Hierarchy and Input/Output, Number Systems and Codes, Combinational Logic Design, Combinational Logic Circuits, Number Systems and Codes
- CS | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, SQL
- CS | Workplace productivity Tools: MS Office Applications, Keyboard Shortcuts
- CS | Computer Networks: Introduction to CN, Data Communication, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, Application Layer, Hardware Basics, Network Security
- CS | The Internet: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Web Publishing & Hosting, Server Side & Security, Emerging Technologies
- CS | Emerging Technologies: Artificial Intelligence, Emerging Tech Trends, Introduction to OS, Windows OS, Linux OS, Unix OS, JavaScript-Basics, Internet of Things
- CS | Boolean algebra: Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Logic Gates & Hardware, 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, Semiconductor Memories and Programmable Logic Devices, Logic Families, Arithmetic Circuits, Waveform Generators and Timer Circuits, Minimization of Boolean Functions
- CS | Data Structures: Introduction to DS, Array, Stack, Queue
- CS | Cryptography: Society, Law & Ethics, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security
- UP Police Previous Year Papers:
- UP Police Full Mock Tests:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This short GATE 1991 practice question asks students to trace a stack operation sequence and identify the correct popped-value order. The on-screen prompt reads “Choose the correct alternatives (more than one may be correct) and write the corresponding letters only,” followed by the operation list: PUSH(10), PUSH(20), POP, PUSH(10), PUSH(20), POP, POP, POP, PUSH(20), POP. Four options are shown: a) 20,10,20,10,20; b) 20,20,10,10,20; c) 10,20,20,10,20; d) 20,20,10,20,10. The instructor solves it by drawing a vertical stack container and updating its state after each push or pop, recording the values removed. The traced popped sequence is 20, 20, 10, 10, 20, which matches option (b), marked with a green checkmark. The lesson emphasizes LIFO behavior: the most recently pushed item is popped first, and visualizing stack contents step by step prevents mismatches with the answer choices.
Chapters
0:00 – 1:47 00:00-01:47
The clip presents a GATE 1991 stack question with the on-screen instruction “Choose the correct alternatives (more than one may be correct)” and the operation sequence “PUSH(10), PUSH(20), POP, PUSH(10), PUSH(20), POP, POP, POP, PUSH(20), POP.” Options a–d list possible popped sequences. The instructor draws a vertical stack container, pushes 10 then 20, pops the top value 20, continues through the remaining operations, and writes the popped sequence “20 20 10 10” plus the final pop, matching option (b) “20,20,10,10,20,” which is checked in green.
The core concept is stack LIFO tracing. The method shown is to maintain a visible stack state, apply each operation in order, and record every POP result. The worked example starts with an empty stack: PUSH(10) gives [10]; PUSH(20) gives [10,20]; POP removes 20; PUSH(10) and PUSH(20) rebuild the top; subsequent POPs remove 20, then 10, then 10; finally PUSH(20) and POP remove 20. The resulting sequence is 20,20,10,10,20, so option (b) is correct. For exam revision, students should practice writing the stack after each step and comparing only POP outputs to the options.

