Time : 3 hours Answer ALL Questions PART-A 10x2 = 20 marks Max. marks : 100

1. Mention any two essential properties of real time systems. 2. Processes call the operating system with system call interrupt instructions. Why can’t processes make ordinary procedure calls to the operating systems? 3. What is meant by the context of a process? 4. Mention the methods for deadlock recovery in a system. 5. Consider the following set of processes, with the length of the CPU-burst time and the arrival time given in milliseconds: Process Arrival Time Burst Time ______ ___________ __________

P1 P2 P3 P4 P5

0 10 10 80 85 40 25


20 45

a. Draw a Gantt chart illustrating the execution of these processes using preemptive SJF scheduling algorithm.

6. What is the relationship between program locality and TLB hit rate? 7. What is Belady’s anomaly?

(i) Explain the MS-DOS system structure with a neat diagram. If a customer enters the barbershop and all chairs are occupied. 10. (2) c.0) can the request be granted immediately? (4) (iii)Distinguish between short term. and 426K (in order)? Which algorithm makes the most efficient use of memory? (8) (ii) Write down the different issues in real time scheduling. If the barber is busy but chairs are available. List the main components of a Linux system. What is thrashing? 9. Is the system in a safe state? If yes. 112K.2. (i) Given memory partitions of 100K. (8) (8) 12. (a) (i)Describe the actions taken by a kernel to context switch between kernel-level threads. Mention the advantages and disadvantages of continuous allocation of files. (8) . (4) (ii) Consider the following snapshot of a system: Allocation Max Available __________ ____ ________ ABCD ABCD ABCD P0 P1 P2 P3 P4 0 1 1 0 0 0 0 3 6 0 1 0 5 3 1 2 0 4 2 4 0 1 2 0 0 0 7 3 6 6 1 5 5 5 5 2 0 6 2 6 1 5 2 0 Answer the following questions using the banker’s algorithm. and 600K (in order). the barber goes to sleep. PART-B 5x16 = 80 marks 11. (8) (ii) A barbershop consists of a waiting room with n chairs and the barber room containing the barber chair. then the customer sits in one of the free chairs. and Worst-fit algorithms place processes of 212K.4. Write a program to coordinate the barber and the customers. What is the content of matrix Need? (2) b. (8) 13. 500 K. a. the customer wakes up the barber. long term and medium term scheduling. a. 200 K. then the customer leaves the shop. give the safe sequence. how would each of the First-fit. Best-fit.(4) OR b) (i) How does a semaphore solve the critical section problem? Discuss whether semaphores satisfy the three requirements for a solution to the critical section problem.8. 417K. (ii) Write notes on Hardware protection. If there are no customers to be served. If the barber is asleep. If a request from process P1 arrives for (0.

(16) OR b. First Come First Served. a. What is the cause of thrashing? Explain the methods by which thrashing could be controlled. Give the advantages and disadvantages of this variant over ordinary round-robin. (i)Explain segmentation with a neat diagram. In progressive round-robin. (16) 15. and increases by 50 ms each time it goes through the round-robin queue. each process has its own time quantum. (8) (ii) Consider a variation of round-robin we will call progressive round-robin. (16) OR b. Discuss on the following disk scheduling algorithms: Shortest Seek Time First.LOOK. C. (8) 14. a. This starts out at 50 ms.OR b. (16) . Describe different schemes for defining the logical structure of a directory. Explain briefly how process management is done in Linux. SCAN.

Master your semester with Scribd & The New York Times

Special offer for students: Only $4.99/month.

Master your semester with Scribd & The New York Times

Cancel anytime.