Explain acyclic-graph directories, Operating System

Assignment Help:

Acyclic-graph directories

An acyclic graph permits directories to have shared subdirectories and files. The similar file or subdirectory may be in two dissimilar directories. A shared file is not the similar as two copies of the file. With the shared file, only one definite file exists, so any changes made by single person are immediately visible to other. Shared files and subdirectories can be executed in several ways. In UNIX shared files are executed by create a new directory entry known as a link. A link is effectively a pointer to another file or subdirectory.

 


Related Discussions:- Explain acyclic-graph directories

Can we call trap as an interrupt??, is there any difference between the tra...

is there any difference between the trap and interrupt??

Algorithm for reconstructing a logical ring, Q. Present an algorithm for re...

Q. Present an algorithm for reconstructing a logical ring after a process in the ring fails? Answer: Typically distributed systems utilize a coordinator process that performs

Define logical address and physical address, Define logical address and phy...

Define logical address and physical address. An address formed by the CPU is referred as logical address. An address seen by the memory unit that is the single loaded into the

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

example of first fit best fit and worst fit

File management, five major activities on file management in operating syst...

five major activities on file management in operating system.? Explain it.?

Difference between two tier and three tier architectures, Question: a) ...

Question: a) Illustrate with the help of a diagram, the difference between two tier and three tier architectures. b) Explain in what kind of environment, a peer to peer envi

Operating systems, Ask using a laballed diagram explaining the architecture...

Ask using a laballed diagram explaining the architecture of windows operating ststem

Explain lru enhanced second chance algorithm, Enhanced Second chance algori...

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

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