Demo: Circuit Switching

Duration: 13 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/computer-networks-security/introduction-to-cn/switching-techniques/asset-demo-circuit-switching 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 circuit switching as a fundamental networking technique where a dedicated communication path is established between a source and destination before any data transmission occurs. The instructor begins by defining switching as the process of transferring data between sources and destinations via intermediate nodes, visually diagramming this with circles labeled 'S' for Source and 'D' for Destination. The core concept is that a dedicated path remains reserved until communication ends, ensuring all data travels through the same route without requiring further routing decisions. The lesson progresses to illustrate network topologies with multiple routers (R1 through R5), demonstrating how specific paths like S-R1-R2-R5-D are selected and reserved. The instructor then breaks down the process into three distinct phases: connection establishment, data transfer, and connection release. Finally, the lecture evaluates circuit switching within telephone networks by analyzing its advantages, such as guaranteed bandwidth and fixed delay, against disadvantages including setup delays, bandwidth wastage during idle periods, and vulnerability to link failures.

Chapters

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

    The instructor introduces the concept of switching as a process for transferring data between sources and destinations via intermediate nodes. He begins to visually diagram this concept by drawing circles to represent the source (S) and destination (D), illustrating the path data takes. On-screen text defines switching as establishing a dedicated communication path before transmission, emphasizing that the path remains reserved until communication ends. The instructor underlines key phrases like 'source to a destination' and draws the initial network diagram connecting S to D through intermediate routers (R1, R2), showing that no routing decisions are needed once the connection is set up.

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

    The instructor illustrates the concept of circuit switching by drawing a network topology with nodes labeled S, R1 through R5, and D. He writes out two distinct communication paths (S-R1-R2-R5-D and S-R1-R3-R5-D) to demonstrate how a dedicated path is established between source and destination. This visual aid supports the on-screen text explaining that once a connection is established, all data travels through the same dedicated path without further routing decisions. The instructor points to specific nodes in the network diagram to trace paths and highlights bandwidth (BW) reservations on links, reinforcing that a dedicated path is reserved for the entire duration of communication.

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

    The lesson transitions to defining the specific phases of circuit switching: connection establishment, data transfer, and connection release. The instructor points to 'Phase 1: Connection Establishment' bullet points on a new slide, explaining the initial setup required before data can flow. He continues to discuss how different paths can be established, such as S-R1-R2-R5-D or S-R1-R3-R5-D, emphasizing that a dedicated path is reserved for the entire duration of communication. The instructor points to network nodes R1, R2, R3 to illustrate potential routes from source S to destination D, highlighting that once a connection is established, all data travels through the same dedicated path without requiring further routing decisions.

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

    The instructor explains the advantages and disadvantages of circuit switching within a telephone network context. The slides detail specific benefits like guaranteed bandwidth, fixed delay after setup, and congestion-free communication with in-order delivery. Conversely, the disadvantages highlighted include connection setup delays, bandwidth wastage during idle periods where reserved bandwidth remains unused when no data is being transmitted, and the vulnerability of communication to link failures. The instructor points to 'Advantages' and 'Disadvantages' sections on the slide, explaining why circuit switching might be inefficient despite its reliability guarantees.

The lecture systematically builds an understanding of circuit switching by first defining the core mechanism: a dedicated path established before data transmission. The instructor uses visual diagrams of network topologies with labeled nodes (S, R1-R5, D) to concretize abstract concepts like path selection and reservation. Key evidence includes the explicit listing of two distinct paths (S-R1-R2-R5-D and S-R1-R3-R5-D) to show how specific routes are chosen. The teaching flow moves from definition to topology visualization, then to the procedural phases (establishment, transfer, release), and finally to a critical evaluation of pros and cons. The advantages section emphasizes reliability features like guaranteed bandwidth and fixed delay, while the disadvantages section highlights efficiency issues such as setup delays and idle bandwidth wastage. This progression ensures students grasp both the operational mechanics and the practical trade-offs of circuit switching in telephone networks.

Loading lesson…