1.a. Elaborate the functions of operating system.

1.b. Specify the role of scheduler in operating system.

2.a. State command line arguments in shell with example.

2.b. Differentiate between user - level and kernel - level threads

3.a. Describe in brief different IPC mechanisms.

3.b. Explain following terms:

i. Critical Section.

ii. Race Condition

4.a. Write a semaphore solution for readers - writers problem.

4.b. Explain with an appropriate example, how resource allocation graph determines a deadlock.

5.a. For the following reference string.

6,5,1,2,5,3,5,4,2,3,6,3,2,1,2

Count the number of page faults that occur with 3 frames using FIFO, Optimal and LRU page replacement methods. Discuss the result.

5.b. Explain segmentation with suitable diagram

6.a. Free memory holes of sizes 15K, 10K, 5K, 25K, 30K, 40K are available. The processes of size 12K, 2K, 25K, 20K are to be allocated. How processes are placed using first fit, best fit and worst fit partitioning algorithm. Calculate internal and external fragmentation.

6.b. Explain the concept of virtual memory with suitable diagram

7.a. A disk drive has 200 cylinders, numbered 0 - 199. The drive is currently serving the request at cylinder 63. The queue of pending requests in FIFO order is 27,129,110,186,147,41,10,64,120. Starting from the current head position what is the total distance that disk arm moves to satisfy all the pending requests for the following disk scheduling algorithms.

i. FCFS

ii. C - SCAN

iii. C - LOOK

iv. SSTF

7.b. Explain I/O buffering mechanism.

8.a Write a short note on the following

i. Directory Structure

ii. File sharing

8.b. Explain free space management technique.

9.a. Explain in detail Linux Booting process.

9.b. List and explain different inter - process communication mechanisms in Linux operating system

10.a. Memory Management in Linux

10.b. Linux File system

10.c. Kernel Modules

10.d. Process Scheduling in Linux