Ibe treated as malpractice. written og, 42:8 ~ 5, $ ly draw diag four answers, compulsoril 2. Any revealing of identification, appeal 1 evaluator and ‘ore Important Note : 1. On complet cSN 10CSS3 Time: 3 hrs. Max. Mark: oP b © Fifth Semester B.E. Degree Examination, December 2012 Operating Systems Note: Answer FIVE full questions, selecting atleast TWO questions from each part. PART-A What is a distributed operating system? What are the advantages of the distributed operating system? (06 Marks) What are system calls? With examples explain different categories of system calls. 07 Marks) With a neat diagram, explain the concept of virtual machine. (07 Marks) Explain the process aic transition diagram. (06 Marks) Explain multithrea (09 Maris) Tor the processes listed below, draw Gantt charts using preemptive and non preemptive priority scheduling algorithm. A larger priority number has a higher priority Arrival time [Burst time | Priorit 9 = See Downloat pmiZShikshacom | What is busy waiting in a critical section concept? How semaphore is used to solve critical (05 Marks) section problem? What are the advantages of semaphore? (10 Maris) What is a monitor? Explain the solution to the classical dining philosopier’s problem, using monitor. (10 Maris) What is a resource allocation graph(RAG)? Explain how RAG is very useful in deseribing ceadly embrace by considering your own example. (08 Marks) System consists of five jobs (1h, Jo. Js, Jr. Is) and three resources (Rj, Re Rs). Resource type Ry has 10 instances, resource type Ro has 5 instances and R3 has 7 instances. The following snapshot of the system has been taken : Jobs |_Alloecation [Maximum [Available _ | RR Re [RI R2 BBR RB ti 0 1 0 7 5 3 3 3 bh/]2 0 0/3 2 2 Ih 3 0 IL q 0 2 hl2 1 1/2 2 2 Kilo oo 2/4 3 3 Find need matrix and calculate the safe sequence by using Banker's algorithm, Mention the above system is safe or not safe (08 Marts) Briefly explain the methods for bandling deadlocks. (04 Marks) 1of26 PART-B Distinguish between : i) Logical versus physical address space ii) Paging versus segmentation iii) First fit and best fit algorithms. (07 Marks) Mention the problem with simple paging scheme. How TLB is used to solve this problem? Explain with supporting hardware diagram and with an example. (08 Marks) system using simple segmentation, compute the physical address for cach of the logical logical address is given in the following segment table. If the address generates a segment fault, indicate it as “segment fault” Segment [Base [Length 0 | 330 124 i 76 | 211 2 ll 9 3 498 | 302 1)0,9,9 ii) 2,78 iii) 1, 265 iy) 3,222 ©) OTT. (OS Marks) Explain briefly different file types. (04 Marks) Explain the different types of directory structures, with examples end mention their advantages and disadvantages. (O8 Marks) With supporting diagrams, explain linked and indexed method of allocating disk space. OWHioaded ROM AoA Shikeshiaceon (08 Marks) Explain the following disk scheduling algorithms in brief SSTF ii) SCAN iii) LOOK. Explain in brief, the selection of a disk scheduling algorithm, What is protection? Distinguish between mechanisms and policies. Explain briefly the access mairix with domains as objects. (07 Marks) Write short notes on (any four) Linux history Linux design principles Components of a Linux system Optimal page replacement algorithm Steps in handling page fault (20 Marks) ween 2of2blank pages. draw diagonal mupleting youir answers, comple usw | | l 06C853 Fifth Semester B.E. Degree Examination, December 2012 Operating Systems Time: 3 hrs, Max. Marks:100 Note: Answer FIVE full questions atleast TWO questions from each part. PART-A Define an operating system, Discus its role with respect to user and system viewpoints (06 Marks) Briefly explain the clustered systems and real time systems. (04 Marks) Define a virtual machine. With a neat sketch, explain the working of a virtual machine. What are the benefits of virtual machine? (10 Marks) What is a process? With a state diagram, explain states of a process, Also write the structure of process control block. (08 Marks) Discuss the three common ways of establishing relationship between user and kernel threads, (06 Marks) b. oP For the following set of processes, find the average waiting time and average turn around time along with Gantt chart illustrations for i) Shortest remaining time first ii) Preemptive priority scheduling algorithms (06 Marks) Process | Burst time | Arrival time [Pri PL 6 | 2.0 Define mutual exclusion and critical section. Write the software solution for 2 — process synchronization. (07 Marks) What is semaphore? Explain how it can be used to solve the producer ~ consumer problem: (07 Marks) Explain the solution to dining philosopher problem using monitors. (06 Marks) Define the necessary and sufficient conditions for deadlock to occur. (04 Marks) Consider the following snapshot ofa system: Process | Allocated resources [ Maximum requirements | Total resources RB] RRR [Rk | [Ri | R TR P| 2] 2 3 3 6 7| 7/10 Py 2 [0 3 4 3 3 Ps 1[/2[4 [3 + 4 i) What is the content of need matrix? ii) Is the system ina safe state? iii) If the following requests are made, can they be satisfied /granted immediately in the current state P; requests for (1.1, 0) Ps requests for (0, 1, 0) resources additionally. (10 Marks) Given three processes A, B and C, 3 resources X, Y and 7 and the following events i) A requests X fi) A requests Y iii) Brequests Y iy) B requests Z vy) Crequests Zvi) C requests X vil) C requests Y Assume the requested resource is always ellocated to requesting process if it is available. Draw the resource allocation graph (RAG) for the sequence (2, 6, 3, 5. 1, 4 and 7), Also mention if deadlock occurs. If so, how do you recover from the deadlock? (06 Marks) lof 2a 06CS53 PART-B plain with illustrations, the intemal and extemal fiagmentation problem encountered in contiguous memory allocation. (06 Marks) Explain the concept of forward ~ mapped page tab! Consider the following sequence of memory references from a 460 word program. 10, 11, 104, 170, 73. 309, 185, 245, 246, 434, 458, 364 i) Show the reference string assuming page size of 100 words ii) Find page fault rate for the above reference string assuming 200 words of primary memory available and FIFO and LRU replacement algoritiums. (08 Marks) Describe the different access methods on files. (09 Marks) Explain the concept of file mounting, (05 Marks) With neat sketeh, explain the linked file allocation and indexed {ile allocation methods. (06 Marks) ‘A drive has 5000 cylinders numbered 0 to 4999, The drive is currently serving a request at 143 and previously serviced a request at 125. The queue of pending requests in FIFO order is: 86, 1470, 913, 1774, 948, 1509, 122, 1750, 130 starting from current head position, what is total distance traveled(in eylinders) by disk arm {o satisfy the requests using FCFS, SSTF, SCAN and look algorithms. (10 Marks) Explain the access matrix model of implementing protection in operating system. (10 Marks) EX any the aie . st THC Ay gpacting system. (10 Marks) NU XOPSTAting system. (10 Marks) 20f2