Disk Basics
Duration: 32 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
- Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
- Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
- Paper 1 | Unit Tests:
- Paper 1 | Full-Length Mock Tests:
- Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
- Paper 2 | Digital Logic: 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
- Paper 2 | 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
- Paper 2 | Programming and 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
- Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
- Paper 2 | Theory Of Computation/Automata Theory: 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
- 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
- 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
- Paper 2 | DataBase Management System/DBMS: 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 Database Recovery
- Paper 2 | 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 Hardware Basics
- Paper 2 | CS/IT Sectional Mock Tests:
- Complete Paper Full Mock Test:
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
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: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.
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.
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.
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.'
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.
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.
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.

