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
- About Course: About the Course
- Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
- Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
- Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
- Paper 1 | Unit Tests:
- Paper 1 | Full-Length Mock Tests:
- Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
- Paper 2 | Digital Logic: 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
- Paper 2 | 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
- Paper 2 | Programming and 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
- Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
- Paper 2 | Theory Of Computation/Automata Theory: 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
- 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
- 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
- Paper 2 | DataBase Management System/DBMS: 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 Database Recovery
- Paper 2 | 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 Hardware Basics
- Paper 2 | CS/IT Sectional Mock Tests:
- Complete Paper Full Mock Test:
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.

