Bit-Oriented Approach

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/computer-networks-security/dll-framing/bit-stuffing-algo/asset-bit-oriented-approach after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper-2 | Programming & 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
  3. Paper-2 | Databases / DBMS & SQL: 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: 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 Access Technologies, Network Security
  6. Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, 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, Waveform Generators and Timer 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
  7. 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
  8. Paper-2 | Theory of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  10. 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
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning), Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Data Sufficiency, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Statistics, Algebra, Geometry, Permutations and Combinations, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Constraint Puzzles, Clocks and Calendars, Traverse Surveying, Simplification and Approximation, Blood Relations, Data Interpretation, Venn Diagram
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra, Ratio and Proportion, Subject-Verb Agreement, Sentence Completion, Powers, Surds and Logarithms, Data Interpretation, Sequences and Series, Trigonometry, Mensuration, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Time and Work, Probability, Algebra, Speed, Time and Distance, Statistics, Sequence and Series (Series), Combinatorics
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Structure and Correction, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Sentence Basics, Nouns and Pronouns, Voice and Reported Speech, Articles and Determiners, Vocabulary
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
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

  1. 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. 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.

Loading lesson…