Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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.
Enhanced Second chance algorithm In this a modify bit is as well used. Now if the ordered pair of reference and modify is (0,0) neither recently used nor modified - the best
Q. Data transfer between two processes? Communication: Data transfer between two processes is essential for some time. Both processes are on the one computer or on different
What lead to the concept of paging? The main memory is separated into two parts that are one for the resident operating system, and one for the user processes. We may perhaps p
General graph directory The serious problem with using an acyclic-graph structure is ensuring that there are no cycles. When we insert links to an existing tree-structured dire
What is a buddy system? We are dividing the memory as powers of two therefore the division will be 2, 4, 8, 16, 32, 64, 128, 256...i.e. in powers of 2 as well as we are selecti
Some people write custom memory allocators to meet their speci?c needs. Although this is not needed for most of the applications, it is also not uncommon. The goal, of course, is t
explain function of computer operating system?
Explain FIFO page replacement A FIFO replacement algorithm associates with every page the time when that page was brought into memory. When a page must be changed, the oldest p
what topic i choose for os research proposal
Let us consider the operation of the EPROM device in more detail. Consider the pining details below again Before we examine the interface means of the EPROM, it is worth
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd