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

Most wans utilize only a partially connected topology, Q. Most WANs utilize...

Q. Most WANs utilize only a partially connected topology. Why is this subsequently Answer: Cost. A completely connected network requires a link between every node in the netw

What are the functions of virtual file system (vfs), What are the functions...

What are the functions of virtual file system (VFS)? a. It separates file-system-generic operations from their execution defining a clean VFS interface. It permits transparent

What do you mean by system calls, What do you mean by system calls? Sys...

What do you mean by system calls? System calls give the interface among a process and the operating system. When a system call is implemented, it is treated as by the hardware

MICROKERNEL, ADVANTAGES OF MICROFERNEL IN YSTEM DESIGN?

ADVANTAGES OF MICROFERNEL IN YSTEM DESIGN?

Explain deadlock avoidance, Deadlock Avoidance It's a method to evade ...

Deadlock Avoidance It's a method to evade deadlock by careful resource scheduling. This approach to the deadlock problem foresees deadlock before it actually occurs. This a

Beladys anomaly algorithm, Q.  You have devised a fresh page-replacement a...

Q.  You have devised a fresh page-replacement algorithm that you think may be optimal. In a few contorted test cases Belady's anomaly occurs. Is the fresh algorithm optimal? Descr

Explain about paging, Explain about paging? Answer: Paging is a memory-...

Explain about paging? Answer: Paging is a memory-management scheme that permits the physical-address space of process to be noncontiguous. Paging avoids the considerable proble

Explain lru additional reference bits algorithm, Additional Reference bits...

Additional Reference bits algorithm Here we keep an 8-bit byte for every page in memory. At standard intervals the reference bit is shifted by the OS. If a shift register conta

GIS, 1. The City of Boston needs to be about 2 acres of green space per 1,0...

1. The City of Boston needs to be about 2 acres of green space per 1,000 persons. You have been hired as the GIS expert by an independent consulting company to determine where the

Describe virtual memory, What is virtual memory? Virtual memory is a me...

What is virtual memory? Virtual memory is a method that allows the execution of processes that might not be completely in memory. It is the separation of user logical memory fr

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