2 6 MAY 2022 ‘Time: 3 hours University of Mumbai minations Summer 2022 Program: Computer Engineering sme; CBGS / R-19 ( Carriewlum s Program No, : 1700734 ae: nation: SE Name of the Exam Subject paper Code: 40524 Course Name: Operating System T Choose the correct option for following questions. All the Questions are 1. Q compulsory and earry equal marks _ 7] When a computational speed and resource sharing is required and implemented through various full computer systems in a network, what OS should be chosen? Oplion Ay_| Real-time OS Option B:_| Distributed OS Option C [Embedded Option D:_| Batch OS 3, | Core oF operating system is Opiion Ar Shell ‘Option B_| Kernel Option ©] Commands Option: | Script — a 3 Which of the following state transi Gpiion Ar_| Blocked to running Option Br Ready to running Option C: | Running to Blocked OpiionD:_| Blocked to ready T— | Degree oF muliprogramming is characteristic of ‘Option Az_| Long Term Scheduler Option B: | Shor Term Scheduler ‘Option C:_| Medium Term Scheduler Option D:_| Dispatcher =-— The siualion where more than one processes access and update the same data Ticurrently and the resull depends on the sequence of execution in which i takes place is known as Option Ar_| Critical section 1| Page 286640990 48DET4AAAASB9ISOBSDBOC“Gion Option C: Option Which algorithm requires that the system must have some additional a priori information available about resources? — =: =| ‘Option A: [Option | Option: Option D> ce er from Belady"s Anomaly? Option A’ Option B [FIFO ‘Option C-—[ Optimal = None of the Abave g Which technique is used to overcome extemal fragmentation when Dynamic Partitioning is used during the process to memory allocation’? Option A” [Polling Option B: | Page fu = Option C: “| Context switch Option D:_| Compaction is not a file attributes? Time, date, and user identification Option B:_[ Name Option C:_| Truncate ‘Option D:| Protection or Permission 70, In algorithm, the disk head moves from one end to the other servicing requests along the way, when the head reaches the other end, it immediately returns to the beginning of the disk without servicing any requests ‘on the return trip, ‘Option Az [LOOK Option B: | C-LOOK ‘Option C: | C-SCAN ‘Option D:_ [SCAN Solve any Four out of Six S marks each Describe microkernel operating system structure. ‘What is the need of thread? Describe any four advantages of multithreading model. ate How to solve busy waiting problem? 2 | Page 28664990 148DET4AAAGSB9456BSD80CTO marks each | A Nove Higher mamaber is having higher priori | JF Preemptive Scheduling and Preemptive Priority ge waiting time, average tumaround time and average this scheduling algorithms, Tee necessary © suflsient conditions of deadlock. i B Suggest techniques te avoid deadlock “Ghen The menop pariion of 100 NB, 500 KB, 200 KB, 300 KB, and 600 | XB iin onder. how would the Fistfit, bestft and worstit algorithms place c OF Blatt? RB, P2-417 KB, P3-|12 KB and P4-126 KB (in order)? | Winch a govitha makes the most efficient use of memory? Use fixed size Dynamic partitioning method i Qs x [Sohe any Two Smarks each % Draw ang Explain Five sate process model ii Explain with te help of diagram how the system call wil be generated? Explain the effect of page size on performance: B Solve any One 10 marks each i i Describe Disk Scheduling algorithms with example I ik Explain File Allocation methods in detail I 3 | Page 28004990 SSDETIAAASSBISSHBSDBIC