Static and Dynamic Routing
Duration: 4 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- English Communication: Communication Assessment, English Writing Ability, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions)
- Artificial Intelligence (AI Literacy): AI & ML by Arun Sir
- Programming, Logic & Problem Solving (Technical Assessment): Language Design, Pseudo Codes
- DSA (Technical Assessment): Introduction to DS, Array, Stack, Queue, Linked List
- Software Engineering (Technical Assessment): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- OOPs (Technical Assessment): Object Oriented Programming (OOPS)
- DBMS (Technical Assessment): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Data Warehousing & Mining, NoSQL
- SQL (Technical Assessment): SQL
- Networking (Technical Assessment): Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security
- Modern Engg Awareness (Technical Assessment): Emerging Tech Trends, Cyber and Info Security
- Debugging Assessment: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java
- Cognitive Assessment: Gamified / Game Based Aptitude, Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Blood Relations, Directions (Direction Test), Coding Decoding, Series (Number and Letter Series) (Numerical Relations and Reasoning), Logical Sequence Of Words, Ranking, Order and Sequence, Data Sufficiency, Inequality, Venn Diagram, Syllogisms, Cubes & Dices, Calendar, Clock, Analytical Reasoning (Counting Figures Reasoning), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Selection Decision Table (Decision Making), Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
- HR Interview: MR & HR Interview Preparation
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This lecture introduces routing tables and distinguishes static from dynamic routing. The instructor defines a routing table as containing network information that helps decide which interface an incoming packet should be sent to in order to reach its destination. He emphasizes that a routing table can be either static or dynamic, underlining key phrases and sketching a simple table with rows and a dividing column to illustrate its structure. The lesson then defines static routing as using manual entries, noting the shortest distance from one router to another and concluding that static routing is not possible in certain contexts. Finally, the instructor introduces dynamic tables as those updated automatically, contrasting them with static entries.
Chapters
0:00 – 2:00 00:00-02:00
The instructor presents a slide titled ROUTING, stating that a routing table contains information about the network and helps decide to which interface an incoming packet should be sent in order to reach its destination. He underlines key phrases such as 'about the network' and 'packet should be sent inorder to reach destination,' then sketches a rectangle with horizontal rows and a dividing column to represent a routing table. He also underlines 'static' in the bullet stating that a routing table can be either static or dynamic, before switching to a slide defining static routing as manual entries.
2:00 – 4:10 02:00-04:10
The lecture continues with a slide defining static routing, underlining 'shortest distance from one router to another' and the term Static Routing. The slide lists bullets ending with 'Conclusion Static routing is not possible.' The instructor gestures while explaining, then transitions to a new slide stating that a dynamic table is one that is updated automatically. He points to this text with a pen, contrasting automatic updates in dynamic routing against the manual entries of static routing.
The core teaching progression moves from defining a routing table to distinguishing static and dynamic approaches. The instructor uses underlining and hand-drawn sketches to emphasize that routing tables store network information for interface selection. Static routing is characterized by manual entries and shortest-distance considerations, while dynamic routing involves automatic updates. The conclusion that static routing is not possible in certain scenarios highlights its limitations compared to dynamic methods.

