CoS Scilelle J 15CS64 USN Time: 1 sa. b. c 2 a b. 3a b. 62 B44 b. Sixth Semester B.E. Degree Examination, Dec.2018/Jan.2019 Operating Systems 3 hrs Max. Marks: 80 Note: Answer any FIVE full questions, choosing ONE full question from each module. Module-1 Distinguish between the following terms i) Multiprogramming and multitasking ii) Multiprocessor systems and clustered systems. (04 Marks) Analyze modular kernel approach with layered approach with a neat sketch (06 Marks) List and explain the services provided by OS for the user and efficient operation of system (06 Marks) OR Illustrate with a neat sketch, the process states and process control block. (08 Marks) Discuss the methods to implement message passing IPC in detail. (08 Marks) Module-2 Discuss the benefits of multithreaded programming. (04 Marks) Consider the following set of processes with CPU burst time (in ms) Process | Arrival time | Bunt time [Pr 0 6 P2 1 — PS 2 1 Pa | 3 4 Compute the waiting time and average tumaround time for the above process using FCFS, SRT and RR (time quantum = 2ms) scheduling algorithm (12 Marks) OR Illustrate with examples the Peterson’s solution for critical section problem and prove that the mutual exclusion property is preserved (08 Marks) Show how semaphore provides solution to reader writers problem, (08 Marks) lof25 10 15CS64 Module-3 a, Define deadlock. Write short notes on 4 necessary conditions that arise deadlocks. (06 Marks) b. Assume that there are 5 processes PO through P4 and 4 types of resources. At time Ty we have the following state : é Allocation Max Available roesss TA|B|C|D]A]B|C|D|A|B|C[D Pp |ololi[2fololi[2]i[sfzlo Pp, [i folofofi[7{slo P, [1[3[s{4[2]/3|5 [6 Pp; [olée(3]2[0[6|5|2 Pp, [o|o|1[4[o[6|5[6 Apply Banker’s algorithm to answer the following i) What is the content of need matrix? ii) Is the system in a safe state? iii) Ifa request from a process P1(0, 4, 2, 0) arrives, can it be granted? (10 Marks) oR a. Write short notes on i) External and intemal fragmentation ii) Dynamic loading and linking, (04 Marks) b. Analyze the problem in simple paging technique and show how TLB is used to solve the problem. (08 Marks) c. Given the memory partitions of 200k, 700k 500k, 300k, 100k, 400k. Apply first fit and best fit to place 315k, 427k, 250k, 550k (04 Marks) Modute-s a, For the following page reference string 1, 2, 3, 4, 1, 2, 5, 1, 2,3, 4, 5. Caleulate the page faults using FIFO and LRU for memory with 3 and 4 frames. (08 Marks) b. Explain demand paging in detail (08 Marks) OR a. What do you mean by free space list? With suitable example, explain any 3 methods of free space list implementation, (08 Marks) b. Write short notes on linked and indexed allocation method with a neat diagram. (08 Marks) Module-5 a. Given the following sequences 95, 180, 34, 119, 11, 123, 62, 64 with the head initially at track 50 and ending at track 199, What is the total disk traveled by the disk arm to satisfy the request using FCPS, SSTE, LOOK and CLOOK algorithm, (12 Marks) b. Write short notes on access matrix and its implementations (04 Marks) oR a. Explain the components of Linux system with a neat diagram, (08 Marks) b. Describe briefly on Linux Kemel modules. (08 Marks) err) 2of2