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

Describe about the embedded applications assembly, Describe about the Embed...

Describe about the Embedded applications assembly Embedded applications assembly and C programs are developed since embedded programs aren't large. For all others high-level an

Explain the features of major scheduling algorithms, Explain the Features o...

Explain the Features of Major scheduling algorithms. The Features of Major scheduling algorithms is given below: FCFS - i.e. First come first served scheduli

DW, Define a job scheduling strategy that will meet business requirement of...

Define a job scheduling strategy that will meet business requirement of reporting availability by 6am CST for the following cubes

Algorithm to insert a key in b-tree, Algorithm to insert a key in B-tree is...

Algorithm to insert a key in B-tree is as follows: 1.  First search is completed for the place where the new record must be put. As the keys are inserted, they are sorted into

Limitation identified in amdahls law, Q. Limitation identified in Amdahls l...

Q. Limitation identified in Amdahls law? There is one main limitation identified in Amdahl's law. As said by Amdahl's law workload or problem size is forever fixed as well as n

Solve out linear equations, Assume that you have been asked to solve proble...

Assume that you have been asked to solve problem with exact area constraints, the area error being no more than 1% for each department. What are the linear equations you would nee

Storing a word in memory - computer architecture, Storing a word in Memory:...

Storing a word in Memory: That is similar process with fetching a word from memory. The required address is loaded into the MAR After that data to be written are lo

Explain about cathode ray tubes, Q. Explain about Cathode Ray Tubes? Ca...

Q. Explain about Cathode Ray Tubes? Cathode ray tube is the major technology on that televisions and monitors have been based.  CRT is a partially evacuated glass tube which is

What is deadlock in operating system, Explain Deadlock in operating system ...

Explain Deadlock in operating system ? Deadlock: all process in a set of processes is waiting for an event which only a process in the set can cause.

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