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
what common event leads to the creation of a process?

List and discuss the various services provided by the operating system. Program execution - system capability to load a program into memory and to run it. I/O operatio

What is operating system?

about error detection in operating system and how does it take place?

Short term scheduling The short term scheduler as well known as the dispatcher executes most frequently and makes the fine grained decision of which process to execute next. Th

What is a client server system? Centralized systems proceed as server systems to satisfy request generated by client systems Server system is able to be broadly div

Q. Provide two programming instances in which multithreading provides better performance than a single-threaded solution. Answer: (1) A Web server that services every request

Define approaches that require knowledge of the system state?  Answer: Deadlock detection, Deadlock prevention, Deadlock Avoidance.

What are the various disk-scheduling algorithms? The several disk-scheduling algorithms are a. First Come First Served Scheduling b. Shortest Seek Time First Scheduling

In a  p system each part (RAM, ROM, I/O) has a unique set of numbers. The allocation of these numbers is usually stated in the form of a memory map. This is a plot of data bus agai