Hall Ticket Number: a i a ] Code No. : 15645 § N/O VASAVI COLLEGE OF ENGINEERING (AU TONOMOUS), HYDERABAD Accredited by NAAC with A++ Grade B.E. (1.T.) V-Semester ‘Supplementary Examinations, June-2023 Operating Systems Time: 3 hours Max. Marks: 60 Notes Answer all questions from PartA and any FIVE from Part-B Part-A (10 x 2 = 20 Marks) i Q.No, Stem of the question M L co po| ‘| List any Zour functionalities of operating system: By ieee ia 2. | What is the goal of short term scheduler? Baer te j 3+ | List any four advantages of non-contiguous memory allocation? Dae Bo ‘4. | What is thrashing? Give the reasons for thrashing, eae ee ene | 5. _ | Define race condition and explain with an example, Pa at a & | What are the necessary conditions for the occurrence of deadlock? aaa! y 7. | Give different methods for directory implementation. OF Deeiai' 8. | List different RAID Levels, ow 4 ay 9. | Give different components of a Linux system, aes alt 10. | How energy efficiency is achieved in Windows 7 System? a3 3 | Part-B (5 x 8 = 40 Marks) | 1. a) | What is the purpose of interrupts? How an interrupt dees is different froma] 4 3 4 4 ‘rap? How the traps are used by the user programs? »)| Given the following set of ren find the average waiting time,! 4 3 1 2 shell time and response time for(i) SRTF and (it) Round Robin ent f | Scheduling algorithms. (Assume time quantum of 3 units) | i Process burst | | L | Faoee ae | _P2 | P3 ae | Pa 35] ae | 12.8) [ Explain about the working of paging ayatem fo. main memory! $1 2 | momenment with a neat diagram. Derive an expression for Gfleune mmomory access time for a paging system with TLB. (No vistal memory) b) ca it following page reference sting 3421525746532 3.4 aa eae iat Biven four empty frames, find the number of page fale tha 2x2 oceur for each of the fe ‘IFO Gi) Optimal and (i) LRU page replacement clgorithms, | Conid... 2Code No. : 15645 S N/O. Desuribe dining philosophers’ problem and provide a deadlock free} 4 3 3 I | solution using semaphores. Prove the correctness of the solution. | by | Given the following snapshot of the system determine whether the system} 4 3 3 2 is in safe state or not. If process Pl generates a request <1, 2, O> for the resources, can this request be granted immediately? | Process | Allocation | Max | Availeble } | ABC |ABC|ABC | Pl 232\353/220 | w@ [a2 [aes rp | 222 [322 pa | 022 (242 | ps | 133 [244 14, a) | Give different file allocation methods and explain their relative advantages 4 Sue aut and disadvantages. ») | Consider a file system that uses inodes to represent files. Disk blocksere8| 4 3 4 KB in size, and a pointer to a disk block requires 4 bytes. This file system has 12 direct disk blocks, as well as single, double, anc! triple indirect disk blocks. What is the maximum size of a file that can te stored in this file system? 18. a) | Disease how Inter Process Communication is implemented in Linux. 41 1b) | Give different synchronization primitives available in a Windows 7 sy’ and explain in detail. 16. a) | Describe the issues that need to be considerec while designing) 4 1 1 1 1 multithreaded programs. | b) | Deseribe different LRU approximation page replacement algorithms. 42 2 1) | 17. | answer any vo of the following: 4) | Describe readers-writers problem and design a fair solwion. ae ee b) | How access matrix model can be used for implementing the protection her t system? Explain about the functionality of clone () system call of Linux in dvtail, | a2 8 1 M:Marks; L: Bloom's Taxonomy Level; CO; Course Outcome; PO: Programme Outcome ance [Blooms Taxonomy Level — Sl Ti)__| Blooms Taxonomy Level =2 {iit | Biooms Taxonomy Level=3 &4 | __ 42%