Go Back N - ARQ
Duration: 13 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Database Management System: 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
- Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, 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, 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
- Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
- Computer Networks: Introduction to CN, 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, Network Security, Hardware Basics
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
- 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, Complexity Theory
- 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
- C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
- Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
- Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
- Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
- English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
- Engineering Mathematics: Calculus, Vectors
- GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This lecture introduces Go-Back-N Automatic Repeat Request (ARQ), a sliding-window protocol used to keep the channel busy by allowing multiple frames to be in transit while waiting for acknowledgments. The instructor begins with a slide titled “Go-Back-N Automatic Repeat Request,” which explains that multiple frames must be in transition to fill the pipe. A horizontal number-line diagram is used throughout, showing a sequence of numbered frame cells (e.g., 13–15, then 0 through 14). A central orange block highlights the send window (frames 0–6), with arrows labeled S_i and S_{i+1} marking the first outstanding frame and the next frame to send. A bottom bracket states “Send window, size S_max = 2^m - 1.” Region captions under the diagram distinguish “Frames already acknowledged,” “Frames sent, but not acknowledged (outstanding),” “Frames that can be sent, but not received from upper layer,” and “Frames that cannot be sent.” The instructor handwrites notes near the board, including binary-style labels such as “0 (111)” and “15 (111),” likely illustrating sequence-number encoding. The lecture then transitions to a “Timers” slide, which explains that although a timer could exist per frame, the protocol uses only one because “the timer for the first outstanding frame always expires first.” Two side-by-side sender/receiver timing diagrams are shown: “a. Window size < 2^m” and “b. Window size = 2^m.” Each diagram includes numbered frames, frame arrows (e.g., “Frame 0/1/2”), and a “Time-out” marker. Yellow callout boxes at the bottom read “Correctly discarded” (left) and “Erroneously accepted” (right), highlighting the ambiguity problem when window size equals 2^m. The instructor circles and annotates parts of these diagrams, emphasizing the timeout behavior and receiver acceptance decisions. A later slide on “Acknowledgment” states that the receiver is silent and discards subsequent frames until it receives the expected one, which causes the sender’s timer to expire. The final sampled slide revisits the window diagram with numbered cells from 1 through 15, then 0 and 1, with several early cells marked by red X symbols, reinforcing the four-region division of sequence numbers and the send-window constraints.
Chapters
0:00 – 2:00 00:00-02:00
The lecture opens with the slide “Go-Back-N Automatic Repeat Request,” explaining that multiple frames must be in transition to fill the pipe while waiting for acknowledgment. A horizontal number-line diagram shows a dashed block (13, 14, 15), an orange send-window block of numbered cells (0 through 6), a gray block, and a trailing dashed block. Arrows labeled S_i and S_h mark “Send window, first outstanding frame” and “Send window, next frame to send,” while a bottom bracket reads “Send window, size S_max = 2^m - 1.” Region captions under the diagram include “Frames already acknowledged,” “Frames sent, but not ... (outstanding),” “Frames that can be sent, but not received from upper layer,” and “Frames that cannot be sent.” A hand holding a pen appears at the right edge, then moves up to sketch between handwritten “S” and “R” labels on the whiteboard.
2:00 – 5:00 02:00-05:00
The instructor, wearing a black shirt with red trim and later a “KG” logo, stands at the whiteboard pointing to the slide. The numbered frame sequence 0–14 is shown with boxes 0–6 shaded orange, marked by arrows labeled “S_i Send window, first outstanding frame” and “S_{i+1} Send window, next frame to send.” Below the sequence, a bracket reads “Send window, size S_use = 2^m - 1,” with column captions including “Frames that can be sent, but not received from upper layer” and “Frames that cannot be sent.” The instructor writes binary-style notes such as “0 (111)” and “15 (111)” in the upper-right corner near handwritten “S” and “R.” At 205s, a hand-drawn oval encircles the caption “Frames sent, but not acknowledged (outstanding).” The instructor gestures toward the outstanding-frames region, emphasizing the send-window structure.
5:00 – 10:00 05:00-10:00
The lecture transitions to a slide titled “Timers,” with left-side text stating that although a timer could exist per frame, the protocol uses only one because “the timer for the first outstanding frame always expires first.” Two timing diagrams sit side by side, captioned “a. Window size < 2^m” and “b. Window size = 2^m,” each with Sender and Receiver columns showing numbered frames, “Frame 0/1/2” arrows, and a “Time-out” marker. Yellow callout boxes at the bottom of each diagram read “Correctly discarded” (left) and “Erroneously accepted” (right). The instructor, in a black “KG KNOWLEDGE GATE” polo, points to diagram b where the receiver box is highlighted with “Erroneously accepted,” while diagram a shows a matching highlight reading “Correctly discarded.” The instructor circles a handwritten “1” near the top of diagram a and adds red marks on diagram b, illustrating the timeout and receiver-acceptance behavior.
10:00 – 12:34 10:00-12:34
The presenter stands before Go Back N - ARQ slides, first centered, then on the right facing camera, and finally reaching across to point with a marker. The opening slide’s “Acknowledgment” text states the receiver is silent and discards subsequent frames until it receives the expected one, which makes the sender’s timer expire. Two Sender/Receiver timing diagrams show frame and R-number exchanges, with yellow boxes reading “Correctly discarded” and “Erroneously accepted” plus the label “b. Window size = 2^m.” A later slide says the window divides sequence numbers into four regions, illustrated by a numbered bar running 13–15 then an orange block over 0–6 and gray cells to 14. The final sampled slide shows numbered cells from 1 through 15, then 0 and 1, with several early cells marked by red X symbols. Labels above the diagram read “Send window, first outstanding frame” and “Send window, send frame to send,” reinforcing the four-region division and send-window constraints.
The lecture systematically builds understanding of Go-Back-N ARQ by first establishing the send-window structure and then analyzing timer behavior under different window sizes. The central concept is that multiple frames can be in transit to keep the channel busy, with the send window size constrained by S_max = 2^m - 1. The four-region division of sequence numbers—acknowledged, outstanding, sendable but not yet received from upper layer, and unsendable—is visually reinforced through the orange-highlighted send window and region captions. The timer discussion is critical: only one timer is used because the first outstanding frame’s timer always expires first. The two timing diagrams (window size < 2^m and window size = 2^m) illustrate the ambiguity problem, where a receiver may erroneously accept frames when window size equals 2^m. The “Acknowledgment” slide clarifies that the receiver remains silent and discards frames until it receives the expected one, triggering the sender’s timeout. The final slide revisits the window diagram with red X symbols on early cells, reinforcing the constraints on sendable frames. The lecture progresses from static window structure to dynamic timer and acknowledgment behavior, providing a complete picture of Go-Back-N ARQ operation.

