a) Define an operating system. What are the goals of an operating system? Explain. (Unit 1)

b) Describe the differences among short term, medium term and long term scheduling. (Unit 3)

a) What is meant by system call? How it can be used. How does an application program use these call during execution? (Unit 1)

b) Define Process States. Draw the diagram of PCB. (Unit 3)

a) Suppose that a disk drive has 200 cylinders, numbered 0 to 199. The work queue is: 23, 89, 132, 42, 187. Determine the total distance for the following disk scheduling algorithms:
i) Scan
ii) Look (Unit 2)

b) List the advantages and disadvantages of Magnetic Tape memory. (Unit 2)

a) Explain in detail about various ways of free space management. (Unit 2)

b) What is the difference between threads and process. (Unit 3)

a) Explain paging and segmentation. How are they helpful in removing fragmentation? (Unit 3)

b) What do you mean by deadlock prevention? A computer has six tape drive with a processes competing for them. Each process need two tape drives for which values of n the system is deadlock free. (Unit 4)

a) Explain mutual exclusion with suitable example. (Unit 4)

b) Discuss Reader-Writers solution using Monitors. (Unit 4)

a) Explain file system used in Linux and Windows. (Unit 5)

b) What is a file? Briefly explain different directory structures. What kind of directory structure is used in UNIX? (Unit 2)

Write short notes:
a) Concurrent Programming (Unit 4)
b) Virus (Unit 5)
c) Remote Procedure Call (RPC) (Unit 5)
d) Time Sharing (Unit 1)