Basics of Transmission Control Protocol
Duration: 3 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 the basics of Transmission Control Protocol (TCP), focusing on its role as a reliable, connection-oriented transport protocol. The instructor presents slides with diagrams showing sending and receiving processes connected by a stream of bytes, explaining that TCP reserves resources such as bandwidth, CPU time, and buffers at the receiver end. The lesson progresses to TCP segments, where bytes are grouped into packets with headers and encapsulated in IP datagrams. A header table lists fields including source port address, destination port address, sequence number, acknowledgment number, HLEN, reserved bits, window size, and checksum. The visual evidence is limited to sampled screenshots without audio or transcript, so the summary relies on visible slide text and diagrams.
Chapters
0:00 – 2:00 00:00-02:00
The opening slide is titled "TCP (Transmission Control Protocol)" and shows a diagram with a sending process over a left TCP block and a receiving process over a right TCP block, linked by a tube labeled "Stream of bytes." The instructor points to the first bullet: "TCP is a reliable connection-oriented protocol, it must be used in any application where reliability is important," with key phrases underlined. He then moves to the left edge and points at the process diagram, emphasizing that TCP connects application processes through a byte stream. The slide also includes the phrase "reliable connection-oriented protocol" and labels for sending/receiving processes.
2:00 – 3:25 02:00-03:25
The lecture shifts to connection-oriented resource reservation and buffering. A slide states: "Connection oriented means some resources will be reserved at the receiver end, like Bandwidth, CPU time, Buffer etc." A two-box diagram shows circular buffers: the left sending buffer is labeled "Next byte to write," "Written, but not sent," and "Sent"; the right receiving buffer is labeled "Next byte to read," "Received, but not read," and "Next byte to receive." The final slide is titled "Segments" and explains that TCP groups bytes into a packet called a segment, adds a header to each segment, and encapsulates segments in an IP datagram. The diagram shows Segment N and Segment M between buffers, each beginning with an "H" header. A header table lists fields such as Source port address, Destination port address, Sequence number, Acknowledgment number, HLEN, Reserved, Window size, and Checksum.
The lecture builds a foundational understanding of TCP in three connected steps. First, it defines TCP as a reliable, connection-oriented protocol suitable for applications requiring reliability, using the byte-stream diagram to show how sending and receiving processes communicate. Second, it explains what connection-oriented means in practice: resources like bandwidth, CPU time, and buffers are reserved at the receiver end. The circular buffer diagrams make this concrete by showing how data moves from written to sent on the sender side and from received to read on the receiver side. Third, it introduces segments as TCP's unit of transfer: bytes are grouped into segments, each with a header, and then encapsulated in IP datagrams. The segment diagram and header field table provide the structural detail needed to understand how TCP tracks data flow through sequence numbers, acknowledgment numbers, window size, and checksum. Because the evidence comes only from sampled screenshots without audio, the instructor's spoken explanations are not captured; however, the slide text and diagrams clearly establish the core concepts of reliability, connection orientation, buffering, and segment structure.

