Operating system

1. Define the term process and differentiate between heavyweight and lightweight processes.
Assume that following jobs have arrived in the order 1,2,3,4 and 5:

Job Arrival Time Burst Time Priority

1 0 15 2
2 2 03 1
3 5 05 5
4 6 08 4
5 7 12 3

Give Gantt chart and calculate Avg. Turn-around Time and Waiting Time for:
i) FCFS ii) SJF scheduling and Preemptive priority algorithm.

2. a) Define a file system. What are various components of a file system? State and explain
various file allocation methods.
b) What problems could occur of system allowed a file system to be mounted
simultaneously at more than one location?

3. Write short notes on :

a) Distributed operating systems
b) Features of LINUX file system

4. (a) Write a detailed note on Device management policies.

(b) Explain the role of I/O traffic controller in detail

5. (a) Explain the concept of semaphores in detail.

(b) Explain in detail the concept of Multiprocessor Operating Systems.

6. Explain any two Page Replacement algorithms with a suitable example?

1
7. a) Write a note on the various services provided by the operating systems.
b) Explain in detail about the following CPU scheduling algorithms
(a) Shortest Job First
(b) Multilevel feedback Queue scheduling

8. a) Explain with an example the concept of shared pages in detail.

b) Write a brief note on Windows based operating Systems

9. Explain the security attacks on operating system. Write the steps to protect the computer
system from various attacks.

10. What are device management policies for storing data in operating System?

11. a. What are the advantages and disadvantages of multiprocessor systems?

b. What are the basic components of Linux?

12. a) What is role of scheduler? What requirement is to be satisfied for a solution of a

critical section problem?
b) Explain the use of I/O traffic controller in operating system.

13. Given the following information:

Job number Arrival time CPU cycle Priority

1 0 75 3
2 10 40 1
3 10 25 4
4 80 20 5
5 85 45 2

Draw a timeline for each of the following scheduling algorithms and determine which one
gives the best results.
1) FCFS
2) SJF

2
 3) Round Robin (using a time quantum of 15)
4) Priority scheduling.
Assume a small integer means higher priority.

14. a) Explain the concept of semaphores in detail.

b) Explain in brief about deadlock prevention

15. a) Explain in detail the concept of Multiprocessor Operating Systems.

b) Write a detailed note on role of I/O traffic controller.

16. What is the need of Page replacement? Consider the following reference string
7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1
Find the number of Page Faults with FIFO, Optimal Page replacement and LRU with four
free frames which are empty initially. Which algorithm gives the minimum number of page
faults?

17. a) Write a detailed note on Paging scheme of memory management.

b) Write a brief note on distributed operating system

18. a) Explain the different views of an operating system in brief.

b) Define the term deadlock. Explain various necessary conditions for a deadlock to
occur.

19. Write a detailed note on secondary storage structure.

20. Explain in detail the various Algorithms of Disk Scheduling with an example.

21. (a) Explain in detail the Layered Architecture of an OS.

(b) Write a brief note on Logical File System.
22. Explain any three Page Replacement algorithms with an example.

3
23. Write a detailed note on CPU scheduling criteria.
24. Explain in detail about views of an Operating System.
25. What causes a process/thread to change the state?
i. From running to ready?
ii. From ready to running?
iii. From running to blocked?
iv. From blocked to ready?