Explain how semaphore solves the problem of critical section. [5]
2.
Explain memory-mapped I/O. [5]
File Management
1.
Find the seek time using SCAN, C-SCAN, Look and C-Look disk scheduling algorithms for processing the following request queue: 35, 70, 45, 15, 65, 20, 80, 90, 75, 130. Suppose the disk has tracks numbered from 0 to 150 and assume the disk arm to be at 30 and moving outward. [10]
2.
List different file structures and explain them. [5]
Linux Case Study
1.
Explain Inter-Process Communication in Linux. [5]
Memory Management
1.
Explain the translation of logical address into physical address using segment table with necessary diagram. List advantages and disadvantages of segmentation. [10]
2.
Consider a swapping system in which memory consists of the following hole sizes in memory order: 15 MB, 2 MB, 10 MB, 6 MB, 8 MB and 20 MB. Which hole is taken for successive segment requests of: (a) 10 MB (b) 10 MB For first fit, next fit and best fit. [5]
3.
Write short notes on: a. Virtual Memory b. Race Condition [5]
Operating System Overview
1.
Explain microkernels and exokernels. [5]
Process Deadlocks
1.
How do you think deadlock can be avoided? Explain. [5]
Process Management
1.
Explain the Sleeping Barber problem. Illustrate on how it can be solved. [10]
2.
Calculate the average waiting time and turnaround time using priority algorithm (Priority 1 being the highest) for the given scenario: