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!
How are file sharing and protection implemented?
To implement file protection and sharing, the system ought to maintain more file and directory attributes than are needed on a single - user system. The most generally used concept is file (or directory) owner (or user) and group. The owner is the user who is able to change attributes and who can grant access. The owner as well has the most control over the file.
The group attribute defines a subset of users who is able to share access to the file. The group IDs and owner of a file (or directory) are stored with the other file attributes. When a user (owner) requests an operation on a file the user ID can be evaluate with the owner attribute to determine if the requesting user is the owner of the file. Similarly, the group IDs is able to be compared. The result point to which permissions are applicable. The system after that applies those permissions to the requested operation and allows or denies it.
Define caching. A cache is a region of fast memory that holds copies of data. Access to the cached copy is well-organized than access to the original. Caching and buffering are
A page fault causes the following sequence to occur. 1. Trap (shut in) to the operating system. 2. Save the process registers and process state. 3. Verify that the interr
Explain FIFO page replacement A FIFO replacement algorithm associates with every page the time when that page was brought into memory. When a page must be changed, the oldest p
LINUX VS WINDOWS I/O MANAGEMENT
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
linked allocation using i node
As we have discussed, page tables map virtual page addresses to physical page addresses. One of the advantages of using virtual addresses is that we can achieve complete separation
Q. In the IBM/370 memory protection is offered through the use of keys. A key is a 4-bit quantity every 2K block of memory has a key (the storage key) associated with it. The CPU
Calculate the Average Waiting Time CPU burst time points out the time, the process needs the CPU. The subsequent are the set of processes with their respective CPU burst time (
define semaphore. how can we use semaphore to deal with n-process critical section problem.
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