Gate 2008_

Duration: 11 min

This video lesson is available to enrolled students.

Return to /learn/RSSB-SENIOR-COMPUTER-INSTRUCTOR/paper-2-data-communication-and-network-security/dll-flow-control/go-back-n-protocol/asset-gate-2008-2961 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Paper-1 & 2 | Basic Numeracy: अनुपात और समानुपात / Ratio and Proportion, Divisibility Rules, मिश्रण और एलिगेशन / Mixture and Alligation, Permutation and Combination, Logarithm, संख्या पद्धति / Number System, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, Sequence and Series (Series), समय, चाल और दूरी / Time, Speed and Distance, प्रतिशत / Percentage, औसत / Average, घन क्षेत्रमिति / Solid Mensuration, Age Problems, Arithmetic, Statistics, Probability, लाभ, हानि और बट्टा / Profit, Loss and Discount, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, Partnership, Speed Mathematics and Basic Mathematics, Algebra, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, समय और कार्य / Time and Work, Pipe and Cistern, RSSB Specific Videos - Basic Numeracy, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers
  3. Paper-1 & 2 | Data Interpretation: आँकड़ा निर्वचन / Data Interpretation
  4. Paper-1 & 2 | General Mental Ability: Mental Ability, RSSB Specific Videos - Mental Ability
  5. Paper-1 & 2 | Logical Reasoning and Analytical Ability: श्रेणी / Series, कूट लेखन एवं कूट वाचन / Coding-Decoding, Data Sufficiency, अशाब्दिक तर्क / Non-Verbal Reasoning, Syllogisms, बैठक व्यवस्था एवं पहेलियाँ / Seating Arrangement and Puzzles, रक्त संबंध / Blood Relations, दिशा एवं दूरी / Direction and Distance, Analytical Reasoning (Counting Figures Reasoning), गणितीय संक्रियाएँ एवं लुप्त संख्या / Mathematical Operations and Missing Numbers, कैलेंडर एवं घड़ी / Calendar and Clock, Clock, घन, पासा एवं आकृतियों की गिनती / Cubes, Dice and Figure Counting, वेन आरेख, न्याय वाक्य एवं असमानता / Venn Diagrams, Syllogism and Inequalities, सादृश्यता एवं वर्गीकरण / Analogy and Classification, क्रम एवं रैंकिंग / Order and Ranking, कथन आधारित तार्किक विवेचन / Statement-Based Reasoning, Data Arrangement, वर्णमाला एवं संख्या परीक्षण / Alphabet and Number Test, Crypt Arithmetic
  6. Paper-1 & 2 | Decision Making and Problem Solving: आँकड़ों की पर्याप्तता एवं निर्णय क्षमता / Data Sufficiency and Decision Making
  7. Paper-1 | General Science: वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research, Biology, Chemistry, RSSB Specific Videos
  8. Paper-1 | General Awareness: राज्य विशेष सामान्य ज्ञान / State-Specific General Knowledge, समसामयिकी / Current Affairs
  9. Paper-2 | Fundamentals of Computer: Basics of COA, Number System, Floating Point Rep, Number Representation
  10. Paper - 2 | Digital Logic Systems: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits
  11. Paper-2 | Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Linux OS, Distributed Systems
  12. Paper-2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
  13. Paper-2 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  14. Paper-2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  15. Paper 2 | Oops, C++, Java: Language Design, OOPS with C++, Java, .Net Programming, Java Fundamentals
  16. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  17. Paper 2 | Emerging Trends and AI: Emerging Tech Trends, कंप्यूटर के मूल सिद्धांत / Computer Fundamentals, व्यापार, विपणन एवं उपभोक्ता संरक्षण / Trade, Marketing and Consumer Protection, कंप्यूटर नेटवर्क / Computer Networks
  18. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Advanced Algorithms
  19. Paper 2 | Data Communication and Network Security: 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, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security, Ethical Hacking
  20. Paper-2 I Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  21. Paper-2 | Computer Organization and Architecture: Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations
  22. Paper-2 | Web Development: JavaScript-Basics, HTML Basics, CSS, XML
  23. Pedagogy: वृद्धि और विकास / Growth and Development, Concept of Pedagogy, संज्ञानात्मक प्रक्रियाएँ / Cognitive Processes, विकास के सिद्धांत / Theories of Development, समावेशी शिक्षा / Inclusive Education, Experiential Pedagogy, समाजीकरण और जेंडर / Socialisation and Gender, National Education Policy (NEP) 2020
  24. Live Sessions: RSSB Live Sessions
  25. RSSB Paper 1 - Full Mock Tests:
  26. RSSB Paper 2 - Full Mock Tests:
  27. SCI Previous Year Papers:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video analyzes a GATE 2008 networking problem concerning satellite link utilization and the Go-Back-N sliding window protocol. The instructor systematically extracts parameters from a problem statement involving a 1 Mbps link, 36,504 km satellite altitude, and a signal speed of $3 \times 10^8$ m/s. The core objective is to determine the packet size required to achieve 25% channel utilization given a window size of $N=127$. The lecture progresses from identifying the problem constraints to deriving the efficiency formula $U = \frac{N}{1+2\alpha}$, calculating propagation delay based on distance and speed, and finally solving for the transmission time to find the packet length $L$. The solution culminates in selecting option (C) 240 bytes as the correct answer.

