Explain two level directory, Operating System

Assignment Help:

Two Level Directory

This kind of structure overcomes the problems of assigning unique names to the files. Thus there need not be any confusion among users.

In this kind of structure each user has a user file directory (UFD). The UFDs have an alike structure except each lists the files of a single user. As soon as a user starts or logs in the system's master file directory (MFD) is searched. The MFD is indexed by the account number or the user name and each entry points to the UFD for that user. Once a user searches for a particular file only his own UFD is searched and so different users may have the same names as long as all the file names within each UFD are unique.

A two level directory is able to be thought of as an inverted tree of height 2. The root of the tree is the MFD in addition to its descendents are the UFDs whose descendents are the files. 

Disadvantages:

            This structure detaches one user from the other. This is an benefit when the users are completely independent of each other but is a drawback when the users want to cooperate on some task and to access one another's files.

 

2000_Two Level Directory.png


Related Discussions:- Explain two level directory

Briefly discuss on real-time scheduling, Briefly discuss on real-time sched...

Briefly discuss on real-time scheduling? It is divided into two types.  Hard real-time systems are needed to complete a critical task within a guaranteed amount of time. T

Explain disk scheduling algorithms-shortest seek time first, SSTF (Shortest...

SSTF (Shortest Seek Time First) After a demand go to the closest request in the work queue regardless of direction Decrease total seek time compared to FCFS Disadv

Explain drawbacks of fixed partitioning, The drawbacks of fixed partitionin...

The drawbacks of fixed partitioning are: The number of partitions are précised at system generation time limits the number of active processes in the system. For the re

Explain swapping, Explain Swapping Swapping is a method of temporarily ...

Explain Swapping Swapping is a method of temporarily removing inactive programs from the memory of computer system.

Define a state which is not a fundamental process state, Define a state whi...

Define a state which is not a fundamental process state Answer: Blocked state is not a fundamental process state

Define unixware, Define UnixWare UnixWare manages resources at the proc...

Define UnixWare UnixWare manages resources at the process level. Each resource allocated to the application is actually allocated to the process representing the application. C

What is a reference string, What is a reference string? An algorithm is...

What is a reference string? An algorithm is evaluated by running it on a particular string of memory references and computing the number of page faults. The string of memory re

Explain additional-reference-bits algorithm, Additional-reference-bits algo...

Additional-reference-bits algorithm We can keep an 8-bit byte for every page in a table in memory. The operating system shifts the reference bits right 1 bit, discarding the lo

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