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

Cosled loop, What are the two principles in Hungarian method?

What are the two principles in Hungarian method?

Starvation, what do you mean by starvation?explain in detail

what do you mean by starvation?explain in detail

Shared stack is used for parameter passing, Q. What protection problems may...

Q. What protection problems may occur if a shared stack is used for parameter passing? Answer: The contents of the stack could be conciliation by other process(es) sharing th

Define ageing, Define Ageing Ageing is a method of enhancing the priori...

Define Ageing Ageing is a method of enhancing the priority of process waiting in Queue for CPU allocation

Multilevel queue scheduling algorithm suffer from starvation, 1. Suggest so...

1. Suggest some mechanism(s) to lower the dispatch latency while scheduling for a real-time system. Also, discuss any trade-off or consequent constraint associated with it, if a

Tlb replacement algorithm, Suppose a logical address space is 1KB, and the ...

Suppose a logical address space is 1KB, and the page-size is 16 bytes. Assume no page is in the main memory for this process initially and the pure demand paging is used. Current f

Assignment, You must use fork and pipe to complete this project. This proj...

You must use fork and pipe to complete this project. This project creates processes to add all numbers in a file. The user will enter a number (1, 2, or 4) of parallel processes

Write a short note on disk structure, Write a short note on disk structure ...

Write a short note on disk structure Modern disk drives are initiate as large one dimensional array of logical blocks where the logical block is the smallest unit of transfer.

Explain about threading issues, Explain about threading issues? The for...

Explain about threading issues? The fork and exec system calls In a multithreaded program of few UNIX systems have chosen to have two versions of fork, one that duplicates e

Define semaphore, Define semaphore A semaphore is a protected abstract ...

Define semaphore A semaphore is a protected abstract or variable data type that constitutes the classic method for restricting access to shared resources like shared memory in

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