Disk Basics

Duration: 32 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/operating-system/file-management/storage-raid-management/asset-disk-basics after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Database Management System: 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
  2. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, 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, 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
  4. Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
  6. Computer Networks: Introduction to CN, 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, Network Security, Hardware Basics
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
  9. 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
  10. 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
  11. C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
  16. Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
  17. English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
  18. Engineering Mathematics: Calculus, Vectors
  19. GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces disk storage fundamentals, progressing from general secondary and optical storage to the internal mechanics of magnetic hard disk drives (HDDs) and finally to quantitative access-time calculations. The instructor begins by defining secondary storage as non-volatile, permanent, and high-capacity, contrasting it with RAM. Examples include HDDs, SSDs, magnetic tape, and optical media such as CDs, DVDs, and Blu-ray discs. The lesson then focuses on magnetic disks, explaining that data is stored magnetically on rotating platters and organized into tracks, sectors, and cylinders. Using a labeled HDD diagram and hand-drawn concentric-circle diagrams, the instructor maps physical components—platters, spindles, read/write heads, and actuator arms—to logical structures. A worked example with two platters shows that the number of surfaces equals 2 × 2 = 4, distinguishing upper and lower surfaces. The lecture then introduces logical blocks and Logical Block Addresses (LBA), stating that a logical block is the smallest unit of data transfer and that logical blocks are mapped to physical sectors in a defined order: track, cylinder, then next cylinder. Finally, the instructor defines disk access time as seek time plus rotational latency plus data transfer time plus controller overhead. Using a 6000 RPM disk, the rotation time is calculated as 60 / 6000 = 0.01 seconds, or 10 ms per rotation, and average rotational latency is half of that. A sample problem with seek time 8 ms, transfer time 2 ms, and overhead 1 ms is set up to compute total data access time.

