For More Question Papers Visit - www.pediawikiblog.com 15CS64 Sixth Semester B.E. Degree Examination, June/July 2018 Operating Systems Time: 3 hrs. Max. Marks: 80 Note: Answer any FIVE full questions, choosing one full question from each module. Module-1 1a. Define Operating System. with a neat diagram, explain the dual-mode operation of operating system. (06 Marks) b. Explain the services of operating system that are helpful for user and the system, (06 Marks) ©. Define the following terms i) Virtual Machine ii) CPU scheduler i) System call iv) Context switch. (04 Marks) OR 2 a. With a neat diagram, explain the different states of a process. (05 Marks) b. Explain the layered approach of operating system structure, with supporting diagi (05 Marks) ¢. What is interprocess communication? Explain direct and indirect communication with respect to message passing system. (06 Marks) Module-2 3 a. Explain multithreading models, Also list the benefits of multithreaded programming (06 Marks) b. Consider the following set of processes given in table Arrival Time ] Burst Time | Processes Priority (m sec) (msec) Pi 0 10 4 P> 3 5 2 Ps 3 6 6 Pa 5 4 3 Consider larger number as highest priority. Calculate average waiting time and turn around time and draw Gantt chart for preemptive priority scheduling and preemptive SIF scheduling. (06 Marks) c. Explain multiprocessor scheduling (04 Marks) OR 4a, What are the requirements to critical section problem? Explain Peterson’s solution to critical section problem. (06 Marks) b. Explain Dining-philosophers problem with semaphores. (05 Marks) c. Explain the syntax and schematic view of monitors. (05 Marks) For More Question Papers Visit - www.pediawikiblog.com10 oe For More Question Papers Visit - www.pediawikiblog.com Consider the following snapshot of a system Allocation | Max __| Available AB C|A B C/A BC (Oe wie P{1 0 0}2 01 Pf1 3 5/1 3 7 Py) Gah) a2 pli_4 3]1 5 7 Find the need matrix and calculate safe sequence using Banker's algorithm, Mention the above system is safe or not safe (08 Marks) What are the necessary conditions for deadlock? Explain different methods to recover from deadlock. (08 Marks) OR What is paging? Explain paging hardware with translation look-aside buffer, (06 Marks) Explain the structure of page table with respect to hierarchical paging (06 Marks) Given the 5 memory partitions 100 KB, 500 KB, 200 KB, 300 KB and 600 KB, how each of the first fit, best fit and worst fit algorithms place processes of 212 KB, 417 KB, 112KB and 426KB size. Which algorithm makes efficient use of memory’? (04 Marks) Module-4 What is a page fault? With a supporting diagram explain the steps involved in handling page fault. (06 Marks) Consider the page reference string for a memory with three frames, how many page faults occur for FIFO, LRU and optimal page replacement algorithms. Which is most efficient? Reference string [7 01203 0423032120i1701 (06 Marks) Explain copy-on-write process in virtual memory (04 Marks) OR What are the different allocation methods in disk? Explain in detail any two methods. (06 Marks) List the different directory structure. Explain acyclic ~ graph directory and tree structured directory, (07 Marks) What is a file? Also list different file operations, (03 Marks) Module-5 List the different disk scheduling techniques, explain any two scheduling, considering the following disk queue requests. 98, 183, 37, 122, 14, 124, 65, 67 (06 Marks) What is an access matrix? Explain the different methods of implementing access matrix (06 Marks) Explain bad — block recovery in disk. (04 Marks) OR Explain the design principle of Linux. (06 Marks) Explain the process management in Linux platform, (06 Marks) Explain the interprocess communication mechanisms in Linux. (04 Marks) For More Question Papers Visit - www.pediawikiblog.com