You are on page 1of 2
Save trees use e-Question Paper Go green DOWNLOAD THIS FREE AT www.viuresource.com usw [ [LOI 100s Fifth Semester B.E. Degree Examination, June/Juty 2017 Operating Systems. Time: 3 hrs. M@& Marky TO0 Note: Answer FIVE full questions, selecting ‘atleast TWO questions from each part. Laer ee riones £1 a. What is operating system? Explain muliprogramming and time i. Explain dial mode operation sn OS with a eal block diagram. (ountares) 7 What are system calls? Briefly point out its types. (OU Marks) £ |. What are virtual machines? Explain with black diagram, Pgif@ut its, (06 Marks) Pa 8. Why's i important forthe sotodoer to distingish Youn prams ftom CPU bound u programs? (a2 Maris) 35 ‘What is interprocess communication? Explain is (06 tansy a2 Consider the following set of processes, wit h of the CPU burst given in rE rilliseconds, a Time Siri] Bs | Sa ca He ae i 4 + 2 3 ‘The processes are assumed to Order Py, Pav Ps Pa, Ps all at time 0. a8 (3) Draw the Gantt charf foyge pllowing scheduling algorithms, FCFS, SJF and RR a (quantum = 1) 25 (i) Find out turn ti ‘waiting time of cach process for each of these a scheduling a dalto find out avmage tum around time and average Se ‘waiting time. (2 Mars) ae EE > 5 Detne semaphores and inplemmtnion (06 Markey 5 1. What are monitgrs? plain its usage and implementation. (08 Marks) € i cc. Explain Dining, Blijp sop ss solution using monitors (06 Marks) BS a. wags tae its characteristics? (05 Marks gs b Cons snapshot of a system: Fe Max Available a5 B ABCD ABCD PE ro Ro Me oor? 1520 = 00 1750 oa memes 2s j P06 3 2 0652 Pigp 01 4 0656 5 Find ou need mat cassia) Q Gi) Ife request trom process P arrived for (0, 4, 2, 0) can the request be granted £ immediately? (02 Marks) (iit) Is the system in a safe state? {06 Marks) Explain the process of recovery trom deadlock. (os Marks) 1of2 BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS A Viuresource Go Green initiative Save trees use e-Question Paper DOWNLOAD THIS FREE AT www.viuresource.com Go green 10: PART-B sa ne miliisicp proctaiing ofa mor program with a neat block diagrare 9 b Petco internal end external Regmentation. © Explen segmentation wih an example 4. Consider he lowing sepment able : (Sexiient [Bese [Dang a ais 600 | T—}a00 “14 z 90 100 « 3327 |= 30 [3 T3s3 | 96 ‘What are the physical addresses for the follow ing logical ? 0,430 ‘Gi 1,10 iii) 2, 500 D3 4 () 4,112 GF Mans) 6 a. Exphin briefly the various operations performed on (os ates Explain be varios access method of files (women) © Expl voroun elloetion methods in implements Ng Wea (on ar) 7 a. Explain the various Disk Scheduling algortn Mich MWe ao stais Point out and explain bry the problay tos Man) . (oe Ma) ao (06 Manis) b toe mart) @ femane) 2of2 BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS A Viuresource Go Green initiative

You might also like