Chapters

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

    The lecture opens with a 'Storage Basics' slide defining secondary storage as used to store data permanently, non-volatile so data remains when power is off, and providing large storage capacity. The instructor underlines 'permanently' and writes 'Unlike RAM' in pink ink to contrast secondary storage with primary memory. Examples shown include Hard Disk (HDD), Solid State Drive (SSD), and Magnetic Tape, alongside optical storage devices such as CD, DVD, and Blu-ray Disc. The instructor points to the optical storage section and notes that it is a direct-access device, using arrows to connect text descriptions to the corresponding device images.

  2. 2:00 – 5:00 02:00-05:00

    The instructor continues annotating the storage basics slide, highlighting 'non-volatile' and adding handwritten notes about SSD capacities such as 1TB, 2TB, and 3TB. Magnetic tape is circled among the secondary storage examples. The lesson then transitions to a new slide titled 'Magnetic Disk,' which states that magnetic disks provide a large part of secondary storage, that the Hard Disk Drive (HDD) is the most common magnetic disk, and that data is stored magnetically on rotating platters. A labeled HDD diagram appears showing the Platter, Spindle, Read/Write Head, and Actuator Arm, with a magnified inset of concentric rings labeled Track and Sector and a stacked-platter graphic tagged Cylinder.

  3. 5:00 – 10:00 05:00-10:00

    The instructor points to the exploded HDD diagram and underlines key phrases in pink, including 'magnetic disk' on the second bullet. The magnified inset shows concentric rings labeled Track and Sector beside a platter stack labeled Cylinder, with pink handwritten notes. To clarify disk organization, the instructor draws a pink concentric-circle diagram on the board and adds an arrow labeled 'Track.' This visual bridge connects the physical platter layout to the logical arrangement of data, emphasizing that tracks are concentric rings on a disk surface and sectors divide each track into smaller units.

  4. 10:00 – 15:00 10:00-15:00

    At the interactive whiteboard, the instructor draws a pink target-like diagram labeled 'Tracks' and 'Sector.' He writes 'No of Platters = 2' and calculates 'No of Surfaces = 2 x 2 = 4,' then sketches two pairs of concentric circles bracketed as 'Platter 0' and 'Platter 1,' labeling each pair with Upper Surface and Lower Surface. The slide states that a disk is organized into Tracks, Sectors, and Cylinders, and notes that an HDD contains moving parts such as platters and read/write heads. The cylinder concept is reinforced visually as a stack of corresponding tracks across multiple platters.

  5. 15:00 – 20:00 15:00-20:00

    The lecture moves to a slide titled 'Logical Blocks and LBA,' which states that a logical block is the smallest unit of data transfer. A 'Magnetic Disk Structure' diagram labels Track, Read/Write Head, and Actuator Arm. A Block-to-LBA table maps Block 0 through Block 5 to LBA 0 through LBA 5, and a 'Mapping Order' column shows Track, Cylinder, then Next Cylinder. A right-hand 'Key Points' panel lists numbered points including that logical blocks are mapped to the physical sectors of the disk. The instructor then turns to the whiteboard and draws concentric circles in pink marker, repeating the pattern as two sets labeled 'Upper Side' and 'Lower Side,' joined by a bracket marked 'Platters.'

  6. 20:00 – 25:00 20:00-25:00

    The instructor explains the mapping of logical blocks to physical sectors on the whiteboard, using the 'Logical Blocks and LBA' slide with its magnetic disk structure diagram and mapping order. He then introduces 'Disk Access Time,' defining seek time and rotational latency as the main components of access delay. On the whiteboard he writes formulas: '1 Rotation Time = 60 / RPM seconds' and 'Average Rotational Latency = 1/2 x Rotation Time.' A hand-drawn disk rotation diagram illustrates how the read/write head must wait for the desired sector to rotate into position, making average latency half of one full rotation.

  7. 25:00 – 30:00 25:00-30:00

    The instructor applies the access-time formulas to a concrete example. A slide shows circled terms 'Seek Time' and 'Rotational Latency,' a hand-drawn concentric disk diagram, and the note 'Rotational Speed = 6000 RPM.' A question slide states that a disk has a rotational speed of 6000 RPM, with seek time 8 ms, transfer time 2 ms, and controller overhead 1 ms. In pink marker the instructor computes '1 Sec = 6000/60 = 100' rotations per second and a round time of '10ms,' establishing the rotation period needed to find average rotational latency.

  8. 30:00 – 32:26 30:00-32:26

    The final segment consolidates the access-time calculation. The slide presents the formula 'Data Access Time = Seek Time + Rotational Latency + Data Transfer + Overhead.' Using the 6000 RPM disk, one rotation takes 10 ms, so average rotational latency is 5 ms. The instructor combines the given values—seek time 8 ms, average rotational latency 5 ms, transfer time 2 ms, and overhead 1 ms—to compute total data access time. This worked example ties together the physical disk structure, logical block mapping, and timing formulas introduced earlier in the lecture.

The lecture builds a coherent model of disk storage from abstract to quantitative. It starts by situating secondary storage within the memory hierarchy: non-volatile, permanent, and high-capacity, with HDDs, SSDs, tape, and optical media as examples. The focus then narrows to magnetic disks, where the physical components (platters, spindle, read/write head, actuator arm) are mapped to logical structures (tracks, sectors, cylinders). The two-platter example clarifies that each platter has an upper and lower surface, giving four surfaces total. Logical blocks and LBA provide the software-visible abstraction: a logical block is the smallest transfer unit, mapped to physical sectors in track-cylinder-next cylinder order. The quantitative portion defines disk access time as seek time plus rotational latency plus transfer time plus overhead, with rotation time equal to 60/RPM seconds and average rotational latency half of that. The 6000 RPM example yields a 10 ms rotation and 5 ms average latency, which is then added to the given seek, transfer, and overhead values. For exam revision, students should remember the definitions of non-volatile secondary storage, the track-sector-cylinder hierarchy, the LBA mapping order, and the access-time formula with its RPM-based latency calculation.

Loading lesson…