Gate 2007_
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 by Sanchit Jain Sir from Knowledge Gate, analyzing a 'Match the following' question from the GATE-2007 exam. The problem requires matching specific network protocols—SMTP, BGP, TCP, and PPP—with their corresponding layers in the OSI model. The instructor begins by addressing the first protocol, SMTP, drawing a blue arrow from it to the 'Application layer' (1). Next, he analyzes BGP, connecting it to the 'Network layer' (4) with another arrow. He proceeds to TCP, identifying it as a 'Transport layer' protocol (2) and drawing the corresponding line. For the final protocol, PPP, the instructor pauses to provide additional context. He switches to a slide titled 'Maximum Transfer Unit (MTU),' which displays a table of protocols and their MTU values. He specifically circles 'PPP' and its MTU value of '296' to demonstrate that it operates at the Data link layer (3). The slide lists protocols like Hyperchannel, Token Ring, FDDI, Ethernet, X.25, and PPP with their respective MTU values ranging from 296 to 65,535. The instructor emphasizes that MTU is a feature of link-layer protocols and explains that when a datagram is encapsulated in a frame, the total size must be less than this maximum size. The slide also includes a diagram showing the encapsulation of an IP datagram into a frame payload, illustrating the relationship between the header, frame payload, and trailer. Throughout the explanation, he reviews the multiple-choice options provided below the table: (A) P-2 Q-1 R-3 S-5, (B) P-1 Q-4 R-2 S-3, (C) P-1 Q-4 R-2 S-5, and (D) P-2 Q-4 R-1 S-3. The options are listed vertically on the left side of the screen in red text. He systematically eliminates incorrect pairings, such as matching SMTP with the Transport layer or PPP with the Physical layer. The visual evidence, including the drawn arrows and the circled MTU table, clearly supports the matching sequence P-1, Q-4, R-2, S-3. Although the instructor circles option (D) at the very end, the logical derivation and arrows point towards option (B) as the correct answer. The lecture effectively uses visual aids like arrows and tables to reinforce the theoretical classification of these protocols.
Chapters
0:00 – 1:47 00:00-01:47
The video presents a GATE-2007 question matching protocols (SMTP, BGP, TCP, PPP) to OSI layers. The instructor draws arrows: SMTP to Application (1), BGP to Network (4), TCP to Transport (2). He then shows an MTU slide, circling PPP and 296 to confirm it is Data Link (3). He reviews options (A) through (D) and eliminates incorrect matches, concluding that P-1, Q-4, R-2, S-3 is the correct sequence, corresponding to option (B).
The lecture demonstrates a systematic approach to solving network protocol classification problems by using visual aids like arrows and reference tables. By analyzing specific protocols like SMTP and TCP, and using the concept of MTU for PPP, the instructor reinforces the theoretical layers of the OSI model. The process highlights the importance of understanding protocol functions to correctly identify their layer placement in network architecture.

