Protection scheme in unix, Operating System

Assignment Help:

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.


Related Discussions:- Protection scheme in unix

Modern os, importance of Operating system in modern computers. Also explain...

importance of Operating system in modern computers. Also explain various functions & types of operating systems

Allocating new pages, Processes have valid and invalid entries on their pag...

Processes have valid and invalid entries on their page tables. The valid entries all point to some where "real" (e.g. a physical page, or some portion of disk in case of non-reside

Problem, whats the problem in two state model ?

whats the problem in two state model ?

Evolution of operating system, breifly write a note on about evolution of o...

breifly write a note on about evolution of operating system?

Logic gates, Determine the equation for the y and truth table for the circu...

Determine the equation for the y and truth table for the circuits

Explain process states in the unix system, Process States A total of n...

Process States A total of nine states are acknowledged by the UNIX system. They are like as follow: User running                                                   Executing

Define busy waiting and spinlock, Define busy waiting and spinlock. Whe...

Define busy waiting and spinlock. When a process is in its significant section, any other process that tries to enter its critical section must loop continuously in the entry c

Microsoft, Discuss the high barriers to entry in the market for PL operatin...

Discuss the high barriers to entry in the market for PL operating systems

Explain enhanced second-chance algorithm, Enhanced second-chance algorithm....

Enhanced second-chance algorithm. When we increase the second-chance algorithm by considering both the reference bit and the modify bit as an order pair. We have the following

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