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!
Acyclic Graph Directories
In this kind of directory structure the shared directories or files can exist in the file system in two or more places at once. A tree structure excludes the sharing of files or directories. An acyclic graph namely a graph with no cycles allows directories to share subdirectories and files. The acyclic graph is a usual generalization of the tree structured directory scheme. It is more flexible in comparison of a simple tree, but it is as well more complex.
A directory or shared file isn't the same as two copies of the same file or directory. With two copies if one copy is changed subsequently the changes will not be reflected in the other copy. With a shared file, the alterations made by one person are immediately visible to the other. Sharing is a significant concept for subdirectories. A fresh file created by one person will automatically come into view in all the shared subdirectories.
Implementation:
Directories and Shared files can be executed by creating a new directory entry called link which points to another subdirectory or file. When a reference to a file is made then the directory is searched. If the directory entry is marked like a link after that the name of the real file is included in the link information. The link is resolve by using the path name to locate the real file.
Another method is to copy (duplicate) all information about shared files in both the sharing directories.
Acyclic Graph directory structure
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 s
Explain about file allocation methods? The main problem in direct-access nature is how to assign space to these files so that disk space if utilized effectively and files can b
Explain about deadlock prevention? In order for the occurrence of deadlock, the four conditions like mutual exclusion, hold and wait, no pre-emption and circular wait must hap
How exactly is a page table used to look up an address? The CPU has a page table base register (PTBR)which points to the base (entry 0) of the level-0 page table. Each process h
Contiguous allocation: Every file will be allocated contiguous space in the memory. Allow the block size be 1K If a 50K files desires to be allocated space after t
#question After working for 30 years, Ramjee Somjee Dutt opted for VRS and started a courier company and did very well in the first four years. He was now looking for expansion of
Q. Consider a distributed system with two sites A and B. Consider whether site A can distinguish among the following: a. B goes down. b. The link between A and B goes down.
Explain the Application Interaction Protocols Application interaction protocols are uniquely defined for each program and are used to logically describe the data being passed b
Q. Polling for an I/O completion is able to waste a large number of CPU cycles if the processor iterates a busy-waiting loop several times before the I/O completes. However if the
Determine the task of the Pass II In a two-pass assembler Synthesize the target program is the task of the Pass II
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