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
- Discrete Mathematics: Permutation, Combination and Probability / क्रमचय, संचय एवं प्रायिकता, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
- Digital Logic: Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
- Computer Organization and Architecture: Basics of COA, Programming the Basic Computer, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Pipelining, Multiprocessors
- Programming: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
- Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
- Theory of Computation: Grammar, Regular Language Properties, Moore & Mealy Machines, Turing Machines
- 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, Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Pushdown Automata & CFG, Complexity Theory
- Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Security
- Database Management Systems: 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, ORDBMS, NoSQL
- Computer Networks: 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
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.

