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. Consider a system that holds 5000 users. Presume that you want to allow 4990 of these users to be able to access one file.
a. How would you denote this protection scheme in UNIX?
b. Could you propose another protection scheme that is able to be used more effectively for this purpose than the scheme provided by UNIX?
Answer:
a. There are two processes for achieving this:
1. Create an access control record with the names of all 4990 users.
2. Put these 4990 users in one group as well as set the group access accordingly. This scheme can't forever be implemented since user groups are restricted by the system.
b. The universal access to records applies to every user unless their name appears in the access-control list with different access permission. With this scheme you merely put the names of the remaining ten users in the access control list but with no access privileges allowed.
explain dynamic patrician stratagies
What are the necessary conditions for deadlocks? 1. Mutual exclusion : Only one process at a time is able to use the resource. 2. Hold and wait : A process should be holdi
Determine a scheduling policy that is most suitable for a time-shared operating system Round-Robin is a scheduling policy that is most suitable for a time-shared operating s
Q. Compare the utilization of networking sockets with the use of shared memory as a mechanism for communicating data between processes on a single computer. What are the merits of
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
Define Enforcing Modularity for C Additionally, in C it is sometimes necessary to create modularity of design. C++ is very natural model for component based application design
Describe swapping technique in UNIX systems. Swapping is used to control memory contention among processes. If there is excessively much memory contention, processes are swappe
What is the Translation Lookaside Buffer (TLB) In a cached system, the base addresses of the last few referenced pages is maintained in registers known as the TLB that aids in
What is a reference string? An algorithm is evaluated by running it on a particular string of memory references and computing the number of page faults. The string of memory re
Explain about demand paging? A demand paging system is same to a paging system with swapping. Processes reside on secondary memory. When we require executing a process, we chan
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