Demo: Circuit Switching

Duration: 13 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-STET-COMPUTER-SCIENCE-COMPLETE-COURSE/unit-7-computer-networks/introduction-to-cn/switching-techniques/asset-demo-circuit-switching after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the course: About the Course
  2. Mathematical Aptitude: संख्या पद्धति / Number System, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, Divisibility Rules, प्रतिशत / Percentage, अनुपात और समानुपात / Ratio and Proportion, औसत / Average, लाभ, हानि और बट्टा / Profit, Loss and Discount, समय और कार्य / Time and Work, घन क्षेत्रमिति / Solid Mensuration, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, समय, चाल और दूरी / Time, Speed and Distance, Age Problems, मिश्रण और एलिगेशन / Mixture and Alligation, Algebra, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, Pipe and Cistern, Trigonometry, Statistics, आँकड़ा निर्वचन / Data Interpretation, Arithmetic, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers
  3. Logical Reasoning: श्रेणी / Series, कूट लेखन एवं कूट वाचन / Coding-Decoding, सादृश्यता एवं वर्गीकरण / Analogy and Classification, रक्त संबंध / Blood Relations, दिशा एवं दूरी / Direction and Distance, क्रम एवं रैंकिंग / Order and Ranking, अशाब्दिक तर्क / Non-Verbal Reasoning, बैठक व्यवस्था एवं पहेलियाँ / Seating Arrangement and Puzzles, Syllogisms, वेन आरेख, न्याय वाक्य एवं असमानता / Venn Diagrams, Syllogism and Inequalities, गणितीय संक्रियाएँ एवं लुप्त संख्या / Mathematical Operations and Missing Numbers, वर्णमाला एवं संख्या परीक्षण / Alphabet and Number Test, कथन आधारित तार्किक विवेचन / Statement-Based Reasoning, Analytical Reasoning (Counting Figures Reasoning), घन, पासा एवं आकृतियों की गिनती / Cubes, Dice and Figure Counting, कैलेंडर एवं घड़ी / Calendar and Clock, Clock
  4. General Knowledge: वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research, Chemistry, Biology, History, Geography, Polity, Indian Economy, समसामयिकी / Current Affairs, Static General Knowledge
  5. Art of Teaching: शिक्षण-अधिगम प्रक्रिया एवं कक्षा प्रबंधन / Teaching-Learning Process and Classroom Management, Learners & Learning Process, Factors Affecting Teaching, शिक्षण विधियाँ एवं उपागम / Teaching Methods and Approaches, सूक्ष्म शिक्षण एवं कक्षा संप्रेषण / Microteaching and Classroom Communication, शिक्षण सहायक सामग्री एवं शैक्षिक तकनीकी / Teaching Aids and Educational Technology, आकलन एवं मूल्यांकन / Assessment and Evaluation, शिक्षक: गुण, व्यावसायिक नैतिकता एवं विकास / Teacher: Qualities, Professional Ethics and Development, शैक्षिक नीतियाँ, अधिनियम एवं प्रशासन / Educational Policies, Acts and Administration, पाठ्यचर्या, कला एवं सह-शैक्षिक क्षेत्र / Curriculum, Arts and Co-curricular Areas, निर्देशन एवं परामर्श / Guidance and Counselling, दिव्यांग बच्चों की शिक्षा / Education of Children with Disabilities, Micro-Teaching & Teaching Skills, पाठ योजना / Lesson Planning
  6. Environmental Science: Environment
  7. Unit 1 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  8. Unit 2 | COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer
  9. Unit 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  10. Unit 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  11. Unit 4 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  12. Unit 5 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  13. Unit 6 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Transaction Management, Concurrency Control
  14. Unit 7 | 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, Transport Layer Services, TL: Congestion & UDP, Application Layer
  15. Unit 8 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  16. Unit 9 | Object Oriented Programming: OOPS with C++
  17. Unit 10 | Web Development: HTML Basics, CSS, JavaScript-Basics, XML, Node.js
  18. Unit 11 | 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
  19. Unit 12 | IoT: Emerging Tech Trends, Cloud Computing, कंप्यूटर नेटवर्क / Computer Networks
  20. Unit 13 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
  21. Unit 14 | E-Commerce: Electronic Data Interchange and E-Commerce, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Physical Security and Cryptography Basics, Cyber Safety and Security
  22. Unit 15 | Multimedia: Multimedia
  23. Unit 16 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
  24. Full Length Mock Tests — General Paper:
  25. Full Length Mock Tests — Computer Science (Paper II):
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…