File System - Compression and Reparse Point

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/MCA-ENTRANCE-EXAM/operating-system/windows-os/file-network-services/asset-file-system-compression-and-reparse-point after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Aptitude and Math: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Algebra, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Statistics, Probability, Percentage, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Average, Calculus, Trigonometry, Vectors, Linear Algebra
  2. Logical and Analytical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Verbal Analogy (Word Based Analogy), Directions (Direction Test), Blood Relations, Ranking, Order and Sequence, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Puzzle Solving (Puzzles), Cubes & Dices, Analytical Reasoning (Counting Figures Reasoning)
  3. English Language & Comprehension: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, Verb, Articles, Preposition, Pronoun, Conjunction, Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Cloze Test (Cloze Passage)
  4. Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
  5. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  6. Operating System: 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
  7. 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, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security, Cyber and Info Security
  8. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  9. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  11. 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, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video presents a lecture on file system concepts, specifically focusing on compression and reparse points. The first section, titled "File System — Compression," explains how the NTFS file system compresses files by dividing their data into compression units of 16 contiguous clusters. It also details a technique for sparse files, where clusters containing all zeros are not allocated on disk; instead, gaps are recorded in the MFT entry. When reading such a file, the system detects these gaps and zero-fills the corresponding portion of the caller's buffer. The second section, "File System — Reparse Points," defines a reparse point as a special file system object that returns an error code when accessed. The reparse data within the file tells the I/O manager what action to take next. The lecture provides examples of reparse points being used for UNIX mounts and for accessing files that have been moved to offline storage, with a diagram illustrating a reparse point linked to a file on a different volume.

Chapters

  1. 0:00 – 1:57 00:00-01:57

    The video begins with a slide titled "File System — Compression." The instructor explains that NTFS compresses files by dividing their data into compression units, which are blocks of 16 contiguous clusters. For sparse files, NTFS saves space by not allocating clusters that contain all zeros; instead, gaps are left in the sequence of virtual cluster numbers in the MFT entry. When reading a file, if a gap is found, NTFS zero-fills the corresponding portion of the caller's buffer. The slide then transitions to a new topic, "File System — Reparse Points." The instructor defines a reparse point as an object that returns an error code when accessed, with the reparse data instructing the I/O manager on the next action. Examples given include providing the functionality of UNIX mounts and accessing files moved to offline storage. A diagram is drawn on the slide, showing a reparse point labeled "Pudhna" pointing to a file labeled "F" on a different volume, illustrating how a reparse point can redirect access to a file on another storage device.

The lecture progresses from a technical explanation of file system compression to the concept of reparse points. It first details how NTFS optimizes storage by using compression units and handling sparse files through virtual cluster gaps, which are managed by the MFT. This is followed by a shift to reparse points, which are a mechanism for the file system to redirect I/O operations. The synthesis of these concepts shows how modern file systems use both data-level optimization (compression) and metadata-level redirection (reparse points) to manage storage efficiently and provide advanced features like cross-volume access and integration with other operating system functionalities.

Loading lesson…