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
- Quantitative Ability: Percentage, Profit and Loss, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Simple Interest and Compound Interest, Age Problems, Number System, Divisibility Rules, HCF LCM, Algebra, Permutation and Combination, Probability, Data Interpretation, Logarithm, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Speed Mathematics and Basic Mathematics
- Logical Reasoning: Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Data Sufficiency, Venn Diagram, Inequality, Series (Number and Letter Series) (Numerical Relations and Reasoning), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
- Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Subject Verb Agreement (Verb Noun Agreement), Tenses, Articles, Preposition, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Vocabulary, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Facts, Inference and Judgements
- Programming Fundamentals (Technical): C Fundamentals
- Data Structures (Technical): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms (Technical): Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
- OOPs (Technical): Object Oriented Programming (OOPS)
- DBMS (Technical): 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 (Technical): SQL
- Operating Systems (Technical): 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 (Technical): 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
- Software Engineering (Technical): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Coding/Automata Round: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir, Pseudo Codes
- Personality / Behavioral Assessment: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
- Writing Assessment: English Writing Ability
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.

