Illustrate about fat structure, Computer Engineering

Assignment Help:

Q. Illustrate about FAT structure?

DOS file system maintains a table of pointers known as FAT (File allocation table) that comprises an array of 16-bit values. There is one entry in FAT for every cluster in file area which implies that every entry of FAT (except the two) keeps up a correspondence to one cluster of disk space. If value in the FAT entry does not mark an unused, reserved or defective cluster then cluster corresponding to FAT entry is part of a file and value in FAT entry would signify the next cluster in file. 

First two entries (0 and 1) in FAT are reserved for use by operating system. Thus cluster number 2 corresponds to first cluster in data space of disk. Before any data being written on to disk FAT entries are all set to zero denoting a 'free' cluster. FAT chain for a file ends with hexadecimal value it implies that FFFF. FAT structure can be displayed as in Figure below.

387_Illustrate about FAT structure.png

Figure: FAT structure


Related Discussions:- Illustrate about fat structure

Difference between absolute and relative path, What is the difference betwe...

What is the difference between absolute and relative path name of a file? Absolute path name: This is listing of the directories and files from the root directory to the i

Why a task cannot return a value, Why a task can n ot return a value? ...

Why a task can n ot return a value? If tasks can return values then Let's take a look at the below example. A=f1(B)+f2(C); and f1 and f2 had delays of say 5 and 10? Whe

Explain advantage of static storage class, Explain advantage of static stor...

Explain advantage of static storage class The second and more subtle use of 'static' is in connection with external declarations. With external constructs it provides a privacy

Explain optimizing transformations, Explain optimizing transformations? ...

Explain optimizing transformations? Optimizing transformations: It is a rule for rewriting a segment of a program to enhance its execution efficiency without influencing i

Hardware interrupts - computer architecture, Hardware interrupts: Har...

Hardware interrupts: Hardware interrupts -from I/O devices, processor, memory Software interrupts-produced by a program. Direct Memory Access (DMA)  Interrupt or Poll

What is linear bounded automation, What is linear bounded automation?  ...

What is linear bounded automation?   A linear bounded automation is restricted type of Turing machine where in the tape head isn't permitted to move off the portion of the tape

Define entry section and exit section, Define entry section and exit sectio...

Define entry section and exit section. The critical section problem is to design a protocol that the processes can use to cooperate. Every process must request permission to e

Visualization, Visualization Visualization is a general method in contr...

Visualization Visualization is a general method in contract to search based tools.  In this method visual aids are given like pictures to assist the programmer in evaluating th

What is a table attribute, What is a Table attribute? The table's attr...

What is a Table attribute? The table's attributes verifies who is responsible for maintaining a table and which types of access are permitted for the table.  The most signific

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd