Bandwidht Vs Throughput

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/AMCAT-PREPARATION/computer-networks/data-communication/signals-metrics/asset-bandwidht-vs-throughput after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Ability: Percentage, Profit and Loss, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Simple Interest and Compound Interest, Age Problems, Number System, Divisibility Rules, HCF LCM, Algebra, Permutation and Combination, Probability, Data Interpretation, Logarithm, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Speed Mathematics and Basic Mathematics
  2. Logical Reasoning: Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Data Sufficiency, Venn Diagram, Inequality, Series (Number and Letter Series) (Numerical Relations and Reasoning), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
  3. Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Subject Verb Agreement (Verb Noun Agreement), Tenses, Articles, Preposition, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Vocabulary, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Facts, Inference and Judgements
  4. Programming Fundamentals (Technical): C Fundamentals
  5. Data Structures (Technical): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms (Technical): Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
  7. OOPs (Technical): Object Oriented Programming (OOPS)
  8. DBMS (Technical): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  9. SQL (Technical): SQL
  10. Operating Systems (Technical): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  11. Computer Networks (Technical): 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 Security, Cloud Computing and IoT, Cyber and Info Security
  12. Software Engineering (Technical): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Coding/Automata Round: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir, Pseudo Codes
  14. Personality / Behavioral Assessment: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
  15. Writing Assessment: English Writing Ability
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

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

Loading lesson…