Bit-Oriented Approach
Duration: 3 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Communication Round: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, 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), Direct and Indirect Speech, Active Passive Voice (Voice), Verbal Analogy (Word Based Analogy), Articles, Preposition, Conjunction, Sentence Construction, English Writing Ability, Communication Assessment
- Quantitative Aptitude: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Speed Time and Distance, Percentage, Average, Powers and Exponents (Surds and Indices), Time and Work, Mensuration and Geometry, Age Problems, Pipe and Cistern, Probability, Profit and Loss, Simple Interest and Compound Interest, Algebra
- Analytical and Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Directions (Direction Test), Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Logical Sequence Of Words, Puzzle Solving (Puzzles), Syllogisms, Seating Arrangements, Calendar, Clock, Blood Relations, Cubes & Dices, Venn Diagram, Analytical Reasoning (Counting Figures Reasoning)
- Cognizant Gaming Aptitude: Gamified / Game Based Aptitude
- Java (Cluster 1): Java
- ANSI SQL MySQL (Cluster 1,2,3): SQL
- HTML, CSS, JavaScript (Cluster 1,3): HTML, CSS, JavaScript
- Python (Cluster 2): Python for Placements by Yash Sir
- Cloud Fundamentals (Cluster 2): Emerging Tech Trends
- C# (Cluster 3): C#
- OOPs: Object Oriented Programming (OOPS)
- Technical Assessment (Coding): Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Pseudo Codes
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- DBMS: 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
- Operating Systems: 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: 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
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This lecture introduces bit-oriented protocols used in the data link layer for reliable frame transmission. The instructor explains that frames must be delimited using a specific 8-bit flag pattern, 01111110, to mark the start and end of data. To prevent this flag pattern from accidentally appearing within the payload, a technique called bit stuffing is employed. The core mechanism involves detecting five consecutive 1s in the data stream and automatically inserting a '0' bit immediately after them. This ensures that the flag sequence never occurs naturally in the data. Upon reception, the receiver performs destuffing by removing any '0' that follows five consecutive 1s, thereby restoring the original data. Visual diagrams illustrate the transformation from 'Data from upper layer' to a 'Stuffed Frame' containing headers, trailers, and flags, and finally back to 'Unstuffed Data'. The process guarantees that frame boundaries are unambiguous even when the data contains patterns resembling delimiters.
Chapters
0:00 – 2:00 00:00-02:00
The session begins with an introduction to bit-oriented protocols, establishing the necessity of frame delimiters. The instructor displays a diagram showing the standard frame structure: flags, headers, variable data bits, and trailers. A critical visual cue is the 8-bit flag pattern '01111110' shown on screen to mark frame boundaries. The instructor explains that without special handling, this pattern could appear within the data itself, causing synchronization errors. To address this, bit stuffing is introduced as a solution where extra bits are inserted into the data stream. The visual evidence includes text labels like 'Data from upper layer' and arrows indicating where stuffing occurs, setting the stage for a detailed mechanism explanation.
2:00 – 3:14 02:00-03:14
The lecture focuses on the operational mechanics of bit stuffing and destuffing. The instructor points to a binary sequence '0001111111001111101000' to demonstrate the detection of five consecutive 1s. A diagram explicitly shows 'Two extra bits' being added to the frame during transmission, transforming it into a 'Stuffed Frame'. The visual flow contrasts the 'Frame sent' with the 'Frame received', illustrating how the receiver identifies stuffed bits and removes them to recover the original data. The bottom section of the diagram labels this reverse process as 'Unstuffed', returning data to the upper layer. This section confirms that the protocol ensures transparency of data by preventing flag confusion through systematic bit insertion and removal.
The video provides a clear, step-by-step explanation of bit-oriented framing in the data link layer. The central concept is the use of a unique flag pattern '01111110' to delineate frames. The primary challenge addressed is the accidental occurrence of this pattern within user data, which would confuse the receiver about frame boundaries. The solution presented is bit stuffing: whenever five consecutive 1s are encountered in the data, a '0' is inserted. This rule is visually reinforced with diagrams showing binary streams and the insertion of extra bits. The process is reversible; upon reception, any '0' following five 1s is removed (destuffing). This ensures that the flag pattern remains unique and unambiguous. The visual aids effectively map the data flow from the upper layer, through the stuffed transmission frame, and back to the unstuffed output, providing a complete picture of the framing mechanism.

