Basics of Unicast Routing Protocol

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/SSC-JE-IMD-SCIENTIFIC-ASSISTANT-COMPUTER-SCIENCE/computer-networks/net-layerrouting-protocol/routing-basics-flooding/asset-basics-of-unicast-routing-protocol after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. General Intelligence & Reasoning: Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Logical Sequence Of Words, Syllogisms, Venn Diagram, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Data Sufficiency, Puzzle Solving (Puzzles), Data Arrangement, Cubes & Dices, Calendar, Clock, Arithmetic, Number System, HCF LCM, Verbal Analogy (Word Based Analogy), Visual Recognition and Figure Completion, Paper Folding and Cutting, Transformation of Shapes, Clocks and Calendars, Direction Sense, Cubes and Dice, Patterns in Two-Dimensional Figures, Seating Arrangements, Analogy and Classification, Logical Deduction and Induction, Alphabet and Word Tests, Mathematical Operations, Series Completion, Simplification and Approximation, Coding and Decoding, Numerical Reasoning, Assembling and Grouping of Shapes, Three-Dimensional Patterns and Visualization, Vocabulary, Number System, Averages, Mixtures and Alligation, Simple and Compound Interest, Percentages, Algebra, Speed, Time and Distance, Seating and Arrangement Puzzles, Traverse Surveying, Order, Ranking and Sequence, Constraint Puzzles, Syllogisms and Venn Diagrams, Reading Comprehension, Critical Reasoning, Permutations and Combinations, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Ratio and Proportion, Time and Work, Mensuration, Data Interpretation, Powers, Surds and Logarithms, Sequences and Series, Articles and Determiners, Sentence Completion, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Mixture and Alligation, Sequence and Series (Series), Speed Time and Distance, Algebra, Profit and Loss, Powers and Exponents (Surds and Indices), Permutation and Combination
  2. General Awareness: Physics, Chemistry, Biology, History, Geography, Polity, Indian Economy, Environment, Static General Knowledge, GK- Current Affairs, Artificial Intelligence, MS Office Applications, Terms & Abbreviations, Keyboard Shortcuts, Evolution of Indian Banking (Banking & Financial Awareness), Emerging Tech Trends
  3. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus, Probability, Statistics, Signal Space and Optimum Detection, Probability, Statistics
  4. Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Number Systems and Codes, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, 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, Latches and Flip-Flops, Finite State Machines, Sequential Circuits and State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Latches and Flip-Flops, Number Systems and Codes, Registers and Counters
  5. Computer Organisation & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Register Transfer and Microoperations, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output, Registers and Counters
  6. 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, HTML Basics, OOPS with C++, Java, Object Oriented Technology
  7. Databases: 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, Database Security & Authorization
  8. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  9. 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, Complexity Theory
  10. 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. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Security, Windows OS, Distributed Systems, Unix OS, Linux OS
  12. 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, Data Communication, Website, Browser & Services, Web Design & Development, Network Security, Cyber Threats and Malware Attacks, Cyber Safety and Security
  13. Full Length Mock Tests:
  14. Sectional Tests:
  15. Paper 2 - Full-length Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The lecture introduces unicast routing protocols as mechanisms that enable dynamic routing tables by allowing routers to exchange information about network changes. The instructor presents a slide titled “UNICAST ROUTING PROTOCOLS” and explains that routing protocols are combinations of rules and procedures enabling routers to inform each other about changes in the internet or their neighborhood. A key example is given: information sharing allows a router in Delhi to know about the failure of a network in Singapore. The slide also notes that routing protocols include procedures for combining information received from other routers and may require a router to maintain several routing tables based on the required type of service. Hand-drawn sketches at the bottom of the slide illustrate simple topologies, including a node linked to “R,” a fan-out with labels like K1/K2 and the word “multi,” and a hub-and-spoke diagram with “S” at the center. Red underlines and circles emphasize key terms such as “demand,” “rules and procedures,” and the Delhi–Singapore example. The presentation remains on this single slide throughout the sampled windows, with the instructor elaborating on definitions and functions.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The slide titled “UNICAST ROUTING PROTOCOLS” appears with four bullet points on dynamic routing tables and information sharing. The instructor begins explaining that routing protocols have been created in response to the demand for dynamic routing tables, and that a routing protocol is a combination of rules and procedures that lets routers inform each other. Small red hand-drawn sketches appear at the bottom, showing a node linked to “R” and a fan-out labeled K1/K2 with the word “multi.”

  2. 2:00 – 5:00 02:00-05:00

    The instructor continues on the same slide, emphasizing that protocols allow routers to share what they know about the internet or their neighborhood. The bullet point “The sharing of information allows a router in Delhi to know about the failure of a network in Singapore” is underlined as a concrete example. A third sketch, a hub-and-spoke with “S” at the center, is added. The instructor also notes that protocols include procedures for combining information and that a router may have several routing tables based on the required type of service.

  3. 5:00 – 5:37 05:00-05:37

    The final sampled frames remain on the “UNICAST ROUTING PROTOCOLS” slide. The instructor gestures while discussing the combination of rules and procedures, with red annotations highlighting key terms such as “demand,” “rules and procedures,” and the geographic example. The slide’s bullet points on sharing information, combining received data, and multiple routing tables stay visible as the segment concludes.

The core teaching point is that unicast routing protocols provide the rules and procedures for dynamic routing tables, enabling routers to exchange neighborhood information so that failures or changes propagate across the network. The Delhi–Singapore example concretizes this by showing how one router can learn about a distant failure through information sharing. The instructor also distinguishes between the basic exchange of information and the additional procedures for combining that information, as well as the possibility of maintaining multiple routing tables depending on service requirements. The hand-drawn topology sketches support these ideas by illustrating simple connection patterns, including a hub-and-spoke arrangement. Because the evidence comes only from sampled screenshots without audio or transcript, the exact phrasing of spoken explanations is inferred from on-screen text and annotations; however, the slide content consistently centers on dynamic routing tables, information sharing, combination of received data, and multiple service-based routing tables.

Loading lesson…