Router
Duration: 18 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
- Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
- Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
- Paper 1 | Unit Tests:
- Paper 1 | Full-Length Mock Tests:
- Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
- Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation 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 Timing, Hazards and Testing Logic Families Combinational Logic Design Arithmetic Circuits Semiconductor Memories and Programmable Logic Devices Combinational Logic Circuits Sequential Circuits and State Machines Latches and Flip-Flops Finite State Machines Minimization of Boolean Functions Arithmetic Circuits Registers and Counters Latches and Flip-Flops Number Systems and Codes
- Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
- Paper 2 | Programming and Data Structures: C Fundamentals Control Flow Functions Arrays & Pointers Storage Classes, Structures & Enums DMA, Macros, Scoping & File Handling Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing
- Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
- Paper 2 | 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
- Paper 2 | 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
- Paper 2 | Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management
- Paper 2 | 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 Database Recovery
- Paper 2 | Computer Networks: Introduction to CN DLL: Access Control DLL: Flow Control DLL: Error Control DLL: Framing 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
- Paper 2 | CS/IT Sectional Mock Tests:
- Complete Paper Full Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This lecture introduces routers as Layer 3 network devices that connect different networks and forward packets based on IP addresses. The instructor uses a slide showing three 192.168.x.0/24 networks attached to a router, an example routing table with directly connected routes and a default gateway, and a step-by-step explanation of how destination IP lookup determines the outgoing interface. The lesson then expands to core router functions: operating at OSI Layer 3, using IP addresses for forwarding decisions, maintaining routing tables, connecting two or more different networks, and linking LANs to WANs. A whiteboard diagram traces packet movement from source S to destination D through router R1, labeling Network Layer and Data Link Layer headers at each hop. The instructor emphasizes that each router interface belongs to a different network, that routers separate collision and broadcast domains, and that routers do not normally forward Layer-2 broadcasts such as ARP or DHCP Discover. The final section contrasts routers with bridges, noting that routers operate at Layer 3 while bridges operate at Layer 2.
Chapters
0:00 – 2:00 00:00-02:00
The opening slide defines a router as “a Network Layer (Layer 3) networking device that connects different networks and forwards packets based on IP addresses.” A diagram labeled “ROUTER CONNECTS MULTIPLE NETWORKS” shows a central router linked to Network 1 (192.168.1.0/24), Network 2 (192.168.2.0/24), and Network 3 (192.168.3.0/24), with interface addresses such as 192.168.1.1, 192.168.2.1, and 192.168.3.1. An example routing table lists Destination Network, Next Hop / Interface, and Outgoing Interface columns, including rows like 192.168.1.0/24 → Directly Connected → Interface 1 and 0.0.0.0 → Default Gateway → Interface 2.
2:00 – 5:00 02:00-05:00
The presenter gestures toward the same router slide, reinforcing that routers connect multiple networks and use IP addresses for routing decisions. The “KEY POINTS” box states that a router connects multiple networks, uses IP addresses to make routing decisions, and maintains a routing table for best path selection. The instructor points with a pen to the network diagram and routing table, explaining how a packet arriving at an interface is checked against destination entries to select the correct outgoing interface. A later slide begins listing numbered functions, including “OPERATES AT THE NETWORK LAYER (LAYER 3).”
5:00 – 10:00 05:00-10:00
The lecture moves to a numbered list of router functions. On-screen text includes “USES IP ADDRESS FOR FORWARDING DECISIONS,” “MAINTAINS A ROUTING TABLE,” “CONNECTS TWO OR MORE DIFFERENT NETWORKS,” and “CONNECTION LAN TO WAN.” The instructor points to an OSI model highlighting Layer 3, then draws a topology on the whiteboard with two hosts connected through router R1. The diagram labels Network Layer (NL) and Data Link Layer (DLL) headers at the source, router, and destination, showing how encapsulation changes as the packet crosses network segments.
10:00 – 15:00 10:00-15:00
The whiteboard diagram expands with nodes S and D, router R1, and handwritten notes such as “Ethernet” under S, “Wi-Fi” near D, and an oval reading “DNL 4 Times” and “ML 3 Times.” The “KEY POINTS SUMMARY” panel lists bullets including “Operates at the Network Layer (Layer 3)” and “Does not forward Layer-2 broadcasts.” The slide scrolls to numbered topics, including “5 CONNECTS LAN TO WAN” showing 192.168.1.0/24 and “7 EACH INTERFACE BELONGS TO A DIFFERENT NETWORK” with 192.168.1.1/24, 192.168.2.1/24, and 10.0.0.1/24.
15:00 – 17:43 15:00-17:43
The final section summarizes that a router “CAN CONNECT NETWORKS USING DIFFERENT LINK-LAYER TECHNOLOGIES,” that each interface belongs to a different network, and that routers separate collision and broadcast domains. A topic titled “A ROUTER DOES NOT NORMALLY FORWARD LAYER-2 BROADCASTS” shows Network A (ARP Broadcast) and Network B (DHCP Broadcast) separated by a red X. The lesson concludes with a “ROUTER vs BRIDGE” comparison table contrasting Layer 3 (Network Layer) operation for routers with Layer 2 (Data Link Layer) operation for bridges.
The lecture builds a coherent picture of router behavior from definition to practical implications. It starts with the formal definition: routers are Layer 3 devices that connect different networks and forward packets using destination IP addresses. The routing table example makes this concrete: directly connected subnets map to specific interfaces, while 0.0.0.0 provides a default path. The whiteboard encapsulation diagram then shows the operational consequence—each hop requires new Data Link Layer framing while the Network Layer packet remains intact. The numbered function list ties these ideas together: IP-based forwarding, routing table maintenance, multi-network connectivity, and LAN-to-WAN bridging. The broadcast-domain point is especially important for exams: because each interface belongs to a separate network, routers block Layer-2 broadcasts like ARP and DHCP Discover. The final router-versus-bridge table reinforces the central distinction: routers make decisions at Layer 3 using IP, whereas bridges operate at Layer 2.

