Preamble and SFD

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/computer-network-and-information-security/data-link-layer-ethernet/ethernet-frame-format-preamble-sfd/asset-preamble-and-sfd after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. 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, Complexity Theory
  13. 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
  14. Paper 2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This short lecture segment introduces the Preamble and Start Frame Delimiter (SFD) fields of an Ethernet frame. The instructor presents a slide titled “Preamble,” defining it as a 7-byte field containing alternating 0s and 1s, equivalent to 56 bits. The slide notes that the Preamble is added at the physical layer and serves synchronization purposes. An Ethernet frame diagram labels the fields in order: Preamble (7 bytes), SFD (1 byte), Destination address (6 bytes), Source address (6 bytes), Length (2 bytes), Data and padding, and CRC (4 bytes). The instructor circles the Destination and Source address fields. On-screen notes also mention minimum payload length of 46 bytes, maximum payload length of 1500 bytes, and minimum frame length of 512 bits or 64 bytes. The lesson then transitions to the SFD slide, stating that it is a 1-byte field always set to 10101011, with the final two bits “11” marking the beginning of the frame. The SFD is also added at the physical layer, and a note indicates that historically only the SFD existed before the Preamble was added later.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The slide titled “Preamble” defines the field as a 7-byte sequence of alternating 0s and 1s, shown on-screen as “Preamble: 56 bits of alternating 1s and 0s.” The instructor explains that the Preamble is added at the physical layer for synchronization. An Ethernet frame diagram displays labeled blocks: Preamble (7 bytes), SFD (1 byte), Destination address (6 bytes), Source address (6 bytes), Length (2 bytes), Data and padding, and CRC (4 bytes). Handwritten ovals circle the Destination and Source address fields. Additional on-screen notes state minimum payload length 46 bytes, maximum payload length 1500 bytes, and minimum frame length 512 bits or 64 bytes.

  2. 2:00 – 2:53 02:00-02:53

    The presentation switches to a slide titled “Start Frame Delimiter (SFD),” which states that the SFD is a 1-byte field always set to “10101011.” The slide highlights that the last two bits, “11,” mark the beginning of the frame and that the SFD is added at the physical layer. A note below reads “only SFD was there Preamble was added later,” indicating the historical development of these fields. The instructor gestures while explaining, and the frame diagram remains visible with Preamble labeled as 7 bytes and SFD as 1 byte.

The central teaching point is the structure and purpose of the Preamble and SFD in Ethernet framing. The Preamble provides synchronization through a 7-byte alternating bit pattern, while the SFD signals frame start with its fixed value 10101011, where the trailing “11” distinguishes it from the alternating pattern. Both fields are physical-layer additions, and the diagram situates them before the data-link layer addresses and payload. The historical note that SFD preceded Preamble adds context for why both exist.

Loading lesson…