Explain about fat - inode, Computer Engineering

Assignment Help:

Q. Explain about FAT - Inode?

Today modern PC comprises total capacity of nearly 40GB for storage of program and data Due to this huge capacity in place of having just one operating system in our PC partitions are used to offer many separate areas within one disk each one treated as a separate storage device. Which means a disk partition is a sub-division of the disk in one or more areas. Every partition can be used to hold a different OS. Computer system boots from active partition and software provided permits the user to select that which partition is active one. 

For illustration we can run both Linux and Windows operating systems from same storage of the PC.

A new magnetic disk is only platters of a magnetic recording material. Before a disk can store data it should be divided in sectors that disk controller can read and write. This is known as low level formatting. Low level formatting fills disk with a special data structure for every sector that comprises a header, a data area, and a trailer. Low level formatting is placing track and sector information in addition of bad block tables and other timing information on disks. Sector interleave can be specified too at this time.


Related Discussions:- Explain about fat - inode

Explain the working of a weighted register d/a converter, With the help of ...

With the help of a neat diagram, explain the working of a weighted-resistor D/A converter. Ans Weighted Register D/A Converter:   Digital input that has 4 bits

Advantage of using interrupt initiated data transfer, What is the advantage...

What is the advantage of using interrupt initiated data transfer over transfer under program control without interrupt? In the interrupt initiated data transfer, the processor

Performance of a parallel algorithm - number of processors, Factor which he...

Factor which helps in analysis of parallel algorithms is the total number of processors needed to deliver a solution to a provided problem. So for a given input of size let's say n

Student, Suppose we have an array-based list A[0..N - 1] and we want to del...

Suppose we have an array-based list A[0..N - 1] and we want to delete all duplicates. LastPosition is initially N - 1, but gets smaller as elements are deleted. Consider the pseudo

Scsi bus - computer architecture, SCSI Bus:   Defined by ANSI - X3....

SCSI Bus:   Defined by ANSI - X3.131   50, 68 or 80 pins   Max. transfer rate - 160 MB/s, 320 MB/s. SCSI Bus Signals   Small Computer System Interface

Give difference between top down and bottom up parsing, Give difference bet...

Give difference between top down parsing and bottom up parsing. Top down parsing: Specified an input string, top down parsing tries to derive a string identical to this by s

Embedded system design using c, W To date we have discussed elementary high...

W To date we have discussed elementary high level language programming and low level assembler programming, one of the benefits of C is the integration of both , this requires a re

Example of variables and quantifiers - first-order logic, Example of Variab...

Example of Variables and quantifiers: We should have started with something such which reflects the fact that we're really talking for some meal at the Red Lion, neverthe

Addition of array elements using two processors, Q. Addition of array eleme...

Q. Addition of array elements using two processors? In this example we have to find sum of all elements of an array A of size n. We will divide n elements in 2 groups of roughl

Instruction pipeline-level of processing, Classification according to level...

Classification according to level of processing According to this classification, computer operations are classified as arithmetic operations and instruction implementation. Ne

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