Swarnandhra
Swarnandhra
(OR)
4 a) Does preemptive scheduling give same performance as non-preemptive K3 7M
scheduling algorithm? Compare their performance by assuming at least 5
processes arrived at different time intervals
b) Demonstrate FIFO and Round Robin CPU scheduling algorithms with suitable K2 7M
example.
5 a) What is the critical section? What are the minimum requirements that should be K3 7M
satisfied by a solution to critical section problem?
b) Write and explain the solution for Reader-Writer classical synchronization K2 7M
problem using monitors.
(OR)
6 a) How characterize the structure of deadlock? Explain the two solutions of K4 7M
recovery from deadlock
b) Explain the techniques used to prevent the deadlocks. K2 7M
7 a) Explain various types of memory Allocation techniques with advantages and K2 7M
disadvantages with example.
b) Compare and contrast free space management and swap space management. K4 7M
(OR)
8 a) Define Virtual Memory. Explain the process of converting virtual addresses to K2 7M
physical addresses with a neat diagram.
b) A disk drive has 200 cylinders, numbered 0 to 199. The drive is currently serving K4 7M
a request at cylinder 53. The queue of pending requests, in FIFO order, is 98,
183, 37, 122, 14, 124, 65, 67. Starting from the current head position, what is the
total distance (in cylinders) that the disk arm moves to satisfy all the pending
requests for each of the following disk-scheduling algorithms?
i) FCFS
ii) SSTF
iii) SCAN
iv) LOOK
v) C-SCAN
vi) C-LOOK.
9 a) Discuss in detail about Linux design principles. K2 7M
b) Write about windows 7 file system. K3 7M
(OR)
10 a) Explain briefly about components of Windows 7 system. K2 7M
$$$$$