Static and Dynamic Routing

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/computer-network-and-information-security/net-layerrouting-protocol/routing-basics-flooding/asset-static-and-dynamic-routing after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. 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, Complexity Theory
  13. 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
  14. Paper 2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock Tests:
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

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

Loading lesson…