Practice Question (Throughput)

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/DSSSB-TGT-COMPUTER-SCIENCE-COMPLETE-COURSE/computer-network/dll-access-control/aloha-protocols/asset-practice-question-throughput after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Section A: General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, History, Geography, Indian Economy, GK- Current Affairs, Evolution of Indian Banking (Banking & Financial Awareness), Environment
  3. Section A: General Intelligence & Reasoning ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analytical Reasoning (Counting Figures Reasoning), Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Directions (Direction Test), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Crypt Arithmetic, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability
  4. Section A: Arithmetical & Numerical Ability: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Powers and Exponents (Surds and Indices), Algebra, Probability, Mental Ability, Age Problems, Partnership, Statistics, Arithmetic, Speed Mathematics and Basic Mathematics, Miscellaneous
  5. Section A: English Language & Comprehension: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Articles, Sentence Construction, Preposition, Direct and Indirect Speech, Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Modals, Active Passive Voice (Voice), Sentence Correction (Error Correction), Adverb, Conjunction, Cloze Test (Cloze Passage)
  6. Section A: Hindi Language & Comprehension: भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  7. Section B: Programming, Data Structures, OOP & Java: 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, Java, OOPS with C++, Language Design, Intro to Compilers, Visual Basics, Syntax Analysis: Bottom-Up, Object Oriented Technology
  8. Section B: Computer Networks, TCP/IP & Network Security: Introduction to CN, Data Communication, DLL: Flow Control, DLL: Access 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, Network Access Technologies, Network Security, Society, Law & Ethics, Mobile Computing, Net Layer:Routing Protocol, Cyber Safety and Security
  9. Section B: Teaching Methodology: Child Development, Concept of Pedagogy, Theories, Inclusive Education, Experiential Pedagogy, Assessment & Evaluation, Curriculum Framework & Reforms, National Education Policy (NEP) 2020, Psychology, Teaching-Learning Process, Personality Development, Teaching Methods & Strategies, Learning and Motivation, Learners & Learning Process, Factors Affecting Teaching, Methods of Teaching, Nature, Objectives & Characteristics of Teaching, Teaching-Learning Aids & ICT Integration, Classroom Management & Communication, Evaluation, Assessment & Measurement, Curriculum & School Environment, Inclusive Education & Special Needs, Professional Development & Ethics
  10. Section B: Digital Electronics / Boolean Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
  11. Section B: Operating Systems & Linux: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, File Management, Disc Scheduling, Unix OS, Linux OS, Distributed Systems, Windows OS
  12. Section B: Data Base Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, File Organization & Indexing, Transaction Management, Concurrency Control, Database Security & Authorization, Database Recovery, Data Warehousing & Mining
  13. Section B: Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, HTML Basics, CSS, Emerging Technologies, JavaScript-Basics, .Net Programming, Electronic Data Interchange and E-Commerce, XML
  14. Section B: Computer Fundamentals, IT Basics & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer, Terms & Abbreviations, MS Office Applications, Instr Formats & Modes, Floating Point Rep
  15. Section B: Python Language: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  16. Section B: Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, extras, Fundamentals of Systems and Information Systems
  17. Section B: Design & Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  18. Section B: Mathematics: Linear Algebra, Calculus, Trigonometry, Vectors, Set Theory, Functions, Relations, Propositional and Predicate Logic, Research Process Steps, Graph Theory
  19. Section B: Computer Graphics, Multimedia & Mobile Computing: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing, Multimedia
  20. Section B: Emerging Trends: Emerging Tech Trends, Knowledge Representation, Natural Language Processing
  21. DSSSB Previous Year Paper:
  22. Business Studies and Management: Business Communication, Business Organization and Management, Financial Accounting, Business Economics, Management Information System (MIS), Knowledge Management & New Economy
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture reviews pure ALOHA throughput calculations, beginning with a GATE-2021 practice question (Q.22) and then working through textbook Examples 12.2 and 12.3 to establish the method before returning to solve Q.22. The instructor emphasizes identifying frame size, channel rate, and offered load G, computing transmission time Tf = L/B, then applying S = G e^{-2G}. For Example 12.3, a 200-bit frame on a 200 kbps channel gives Tf = 1 ms; at 1000 frames/s, G = 1 and S ≈ 0.135 (13.5%). The maximum pure ALOHA throughput is Smax = 1/(2e) ≈ 0.184 (18.4%) at G = 1/2. Finally, for Q.22 with a 1000-bit frame on a 1 Mbps channel and 1000 frames/s, Tf = 1 ms, G = 1, so S ≈ 13.5%.

Chapters

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

    The video opens on slide Q.22, a GATE-2021 pure ALOHA throughput problem: 1,000-bit frames on a 1 Mbps (≈10^6 bps) channel with transmissions following a Poisson process at 1,000 frames/s. The instructor then shifts to Example 12.2, circling the given values '200-bit frames' and '200 kbps', underlining 'average number of frames generated by the system', and writing G= in the corner. The core formula S = G x e^-2G is underlined, and the maximum throughput result Smax = 1/(2e) = 0.184 when G = 1/2 is highlighted as the key pure ALOHA result.

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

    The instructor works the throughput calculation using S = G * e^(-2G), circling the formula and the 18.4 percent maximum value. Handwritten annotations on the right introduce G1, G2 and a total G to break down frame generation rates (e.g., G1 = 2, then G1 = 1 and G2 = 1/2), with a note '1000 -> 184' linking frame rate to throughput. The lesson moves to Example 12.3: a pure ALOHA network transmitting 200-bit frames on a shared channel of 200 kbps. The frame transmission time is computed as 200/200 kbps = 1 ms and circled. For a system creating 1000 frames per second (1 frame per millisecond), G = 1, so S = G * e^-2G = 0.135 (13.5 percent) for case a, while the maximum throughput 0.184 (18.4 percent) is circled for case b.

  3. 5:00 – 6:15 05:00-06:15

    The video returns to the GATE-2021 problem Q.22, with red underlines highlighting '1,000 bits', '1 Mbps (≈ 10^6 bits per second)', and '1,000 frames per second'. Red handwritten work below the text shows Tf = L/B = 1000 x 1000 ns / 10^6, with the result '1ms' circled and an added '= 1'. The instructor then writes the throughput formula S = G x e^-2G, substitutes to get 1 x e^-2, and concludes with '= 13.5%', applying the same method demonstrated in Example 12.3 to solve the practice question.

The lecture teaches a consistent three-step method for pure ALOHA throughput problems. First, extract the frame length L and channel rate B to find transmission time Tf = L/B (in seconds). Second, determine the offered load G from the frame generation rate: if frames are created at a rate such that one frame is generated every Tf, then G = 1; more generally G equals the average number of frames generated per frame transmission time. Third, apply S = G e^{-2G} to find throughput as a fraction of channel capacity. The instructor repeatedly circles the formula and the maximum value Smax = 1/(2e) ≈ 0.184 (18.4%) at G = 1/2, contrasting it with the operating point G = 1 giving S ≈ 0.135 (13.5%). This pattern is first illustrated with Example 12.2 and the worked Example 12.3 (200-bit frames, 200 kbps channel, Tf = 1 ms), then transferred to the GATE-2021 Q.22 (1,000-bit frames, 1 Mbps channel, Tf = 1 ms), where the same G = 1 yields S ≈ 13.5%. The central takeaway is that pure ALOHA throughput depends only on the dimensionless offered load G, and that the maximum achievable efficiency is about 18.4%.

Loading lesson…