How many disk operations are needed to fetch the i-node, Operating System

How many disk operations are needed to fetch the i-node for the file /usr/ast/courses/os/handout.t? Assume that the i-node for the root directory is in memory, but nothing else along the path is in memory. Also assume that all directories fit in one disk block.

 

 

Posted Date: 4/2/2013 1:26:18 AM | Location : United States







Related Discussions:- How many disk operations are needed to fetch the i-node, Assignment Help, Ask Question on How many disk operations are needed to fetch the i-node, Get Answer, Expert's Help, How many disk operations are needed to fetch the i-node Discussions

Write discussion on How many disk operations are needed to fetch the i-node
Your posts are moderated
Related Questions
Q. Describe the concept of transaction atomicity? Answer: A transaction is a sequence of read as well as writes operations upon some data followed by a commit operation. If the

What is low-level formatting? Before a disk can kept data, it must be required into sectors that the disk controller can read and write. This procedure is called low-level form

What is preallocation? Why do it? Allocating space for a file before making the file to allow for expansion. This reserves space for a certain file so that other files can't gr

What are the use of job queues, ready queues and device queues? As a process enters a system they are put in to a job queue. These queues having of all jobs in the system. The

Optimal page replacement An optimal page replacement algorithm has the least page fault rate of all algorithms. The algorithm states that a 'replace the page that will not be

Normal 0 false false false EN-US X-NONE X-NONE MicrosoftInternetExplorer4

What is the main advantage of multiprogramming? Multiprogramming makes efficient use of the CPU by overlapping the demands for the CPU and its I/O devices from various users. I

what do you mean by starvation?explain in detail

Q. Could you replicate a multilevel directory structure with a single-level directory structure in which arbitrarily long names can be used? If your answer is yes describe how you

Q. Suppose an operating system maps user-level threads to the kernel utilizing the many-to-many model where the mapping is done through the use of LWPs. In addition the system allo