Ges Sonlalllg usn | | 15CS64 Sixth Semester B.E. Degree Examination, Dec.2018/Jan.2019 Operating Systems Time: 3 hrs. Max. Marks: 80 Note: Answer any FIVE full questions, choosing ONE full question from each module. Modutle-1 1a. Distinguish between the following terms i) Multiprogramming and multitasking é i : 3 g 3 3 2, ii) Multiprocessor systems and clustered systems. (04 Marks) ¢ b. Analyze modular kernel approach with layered approach with a neat sketch. (06 Marks), 3 ¢. List and explain the services provided by OS for the user and efficient operation of system. ry (06 Marks) Bs @ Li OR ag ZS 2 a. _ilustrate with a neat sketch, the process states and process (08 Marks) ei b. Discuss the methods to implement message p: (08 Marks) Hf e pestle 3 a. Discuss the benefits of multithreaded programming. (04 Marks) gf b. Consider the following set of processes with CPU burst time (in ms), § § Process | Anival We [Bunt time | s & PL 0 6 3 Pa. dy = Ze P3 2 1 23 P4 3 {4 fe gz ‘Compute the waiting time and average tumaround time for the above process using FCFS, aa SRT and RR (time quantum = 2ms) scheduling algorithm (12 Marks) 2 z OR £4 a. Illustrate with examples the Peterson’s solution for critical section problem and prove that E the mutual exclusion property is preserved (08 Marks) b. Show how semaphore provides solution to reader writers problem. (08 Marks) 1of2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 S processes PO through P4 and 4 types of resources. At time Ty we have the following state : ‘Allocation Max ‘Available Process FATE B[C]D/A|B| CD Po jolo oli i2f1[s eyo Pp fifo 7T{s]0 Roo 3 [sl P;_ [ol6 6{5[2 [e. Tolo 6[sl6 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) Extemal and intemal fragmentation ji) Dynamic loading and linking. (04 Marks) b. Analyze the problem in simple paging technique and show how TLB is used to solve the probiem, (08 Marks) ¢. Given the memory partitions of 200k, 700k S00k, 300k, 100k, 400k. Apply first fit and best fit to place 315k, 427k, 250k, 550k (04 Marks) a. For the following page reference string 1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5. Calculate the page faults using FIFO and LRU for memory with 3 and 4 frames (08 Marks) ». 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 FCFS, STF, 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) 2of2draw diagonal cross lines onthe remaining blank pages. uator and/or equations writen ep, 42+8 = 50, wll be treated as malpractice. ly 2. Any revealing of identification, appeal to eva ing your answers, compuls Important Note: 1. On compl Ces Senlelils USN 15CS64 Sixth Semester B.E. Degree Examination, June/July 2019 Operating Systems Time: 3 hrs. Max. Marks: 80 Note: Answer any FIVE full questions, choosing ONE full question from each module. Module-1 1a. Explain the role of operating system from different viewpoints. Explain the dual mode of ‘operation of an operating system. (07 Marks) b. Demonstrate the concept of virtual machine with an example. (05 Marks) c. Explain the types of multiprocessing system and the types of clustering. (04 Marks) OR 2 a. Describe the implementation of interprocess communication using shared memory and ‘message passing. (06 Marks) b. Demonstrate the operations of process creation and process termination in UNIX. (06 Marks) c. Explain the different states of a process, with a neat diagram. (04 Marks) le-2 3 a. Discuss the threading issues that come with multithreaded program, (08 Marks) b. Illustrate how Reader’s-Writer’s problem can be solved by using semaphores. (08 Marks) OR 4 a Calculate the average waiting time by drawing Gantt chart using FCFS (First Come First Serve), SRTF (Shortest Remaining Time First), RR (Round Robin) [q = 2 ms] algorithms. Process | Arrival time | Burst time. Py 0 9 | PB I 4 Py 2 9 Py 3 5 (08 Marks) b. Explain the Dining-Philosopher’s problem using monitors. (08 Marks) 5 ‘a. Determine whether the following system is in safe state by using Banker's algorithm. Process | Allocation | Maximum | Available | A_B C/A B C/A BC Po o 1 0/7 5 3/3 3 2 Pp, }2 0 0/3 2 2 Py 3.0 2)9 0 2 PS 2.1 1]/2 2 2 Py 7. oes Ifa request for P; arrives for (I 02), can the request be granted immediately? (09 Marks) b. Discuss the various approaches used for deadlock recovery. (07 Marks) Lof210 15CS64 OR Illustrate with example, the internal and external fragmentation problem encountered in continuous memory allocation. (07 Marks) Explain the structure of page table. (09 Marks) Module-4 Illustrate how demand paging affects systems performance. (08 Marks) Describe the steps in handling a page fault (08 Marks) OR Explain the various types of directory structures. (08 Marks) Describe various file allocation methods. (08 Marks) Module-5 Explain the access matrix model of implementing protection in operating system. (07 Marks) Explain the following disk scheduling algorithm in brief with examples: i) FCFS scheduling ii) SSTF scheduling iii) SCAN scheduling iv) LOOK scheduling (09 Marks) OR Explain the components of LINUX system with a neat diagram. (08 Marks) Explain the way process is managed in LINUX platform. (08 Marks) 2o0f2SCHEME USN ] 15CS64 Sixth Semester B.E. Degree Examination, Aug./Sept. 2020 Operating Systems Time: 3 hrs. Max. Marks: 80 Note: Answer any FIVE full questions, choosing ONE full question from each module. Modu 1 Define operating systems. What are multiprocessor systems? Explain their three main advantages. (08 Marks) Compare multi-programming and time sharing systems. (05 Marks) Point out and explain the various operating system services. (06 Marks) OR 2 a. What are microkernals? Point out their advantages. (05 Marks) b. What are the two models of inter process communications? What are the strengths and weakness of the two approaches? (05 Marks) ©. Compare and contrast, short term, medium term and long ~ term scheduling, (06 Marks) Modute-2 3° a. Point out and explain the various benefits of multi threaded programming. (04 Marks) b. Consider the five processes arrive at time 0, in the order given, with the length of the CPU burst given in milliseconds. Process Burst time Pi 10 P> 29 Ps 3 Py 7 Ps 12 Consider the FCFS, SJF and RR (quantum = 10ms) scheduling, draw the Gantt chart for each of the scheduling, Determine average waiting time and tumaround time for all the 3 scheduling algorithm. Which algorithm would give the minimum average waiting time? (22 Marks) OR 4a ‘What is the critical section problem point out and explain its three requirements. (0S Marks) What are semaphores, explain how mutual exclusion is implemented with semaphores, (05 Marks) ‘What is Dimming philosopher problem explain its monitor solution, (06 Marks) 1of210 15CS64 Modute-3 ‘What are deadlocks? Point out and explain its necessary conditions. (04 Marks) plain the various methods of recovery from deadlock. (05 Marks) Consider a system with five processes Py through Py and three resources types A, B and C. Resource type A has 10 instances, resource type B has 5 instances and resource type C has 7 instances suppose that, at time Ty, the following snapshot of the system. ‘Allocation Max ‘Available alB{[CclaA[B/C/A[BIC (ePotitol7[st3i3[3 2 Pt2;olol3 {212 P13 ]o|219 [0]2 Pi2]1{1[2[2]2 Plolo[2/4[3]3 Draw the need matrix. The sequence is safe state or not. (07 Marks) OR Define paging. Explain paging hardware with a neat block diagram. (08 Marks) What is cementation? Explain basic method of segmentation with an example. (08 Marks) What is demand paging? Explain the steps in handling a page fault with a neat diagram, (08 Marks) Consider the following sequence 7,0, 1,2,0,3,0,4,2,3,0,3, 2, 1, 2,0, 1, 7,0, 1 How many page faults occurs with three page frames i) FIFO ii) Optimal page replacement iii) LRU page replacement algorithm. (08 Marks) OR What is a file? What are its attributes, explain file operations, (06 Marks) Explain what are the different types of files. (05 Marks) Explain file system mounting (05 Marks) Modute-5. Explain various disk scheduling algorithm with an example, (10 Marks) Explain access matrix protection system of O.S. (06 Marks) OR Explain the various. Components of the Linux system. (08 Marks) Explain the process management in Linux. (08 Marks) 2of2