Bandwidht Vs Throughput
Duration: 4 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About the Course: About the Course
- Section 1 | Language (Hindi): भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
- Section 1 | Language (उर्दू भाषा — 22 प्रश्न (निश्चित)): Spelling & Diacritics, Grammar (اسم, فعل, صفت, ضمیر), Vocabulary, Idioms & Proverbs, Comprehension
- Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): Bangla Script and Sounds, Bangla Grammar and Usage, Bangla Word Formation and Vocabulary, Reading and Text Interpretation
- Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Verb, Adverb, Preposition, Articles, Determiner, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Facts, Inference and Judgements
- Section 2 | Primary Maths & Reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Mensuration and Geometry, Age Problems, Arithmetic, Powers and Exponents (Surds and Indices), Algebra, Probability, Trigonometry, Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence
- Section 2 | General Awareness (GK + Current Affairs): Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, Indian Economy, Environment, GK- Current Affairs, Static General Knowledge
- Section 3 | Computer System and Org. (CSO): Basics of COA, Floating Point Rep, Cache Memory Organization, Instr Formats & Modes, Programming the Basic Computer, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design
- Section 3 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control
- Section 3 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Process Synchronization
- Section 3 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics
- Section 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Shortest Path Algos
- Section 3 | Theory Of Computation & Compiler Design: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
- Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): Artificial Intelligence, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications
- Section 3 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Maintenance and Configuration Management, Software Testing
- Section 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
- Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++, Java, HTML Basics, CSS
- Section 3 | Java: Java Fundamentals, Array, String, IO & References
- Section 3 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
- Section 3 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Section 3 | Multimedia: Multimedia
- BPSC Previous Year Papers:
- BPSC Full Mock Tests:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This educational video provides a clear comparison between bandwidth and throughput, two fundamental concepts in computer networking. The lecture begins by defining bandwidth as the maximum potential capacity of a link, which is a theoretical limit, and states its units are Hertz (Hz) for analog and bits per second (bps) for digital. A diagram illustrates bandwidth as a wide pipe. The video then transitions to define throughput as the actual amount of data successfully transmitted over a specific time, which is typically lower than bandwidth due to delays. The instructor presents the formula for throughput: (Number of Frames × Frame Size) / Total Time in Seconds. To demonstrate the calculation, a worked example is provided: with a bandwidth of 10 Mbps, 2000 frames, each 1000 bytes in size, and a total time of 60 seconds, the throughput is calculated to be 2 Mbps. The video concludes by emphasizing that throughput is the real-world performance, while bandwidth is the theoretical maximum.
Chapters
0:00 – 2:00 00:00-02:00
The video starts with a slide defining bandwidth. The on-screen text states: 'Definition: The maximum potential capacity of a link. It is the theoretical limit of how much data could be sent.' It also specifies the units: 'Unit: Hz (for analog) or bps (for digital).' A diagram on the slide visually represents bandwidth as a wide pipe, labeled 'Bandwidth', and contrasts it with a narrower pipe labeled 'Throughput'. The instructor explains that bandwidth is the theoretical maximum capacity of a link, which is a fixed value. He then writes '= 10 Mbps' on the whiteboard to provide a concrete example of a bandwidth value.
2:00 – 3:46 02:00-03:46
The video transitions to a new slide titled 'Throughput'. The definition provided is: 'The actual amount of data that is successfully transmitted at a specific time. Throughput is usually lower than bandwidth due to delay.' The instructor then writes the formula for throughput on the whiteboard: 'Throughput Formula = (Number of Frames × Frame Size) / Total Time in Seconds'. He proceeds to solve a numerical example, writing the values: 'BW = 10 Mbps', 'Number of Frames = 2000', 'Frame Size = 1000 bytes', and 'Total Time = 60 seconds'. He calculates the total data as 2,000,000 bytes and the throughput as 2 Mbps, demonstrating that the actual throughput is significantly less than the theoretical bandwidth.
The video effectively teaches the distinction between bandwidth and throughput by first establishing bandwidth as the theoretical maximum capacity of a network link, using a clear definition and a visual metaphor of a pipe. It then introduces throughput as the practical, real-world data transfer rate, which is always less than or equal to the bandwidth. The core of the lesson is the application of a formula to calculate throughput, which is demonstrated through a step-by-step numerical example. This progression from abstract definition to concrete calculation solidifies the understanding that bandwidth is a potential, while throughput is the actual performance.