Chapters

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

    The instructor introduces the GATE 2008 networking problem displayed on screen, which involves a satellite link connecting two ground stations. He begins by extracting the given parameters from the question text, specifically noting the bandwidth $B = 1$ Mbps and preparing to analyze the link geometry. The visible text on screen reads 'Q. A 1Mbps satellite link connects two ground stations' and lists the altitude as 36,504 km with a signal speed of $3 \times 10^8$ m/s. The instructor writes down the bandwidth value and draws a diagram of the satellite link between stations S1 and S2 to visualize the network topology. He identifies the target channel utilization as 25% and notes that the Go-Back-N sliding window protocol is used with a window size $N=127$. The goal is to find the packet size $L$ that satisfies these conditions among options (A) 120 bytes, (B) 60 bytes, (C) 240 bytes, and (D) 90 bytes.

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

    The instructor derives the formula relating efficiency ($n$), transmission time, and propagation delay to find the required packet size. The visible equations show the substitution of values like $1/4$ for efficiency and 127 for the window size. He writes down the relationship $n = \frac{U.T}{T.t}$ and sets up the equation with window size 127. The derivation shows $\frac{1}{4} = \frac{T_Dt \times 127}{T_d + 2 \times T_t}$ and simplifies it to $\frac{1}{4} = \frac{127}{1 + a}$, where $a$ represents the ratio of propagation delay to transmission time. The instructor focuses on the relationship between efficiency and window size, identifying transmission time versus propagation delay components. He calculates the propagation delay $T_p$ using the distance formula $\frac{D}{S}$ and shows the calculation on a digital calculator. The handwritten notes derive the efficiency formula $U = \frac{N}{1+2\alpha}$ and solve for $ $ using the window size of 127.

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

    The video demonstrates a step-by-step derivation for calculating packet size using channel utilization and sliding window parameters. The instructor solves the networking problem by relating channel utilization to window size and round-trip time, using satellite altitude and signal speed for propagation delay. He calculates transmission time to find packet size based on the derived formulas. The screen displays channel utilization formula, sliding window parameters, and packet size calculation steps. The instructor continues to manipulate the efficiency equation $\frac{1}{4} = \frac{127}{1 + a}$ to solve for the parameter $a$. Once $a$ is determined, he uses the definition of $a = \frac{T_p}{T_t}$ to find the transmission time $T_t$. The visible text on screen includes 'Channel Utilization Formula', 'Sliding Window Parameters', and 'Packet Size Calculation'. The instructor ensures the mathematical progression is clear, showing how the window size of 127 and utilization of $1/4$ constrain the possible values for transmission time.

  4. 10:00 – 11:08 10:00-11:08

    The screen displays the final steps of the networking problem regarding a 1Mbps satellite link with an altitude of 36,504 km. Handwritten notes detail the derivation for channel utilization using a go-back-127 sliding window protocol. Formulas calculate transmission time and propagation delay to solve for packet size $L$. The instructor circles option (C) 240 bytes as the final answer. The visible text on screen confirms the problem statement and options, while the handwritten notes show the completed calculation. The instructor concludes by verifying that 240 bytes is the correct packet size to achieve the specified 25% channel utilization with the given window constraints. The final answer is clearly marked on the screen, providing a complete solution to the GATE 2008 question.

The lecture provides a comprehensive walkthrough of solving a satellite link utilization problem using the Go-Back-N sliding window protocol. The instructor methodically breaks down the problem by first identifying all given parameters: bandwidth of 1 Mbps, satellite altitude of 36,504 km, signal speed of $3 \times 10^8$ m/s, and a required channel utilization of 25%. The core concept taught is the relationship between efficiency ($U$), window size ($N$), and the ratio of propagation delay to transmission time ($\alpha$). The efficiency formula $U = \frac{N}{1+2\alpha}$ is central to the solution. By substituting $U = 0.25$ and $N = 127$, the instructor solves for $ $. Once $ $ is found, he calculates propagation delay $T_p = \frac{2 \times 36504 \times 10^3}{3 \times 10^8}$ seconds. Using the relationship $\alpha = \frac{T_p}{T_t}$, he determines transmission time $T_t$. Finally, the packet size $L$ is calculated as $L = T_t \times B$, yielding 240 bytes. This solution demonstrates the practical application of data link layer protocols in satellite communication scenarios, emphasizing how window size and propagation delay impact channel efficiency.

Loading lesson…