Bridge

Duration: 14 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/computer-networks-security/hardware-basics/repeater-hub-bridge-switch/asset-bridge 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 network bridges as Data Link Layer (Layer 2) devices that connect two or more LAN segments and control frame flow. The instructor presents a slide titled “Bridge” defining the device, then walks through its operation using a five-step process: frame received, MAC address check, MAC table lookup, filtering & forwarding, and delivery. A central diagram shows two LAN segments (each with three PCs) connected by a bridge with Port 1 and Port 2. The lesson emphasizes that bridges separate collision domains but do not divide broadcast domains, connect same-type LAN segments, and use MAC addresses for forwarding/filtering decisions. A dynamic MAC address table inside the bridge is shown with columns for MAC address, port, age, and type; example entries include AA-AA-AA-AA-01 on Port 1 with age 120 and type DYNAMIC. The instructor uses annotations, gestures, and a marker to highlight key concepts such as MAC table learning and frame forwarding logic.

Chapters

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

    The lecture opens with a slide titled “Bridge,” defining it as a Data Link Layer (Layer 2) networking device used to connect two or more LAN segments and control the flow of frames between them. A diagram shows “LAN SEGMENT - 1” and “LAN SEGMENT - 2,” each containing three PC icons with MAC addresses, linked by a central “BRIDGE” labeled with “PORT 1” and “PORT 2.” A “HOW BRIDGE WORKS” strip lists five numbered steps: “1 FRAME RECEIVED,” “2 MAC ADDRESS CHECK,” “3 MAC TABLE LOOKUP,” “4 FILTERING & FORWARDING,” and “5 DELIVERY.” The presenter, wearing a black shirt and headset, initially covers the center diagram before turning to face the viewer and gesturing toward the right side of the slide, highlighting LAN Segment 1 and then extending toward LAN Segment 2 as the explanation progresses.

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

    The instructor elaborates on the bridge’s internal operation, pointing to the “LAN SEGMENT - 1” diagram and writing on a virtual whiteboard near the “Frame Received” step. The slide now includes a “MAC ADDRESS TABLE (Inside Bridge)” with columns for MAC ADDRESS, PORT, AGE, and TYPE. Example rows show entries such as AA-AA-AA-AA-01 on PORT 1 with AGE 120 and TYPE DYNAMIC. The port value “2” on the BB-BB rows is circled in purple to illustrate how the bridge maps MAC addresses to ports. The “HOW BRIDGE WORKS” strip remains visible, reinforcing the sequence from frame reception to delivery. The instructor uses these visual cues to explain how frames are filtered and forwarded based on destination MAC addresses.

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

    The lesson transitions to a summary slide with bullet points and four diagram panels. The left column states: “Bridge operates at the Data Link Layer,” “It uses MAC addresses to make forwarding/filtering decisions,” “It maintains a MAC address table to identify the destination segment,” and “A bridge does not divide the broadcast domain.” Four colored panels illustrate key functions: green “SEPARATES COLLISION DOMAINS,” blue “DOES NOT DIVIDE BROADCAST DOMAIN,” red “CONNECTS SAME TYPE OF LAN SEGMENTS,” and purple “FILTERING & FORWARDING.” The instructor points to the “Separates Collision Domains” diagram to emphasize how a bridge reduces collision traffic and gestures toward the “How Bridge Works” flowchart to explain step-by-step frame forwarding. The MAC address table is again displayed, listing dynamic entries with ports and ages.

  4. 10:00 – 13:35 10:00-13:35

    The presenter shifts from the left side of the frame to the right, at one point writing pink handwritten annotations on the slide with a marker. The “Bridge” slide reiterates its definition as a Layer 2 device connecting LAN segments and controlling frame flow. The diagram of “LAN SEGMENT - 1” and “LAN SEGMENT - 2” linked by a bridge with PORT 1 and PORT 2 is shown above numbered steps: “FRAME RECEIVED,” “MAC ADDRESS CHECK,” “FILTERING & FORWARDING,” and “DELIVERY.” A lower table headed “MAC ADDRESS TABLE - (Inside Bridge)” displays columns MAC ADDRESS, PORT, AGE, and TYPE with rows labeled DYNAMIC. By 810s, the instructor faces the camera directly, concluding the segment with a clear view of the bullet points and four diagram panels summarizing bridge behavior.

The lecture systematically builds understanding of network bridges by first defining them as Layer 2 devices that connect LAN segments and control frame flow. The instructor uses a consistent visual framework: a two-segment diagram with a central bridge, a five-step operational flowchart, and a dynamic MAC address table. Key concepts emphasized include the bridge’s role in separating collision domains while not dividing broadcast domains, its reliance on MAC addresses for forwarding/filtering decisions, and its maintenance of a learning table that maps MAC addresses to ports with aging. The progression moves from definition and diagram to detailed step-by-step operation, then to a summary slide with bullet points and four illustrative panels. The instructor’s use of gestures, annotations, and highlighting (e.g., circling port values in the MAC table) reinforces how frames are processed from reception to delivery. The lesson concludes by consolidating these ideas into a clear, exam-ready overview of bridge functionality and limitations.

Loading lesson…