Explain the file-system manipulation, Operating System

Q. Explain the File-system manipulation?

File-system manipulation there is several details in file allocation, creation, deletion and naming that users should not have to perform. Blocks of disk space are utilized by files and must be tracked.

Deleting a file requires eliminating the name file information and freeing the allocated blocks. Protections must as well be checked to assure proper file access. User programs could neither make sure adherence to protection methods nor be trusted to allocate only free blocks and deallocate blocks on file deletion.

Posted Date: 7/27/2013 2:25:38 AM | Location : United States







Related Discussions:- Explain the file-system manipulation, Assignment Help, Ask Question on Explain the file-system manipulation, Get Answer, Expert's Help, Explain the file-system manipulation Discussions

Write discussion on Explain the file-system manipulation
Your posts are moderated
Related Questions
BEST FIT ALGORITHM Here scanning is for the finest fit one. Signifies it searches the entire list for the best fit position. For the process therefore in that the process will

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

Q. A CPU scheduling algorithm determined an order for the execution of its scheduled processes. Convinced n processes to be scheduled on one processor how numerous possible differ

Write a script that uses this idea to print output similar to the following: Files in this directory that match *~ : bash-scripts.html~ chimpanzee~ countdown~ countd

What is the main advantage of the layered approach to system design? As in all cases of modular design, designing an operating system in a modular way has several benefits. Th

idle thread The special thread a dispatcher will run when no ready thread is found. The primary purpose of the idle process and its threads is to remove what would otherwise b


The dynamic memory allocator is a layer between the application and the OS, managing heap objects. When a program requests memory from the allocator (via malloc(), for instance), t

Deadlock Avoidance It's a method to evade deadlock by careful resource scheduling. This approach to the deadlock problem foresees deadlock before it actually occurs. This a

when demand is 24000 units/year, production rate is 48000 units/year, setup cost is rs 200 per setup, carring cost is rs 20 per units/year, and economic batch quantity is 692.8203