Operation on file system, Operating System

Assignment Help:

Question :

The file system is the most visible aspect of an operating system. It provides the mechanism for on-line storage and access to both data and programs of the operating system and to all the users of the computer system.

(a) What is a file?

(b) Many systems require and open system call and a close system call. Explain the purpose of the open and close operations.

(c) Some systems automatically open a file when it is referenced for the first time, and close the file when the job terminates. What is the advantage and disadvantage of this scheme as compared to the more traditional one, where the user has to open and close the file explicitly?

(d) Just as a file must be opened before it is used, a file system must be mounted before it can be available to processes in the system. Describe the mount procedure that is performed by the operating system.

(e) Consider a file system where a file can be deleted and its disk space reclaimed while links to that file still exists.

I. What problems may occur if a new file is created in the same storage area or with same absolute path name?

II. How can these problems be avoided?


Related Discussions:- Operation on file system

Differences between foreground and background, Describe the differences bet...

Describe the differences between foreground and background processing. What advantage does background processing provide? 1. Background processes typically run with little or no

Define some language processors, Define Name of some language processors?  ...

Define Name of some language processors?   Name of some language processors are as follow: Assembler, Compiler and Interpreter

Explain the per thread scoping, Explain the Per Thread Scoping Thread-l...

Explain the Per Thread Scoping Thread-level programming introduces new twists for application-level variable scoping. Threads are commonly used in one of two ways. To ex

Explain hierarchical paging, Hierarchical paging Single way is to use a...

Hierarchical paging Single way is to use a two-level paging algorithm, in which the page table itself is also paged. A logical address is separated into a page number and a pag

Define entry section and exit section, Define entry section and exit sectio...

Define entry section and exit section. The critical section problem is to design a protocol that the processes can use to cooperate. Every process must request permission  to e

Long term scheduler, Long term scheduler calculates which processes are a...

Long term scheduler calculates which processes are admitted to the machine for processing. It accepts the degree of multiprogramming. Once accepted, a job converts a process.

Explain variable partitioning in memory management, VARIABLE PARTITIONING ...

VARIABLE PARTITIONING We can differ the partitions and change the location according to the size of the process.   50k 40k

Memory management, example of first fit best fit and worst fit

example of first fit best fit and worst fit

CPU Scheduing FCFS, Assume that P A , P B and P C are three distinguished p...

Assume that P A , P B and P C are three distinguished program s . When P A is executed, it needs 10 ticks to complete its execution and it forks new processes executing P B at tick

Deadlock prevention-resource allocation graph allocation, Explain Deadlock ...

Explain Deadlock Prevention-Resource allocation graph allocation Resource allocation graph algorithm :  Using this algorithm we are able to actually know if there exists in th

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