Explain file allocation using i nodes, Operating System

Assignment Help:

File allocation using I nodes.

This method is used to decrease the size of the table in the above method. Every file will have an I-node list. Allow a file have 15 pointers after that the first 12 pointers can be used to point to the blocks directly. The next three pointers are able to be used to point to indirect blocks. The first two point toward single indirect blocks. The single indirect block is an index box containing not data other than the addresses of blocks that contain data and the last pointer points to a double indirect block which contains the addresses of blocks that contain pointers to the actual data blocks.

1528_File allocation using I nodes.png


Related Discussions:- Explain file allocation using i nodes

MICROKERNEL, ADVANTAGES OF MICROFERNEL IN YSTEM DESIGN?

ADVANTAGES OF MICROFERNEL IN YSTEM DESIGN?

Least-recently used, LRU evicts the page which was last accessed the farthe...

LRU evicts the page which was last accessed the farthest into the past of any page resident in physical memory, i.e. the least-recently used page. LRU approximates OPT when the rec

Is disk scheduling except fcfs scheduling, Q. Is disk scheduling except FC...

Q. Is disk scheduling except FCFS scheduling useful in a single-user environment? describe your answer. Answer: In a single-user environment the I/O queue typically is empty.

Differentiate pre-emptive and non-preemptive scheduling, Differentiate pre-...

Differentiate pre-emptive and non-preemptive scheduling In a pre-emptive scheduling technique, CPU can be taken away from a process if there is a requirement while in a non-pre

Software Support (Introducing Operating Systems), The questions ask List fo...

The questions ask List four major functions of an OS. My answer: Function 1: Provide a user interface Function 2: Manage files Function 3: Manage hardware Function 4: Manage appli

Define deadlock, Define deadlock. A process requests resources; if the ...

Define deadlock. A process requests resources; if the resources are not available at that time, the process enters a wait state. Waiting processes might be never again change s

Shared stack is used for parameter passing, Q. What protection problems may...

Q. What protection problems may occur if a shared stack is used for parameter passing? Answer: The contents of the stack could be conciliation by other process(es) sharing th

Deadlock involving only one single process, Is it probable to have a deadlo...

Is it probable to have a deadlock involving only one single process? Describe your answer. Answer: No This pursue directly from the hold-and-wait condition.

Write a program to synchronize the agent, The Cigarette-Smokers difficulty ...

The Cigarette-Smokers difficulty Consider a system with three smoker processes and one agent process. Every smoker continuously rolls a cigarette and then smokes it. But to roll as

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