Gate 2008_

Duration: 11 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/computer-networks-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 Course: About the Course
  2. Paper-2 | Programming & Data Structures: 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
  3. Paper-2 | Databases / DBMS & SQL: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: 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 Access Technologies, Network Security
  6. Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Waveform Generators and Timer Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
  7. Paper-2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  8. Paper-2 | 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
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  10. Paper-2 | Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning), Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Data Sufficiency, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Statistics, Algebra, Geometry, Permutations and Combinations, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Constraint Puzzles, Clocks and Calendars, Traverse Surveying, Simplification and Approximation, Blood Relations, Data Interpretation, Venn Diagram
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra, Ratio and Proportion, Subject-Verb Agreement, Sentence Completion, Powers, Surds and Logarithms, Data Interpretation, Sequences and Series, Trigonometry, Mensuration, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Time and Work, Probability, Algebra, Speed, Time and Distance, Statistics, Sequence and Series (Series), Combinatorics
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Structure and Correction, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Sentence Basics, Nouns and Pronouns, Voice and Reported Speech, Articles and Determiners, Vocabulary
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
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…