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!
Q. Could you replicate a multilevel directory structure with a single-level directory structure in which arbitrarily long names can be used? If your answer is yes describe how you can do so and contrast this scheme with the multilevel directory scheme. If your answer is no then describe what prevents your simulation's success. How would your answer alter if file names were limited to seven characters?
Answer: If arbitrarily long names are able to be used then it is possible to simulate a multilevel directory structure. This is able to be done for example by using the character "." to point out the end of a subdirectory. Therefore for example the name jim.java.F1 identify that F1 is a file in subdirectory java which in turn is in the root directory jim. If file names were restricted to seven characters then the above scheme couldn't be utilized and thus in general the answer is no. The next best approach in these circumstances would be to use a specific file as a symbol table (directory) to map arbitrarily long names (such as jim.java.F1) into shorter arbitrary names (such as XX00743) which are then utilized for actual file access.
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 excl
Q. The Sun Ultra SPARC processor has numerous register sets that describe the actions of a context switch if the new context is previously loaded into one of the register sets. Wha
Explain in detail about ipc in linux
Define seek time and latency time. The time taken by the head to move to the appropriate cylinder or track is known as seek time. Once the head is at right track, it must wait
Explain the general structure of a typical process? There are basically four main sections through which each of the process has to pass through.The universal algorithm is:-
linked allocation using i node
Define the difference between preemptive and nonpreemptive scheduling. State why strict nonpreemptive scheduling is unlikely to be used in a computer center. Preemptive schedul
example of first fit best fit and worst fit
Q. The accelerating search for described in subsequent exercise is typical of hard-disk drives. By contrast floppy disks and several hard disks manufactured before the mid-1980s t
Explain the concept of Reentrancy? It is a useful, memory-saving method for multiprogrammed timesharing systems. A Reentrant Procedure is one in which many users can share a si
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