Router

Duration: 18 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/computer-networks-security/hardware-basics/router-gateway/asset-router after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper-2 | Programming & 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
  3. Paper-2 | Databases / DBMS & SQL: 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: Introduction to CN, Data Communication, 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, Network Access Technologies, Network Security
  6. Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, 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, Waveform Generators and Timer 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
  7. 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
  8. Paper-2 | Theory of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  10. 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
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning), Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Data Sufficiency, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Statistics, Algebra, Geometry, Permutations and Combinations, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Constraint Puzzles, Clocks and Calendars, Traverse Surveying, Simplification and Approximation, Blood Relations, Data Interpretation, Venn Diagram
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra, Ratio and Proportion, Subject-Verb Agreement, Sentence Completion, Powers, Surds and Logarithms, Data Interpretation, Sequences and Series, Trigonometry, Mensuration, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Time and Work, Probability, Algebra, Speed, Time and Distance, Statistics, Sequence and Series (Series), Combinatorics
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Structure and Correction, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Sentence Basics, Nouns and Pronouns, Voice and Reported Speech, Articles and Determiners, Vocabulary
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India 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

  1. 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. 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).”

  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.

  4. 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.

  5. 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.

Loading lesson…