CA5155 OPERATING SYSTEMS (REGULATION 2007) Time: Three hours Maximum: 100 marks

Answer all questions. PART A – [10 X 2 = 20 marks] 1.What do you mean by graceful degradation in multiprocessor systems? 2.What is system call? 3.What are the various states of a process? 4.Why CPU scheduling is required? 5.List the three requirements that must be satisfied by critical-section problem. 6.Define deadlock. 7.What do you mean by swapping technique? 8.State the principle of locality. 9.What is the use of file control block? 10.What are the free space management techniques? PART B – [5 X 16 = 80 marks] 11.(a) Discuss about the mainframe system. (8) (b) Explain the components of an operating system. (8) Or 12.(a) Explain about the distributed systems. (8)

P3. (8) Or 18.(b) Discuss the Operating System Services. P5. P2. a nonpreemptive priority (a smaller priority number implies a higher priority). with the length of the CPU – burst time given in milliseconds. (8) (b) Discuss the concept of demand paging. (8) (b) Explain the banker’s algorithm for solving deadlock problem. (16) Process Burst time Priority P1 10 3 P2 1 1 P3 2 3 P4 1 4 P5 6 2 The process are assumed to have arrived in order P1. (a) Explain the readers-writers problem using semaphores. SJF. (a) Compare long term. (8) (b) Discuss the various methods for deadlock recovery. (a) Explain the various contagious memory allocation strategies with suitable examples. (8) 17. short term and medium term process schedulers. (a) Explain the scheme for detecting deadlock. and RR (quantum = 1) scheduling. Consider the following set of processes. (8) Or 16. (8) 15. (b)What is the turnaround time of each process for each of the scheduling algorithm in part (a)? (c)What is the waiting time of each process for each of the scheduling algorithm in part (a)? Or 14. P4. (a)Draw four Gantt charts illustrating the execution of these processes using FCFS. (8) (b) Describe briefly about the Interprocess Communcation. all at time 0. (a) Consider the page-reference string : 2 3 2 1 5 2 4 5 3 2 5 2. (8) 13. How many page faults occur for .

assuming three frames? (12) (i) FIFO (ii) LRU (iii) Optimal (b) Write a short note on segmentation. (a) Explain the various methods of allocating disc space.the following replacement algorithms. What is the total distance (in cylinders) to satisfy these requests using the following disk-scheduling algorithms? (8) (i) SCAN (ii) LOOK (b) Discuss briefly the schemes for defining the logical structure of a directory. The queue of pending request is 86. The drive is currently serving a request at cylinder 143 and the previous request was at cylinder 125. (8) Or 20. numbered 0 to 4999. 130. 1022. (a) Suppose that a disk drive has 5000 cylinders. 1470. 948. 1774. (4) 19. 1750. 1509. (8) . 913.

Sign up to vote on this title
UsefulNot useful