Gate 2001_
Duration: 2 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.
The video features an educational lecture solving a digital logic circuit problem from the GATE-2001 exam. The problem involves a circuit with two cascaded 2:1 Multiplexers (MUX). The instructor explains the boolean function of a MUX, given as $(ac' + bc)$, and systematically analyzes the circuit to find the final output function $f$. He breaks down the problem by calculating the intermediate output of the first MUX and then using that result to determine the final output of the second MUX, ultimately matching the derived expression to one of the multiple-choice options.
Chapters
0:00 – 1:46 00:00-01:46
The instructor begins by displaying the problem statement which asks to find the function $f$ for a circuit with two 2:1 MUXes. He writes the standard MUX equation $Y = S_0' I_0 + S_0 I_1$ on the board. He analyzes the first MUX where inputs are $a=1, b=0$ and select is $c=x_1$. He derives the intermediate output $q = x_1'$. Then he traces the connections for the second MUX: input 'a' is $q$ ($x_1'$), input 'b' is $x_1$, and select 'c' is $x_2$. He writes the final expression $f = \overline{x_2} \cdot \overline{x_1} + x_2 \cdot x_1$ on the board, identifying it as the XNOR operation. Finally, he points to option (C) $f = x_1 x_2 + x_1' x_2'$ as the correct answer.
The lecture demonstrates a step-by-step approach to simplifying digital logic circuits. By applying the fundamental boolean expression for a multiplexer, the instructor successfully decomposes the complex circuit into manageable parts. The key takeaway is the importance of carefully tracing signal paths, as the input 'b' of the second MUX is connected to the primary input $x_1$ rather than the output of the first MUX. This careful analysis leads to the correct identification of the XNOR function.

