Q1. Let consider a system comprising of m resources of the similar type, being shared by n processes. Resources can be requested and released through processes just one at a time. Illustrate that the system is deadlock-free if the given two conditions hold:
a) The maximum requirement of each process is between 1 and m resources.
b) The sum of all maximum requirements is less than m + n.
Q2. Suppose that we encompass a paging system with page table stored in the memory. When a memory reference takes 200 ns, how long does a paged memory reference take? When we add associative registers and 75% of all page table references are found in associative registers, determine the effective memory reference time? Suppose that finding a page table entry in the associative registers takes zero time if entry is there.
Q3. prepare brief notes on the given:
a) Directing Implementation.
b) Network OS, Multiprocessor OS and Distributed OS.
c) Bernstein’s Condition for concurrency.