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
- Quantitative Aptitude and Math: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Algebra, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Statistics, Probability, Percentage, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Average, Calculus, Trigonometry, Vectors, Linear Algebra
- Logical and Analytical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Verbal Analogy (Word Based Analogy), Directions (Direction Test), Blood Relations, Ranking, Order and Sequence, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Puzzle Solving (Puzzles), Cubes & Dices, Analytical Reasoning (Counting Figures Reasoning)
- English Language & Comprehension: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, Verb, Articles, Preposition, Pronoun, Conjunction, Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Cloze Test (Cloze Passage)
- Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
- Computer Networks: 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, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security, Cyber and Info Security
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- 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, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
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.

