Q1. Let consider a system having ‘m’ resources of the similar type being shared by ‘n’ processes. Resources can be requested and liberated by processes just one at a time. Illustrate that the system is deadlock free if the two conditions hold:
a) Maximum need of each process is between 1and m resources.
b) Sum of all maximum needs is less than m + n.
Q2. Round robin schedulers usually maintain a list of all runnable processes, with each process taking place exactly once in the list. Explain what would happen if a process occurred twice in the list? Can you think of any reason for permitting this?
Q3. In paged segmented system, a virtual address comprises of 32 bits of which 12 bits are displacement, 11 bits are segment number and 9 bits are page number. Compute:
a) Page size
b) Maximum segment size
c) Maximum number of pages
d) Maximum number of segments.
Q4. Describe the Symbolic address, Relocatable address, Absolute address in the memory management with illustration.