For More Question Papers Visit - www.pediawikiblog.com 15CS64 Sixth Semester B.E. Degree Examination, Dec.2019/Jan.2020 Operating Systems Time: 3 hrs. Max. Marks: 80 oe Note: Answer any FIVE full questions, choosing ONE full question from each module. Module-1 ‘What is operating system? Explain multiprogramming and time sharing systems. (06 Marks) Explain dual mode operating in operating system with a neat block diagram. (05 Marks) ‘What are system calls? Briefly point out its types. (05 Marks) oR Explain process states with state transition diagram. Also explain PCB with a neat diagram. (06 Marks) ‘What is interprocess communication? Explain its types. (05 Marks) With a neat diagram, explain the concept of virtual machines. (05 Marks) Module-2 For the process listed below, draw Gantt charts using pre-emptive and non-preemptive priority scheduling algorithm. A larger priority number has a higher priority. Calculate Average Weighing Time and Average turnaround time. Arrival Time | Burst Time | Priority 0 6 4 3 5 2 3 3 6 5 5 3 (06 Marks) Is CPU scheduling necessary? Discuss the five different scheduling criterias used in the computing scheduling mechanism. (05 Marks) Explain multithreading models. (05 Marks) OR Define semaphores. Explain its usage and implementation. (06 Marks) Explain Reader-Write problem with semaphore in detail (05 Marks) What are monitors? Explain dining Philospher’s solution using monitor. (05 Marks) System consists of five jobs (J), J2, Jy Jay Js) and three resources (Ry, R2, Rs). Resource type Ry has 10 instances, resource type Ro has 5 instances and R; has 7 instances. The following snapshot of the system has been taken. Jobs | Allocation | Maximum | Available Ri [Ro [Rs | Ri | Re | Rs [Ri | Ro Rs K fo li fo v7 fs ]3 fs 73 f2 th |2 |o fo |3 2 |2 ts |3 [0 [2 |9 Jo |2 de f2 fa fa f2 f2 42 ts_|o jo |2 [4 |3 |3 _ Find need matrix and caleulate the safe sequence by using Banker's algorithm. Mention the above system is safe or not safe. (06 Marks) For More Question Papers Visit - www.pediawikiblog.com10 b. oP ve For More Question Papers Visit - www.pediawikiblog.com What is dead lock? What are necessary conditions an operating system must satisfy for a dead lock to occur? (05 Marks) What is a Resource Allocation Graph (RAG)? Explain how RAG is very useful is describing deadly embrace by considering own example. (05 Marks) OR What are Translation Load aside Buffer (TLB)? Explain TLB in detail with a simple paging system with a neat diagram. (06 Marks) Given the memory partitions of 100 K, 500 K, 200 K, 300 K and 600 K apply first fit, best fit and worst fit algorithms to place 212K, 417K, 112K and 426K. (0S Marks) Describe both internal and external fragmentation problems encountered in a contiguous memory allocation scheme. (05 Marks) Module-4 Consider the following page reference stream: 7, 0, 1, 2, 0. 3, 0, 4, 2, 3,0, 3. 2,1, 2,0, 1,7, 0, 1. How many page faults would occur for LRU and FIFO replacement algorithms assuming 3 frames? Which one of the above is most efficient? (06 Marks) Explain demand paging system (05 Marks) What is thrashing? How can it be controlled? (05 Marks) OR Explain briefly the various operations performed on files, (06 Marks) Explain the various access methods of files. (05 Marks) Explain various allocation methods in implementing file systems. (05 Marks) Module-5 Explain the various Disk Scheduling algorithms with example (08 Marks) Explain access matrix method of system protection, (08 Marks) OR With a neat diagram explain in detail components of a Linux system. (06 Marks) Explain the different IPC mechanisms available in Linux. (05 Marks) Explain process scheduling in a Linux system. (05 Marks) For More Question Papers Visit - www.pediawikiblog.com