Basics of Windows in TCP
Duration: 6 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Quantitative Aptitude: Number System, Divisibility Rules, HCF LCM, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Mixture and Alligation, Partnership, Age Problems, Time and Work, Pipe and Cistern, Speed Time and Distance, Algebra, Arithmetic, Data Interpretation, Sequence and Series (Series), Logarithm, Powers and Exponents (Surds and Indices), Permutation and Combination, Probability, Speed Mathematics and Basic Mathematics, Trigonometry
- Logical Reasoning: Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Syllogisms, Inequality, Data Sufficiency, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Venn Diagram, Logical Sequence Of Words, Calendar, Clock, Cubes & Dices, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
- Verbal Ability: Noun, Pronoun, Adjectives, Verb, Adverb, Tenses, Subject Verb Agreement (Verb Noun Agreement), Articles, Preposition, Conjunction, Modals, Determiner, Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Construction
- Data Structures (Domain Test): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms (Domain Test):
- OOPs (Domain Test): Object Oriented Programming (OOPS)
- DBMS (Domain Test): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
- SQL (Domain Test): SQL
- Operating Systems (Domain Test): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
- Computer Networks (Domain Test): 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 Security, Cloud Computing and IoT, Cyber and Info Security
- Coding: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir
- Written English Test: English Writing Ability
- Psychometric Test: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The lecture introduces TCP windowing, emphasizing that each direction of data transfer uses a send and receive window, resulting in four windows for bidirectional communication. The instructor explains that the sender's window size is governed by two factors: receiver window size and congestion window size. A hand-drawn diagram illustrates sender S and receiver R with directional arrows, annotated with example buffer sizes such as 3–4 KB and 16 KB. The final segment reinforces the congestion window concept, with red markings crossing out receiver boxes to highlight sender-side constraints.
Chapters
0:00 – 2:00 00:00-02:00
The slide titled 'Windows in TCP' states that TCP uses two windows (send and receive) per direction, i.e., four for bidirectional communication. Under 'Send Window,' the sender window size is determined by receiver window size and congestion window size. Red handwritten letters C, S, and a circled D appear, followed by green S and R annotations.
2:00 – 5:00 02:00-05:00
The instructor, visible in a black polo shirt, elaborates on the slide content. A hand-drawn diagram shows C above S with a green arrow to R, and below a circled 2 row with R and a blue arrow from S. The presenter writes '3-4KB' and '16 KB' under the boxes, adding a curved arrow labeled rR pointing to the top send box.
5:00 – 5:40 05:00-05:40
The slide reiterates that TCP uses send and receive windows per direction. The 'Send Window' section underlines 'Congestion window size.' A hand-drawn diagram shows sender S (3–4 KB box) and receiver R boxes, with a green arrow top and blue arrow bottom; the R boxes are crossed out in red.
The lecture systematically builds understanding of TCP windowing by first defining the four-window structure for bidirectional communication. It then focuses on the send window, identifying receiver and congestion windows as determining factors. Visual annotations, including directional arrows and buffer size examples (3–4 KB, 16 KB), clarify the interaction between sender and receiver. The final red markings on receiver boxes emphasize that congestion window constraints primarily affect the sender's transmission capacity.

