tu No of Qwentions 8 Metal No of Printed Pages 8 RollNe IT-501 (GS) B.Tech., V Semester Examination, November 2022 Grading System (GS) Operating System Time: Three Hours ‘Maximum Marks : 70 Note: 1) Attemptany five questions. ‘edi ae seat at ew EY 1) All questions cary equal marks. ‘eh weet ds ea ales 1 Tit) Im case of any doubt or dispute the English version ‘question should be treated as final ‘et a ame be rer Rare A RN RGA aT abo at ifm ara oa Explain how protection is provided for the hardware resources by the operating system? 7 ‘ret fb stetn Freon Gra ender alert & Py Re 38 ser AM are 27 Suppose that a disk drive has 5000 cylinders numbered © to 4999. The drive is currently serving a request at cylinder 143, and the previous request was at cylindse 125. The queue of pending request in the FIFO order is 86.1470,913.174, 948.1509, 1022,1750,130 staring from the current head position, what isthe total discrace (Gn cylinders) that the disk arm moves to satisfy all the ending requests, foreach of the fl scheduling Fading lowing disk scheduling T7301 68) + PIo hups:wwwigpvontine.com » 2 » ° ae ifr sas Rees grea 3 0 4999 <1 5000 Free Ai gga adm § Redlee 143. ORRIN AR AE, oft ‘gen args Rechse 125 58 21 FIFO SERA BRR SER aA 86,1470.913,1774 , 948,1509, 1022,1750,130 drs ad RRS gO aa ee, Pefeitan few ategleer yeius 48 meter & fare Bes sed eh after sqenii at pe ehh fey Hat GA (Phretee A) ear RF Fees ii) STF in) SCAN iv) Look In the round-robin scheduling, new processes are placed at the end of the queue, rather than at the beginning. Suggest areason for this. 3 ‘eisai Aogfeen 8, ag sensi ah wove Bs wor sare & af A west ore By gE wT TET Explain why wait and signal operations on semaphéres ced to be atomic? 4 sore fs Sor wee A RS aT TIE & sree eh 7 Show how to implement the wait) and signalO semaphore operations in multiprocessor environments using the TestandSei() instruction. The solution should eahibit minimal busy waiting. Develop pseudo code for Implementing the operations. 7 ‘TesandSeu) PEM am aes arty mera ATEN wait) 3% signal Seana stares ah aL awe am afta Peearg: eomarr ah eae ces sea ee aH RYH ‘Saree ah omy ee Hy pseudo ae Rear weY bups:/www.repw» » 501 (@5) pI) ource Allocation Graph for the following, " rocess PI request for aresoues x ress P2 requests for a resource ¥. 1 resouroes roe Te they ae allocated to the requesting process At time t, where t>y Doth te processes So sullen hy Pa proses Pz reqs OFX held Uo Pr wall there be a deadlock? If there is a deadlock Wyibics we four necessary conditions for deadlock, else justify there is no deadlock. 7 restate fore ert nko se oot Fer RL cee ge fete 2s fog PLATE BY eTEKT BCT Al ame V2 fre P2 seul wy enter weer Bt Se ere aera @ othe oot sgt ave ate far fore nr rer a BA TET 1, GE TRH yt St TE of Sf beret ah ear ae Hi ret YB fre PL STE widen wt A PD aA sitters a TRA Bt PENT areas XR Pe. ere aoa a er a fee Bog af fer & a fe fare re anaes eet cad ks ore ahd ae gf Ba site Fre we “Assume the following processes arrive for execution at the me indicated and also mention withthe length of the CPU-burst time given in milliseconds, 7 at&t Pract fren PARE re oe PETE 35 gee € atte Ratiaes 4 Re wy CPU-AReHE were oA arg oreo we ah Bi Construct a Res scenario. At time hups:www.rgpvontinecom 77° Jab 7 Burst ume (msi Prony | Arval time ima ro 6 2 . re 2 2 ' rm 3 4 en pa 1 1 2 | Ps 2 3 | 2.4 Give 4 Gantt char ilustrating the execution of these procenser using FCFS, Round Robin (quantum = 1), and Pronty (Preempfive and Non preemptive) Calculate the verage waiting hme and average tumaround time for each Stihesbove scheduling algorithm Which algordhm wal freee runimum average wating time? Discuss FCFS, Round Robin (quantum = 1) ft wrt (sR Seat ARQe) on gach arts we de Pree a ext aren ca fe ard 21 ote tegen ere a a Erbe 2s fg ate sen eo ate ar eareE a i moe a ate eA EH err a era rt ati 4) What isthe difference between lo Miocaion” What are thew respective advantages and Sisedvanages? 3 seria oe fen By arden By te ice 8 we seats ora’ ate oe aan 87 1) Compare the segmented paging scheme with the hashed age luble scheme for hanling large adress spaces Le what csumances ison scheme preferable over 8 oe via ah eee by ts to deat eS SE BR ee AY ora Ry fo GAMER A a veer gt chor 8 are 8? ad Coos hups://www.rgpvontine.com3) + conde the folowing page reference SM eat ta ed RE RTE TY 1354.2, 15 6.2122 76ID IEG eae hage ats would our or te fllonine PAE on se oe ee Suing oe selene Aru hat le aes ae Sve ompty. 50 yOUF frst nigue pages wll all cost fone fault ach 1) LRU replacement 1). FIFO replacement sity Optimal replacement cw. ats, a, he, we aT aH TA BE, PET TS earn ean 2 Fy Freeh gw ate et? A a FE ah on aren arch &, BEAR TT eA ir ET sects weet oy LRUSfrERE iy) FIFO Ree iy ers TE 5, a). Findoutthe effective memory-access time with an $0%% tras and the following access times: TLE access time: 20ns; Memory access time: 100ns. 3 smi Re age the Perr en BL BH TEL HT aah corte erg I ST TMT: TL GRAS TAP: 20ns; aahfh godt 1g: 100as. 1501 G5) Pro bups://wiww.rgpvonline.com ist voy Consider a paging system with the page table stored iy ‘nemory, IFamemory reference takes 200 nano seconds, row long docs a paged memory reference take? Tf we add nerocranve repisters, and 75 percent of all page table serernces are found in the associative registers, what is the effective memory reference time? (Assume that nding a pager table entry in the associative registers takes zero time, ifthe entry is there? 7 aad 8 arnt dot 2a & Tes Oem Areca we REE TR uf apt wet 200 AAA Bs Te Eat ites eA ot 8 Rosen we Stat 27 a eH wea eee aH ‘ate &, site recht xforeedl A anh ges nfGrem eee a 75 ‘fever emt sae, ot sre eayfet aioe eM aT 7 CAPT 2 fay rea eee A Sane errr PARE ato A ae aaa pre @, aff nfafe 27 ‘c) Ona system with paging, a process cannot access memory thar it does nt own, why? How eould he operating system allow access to other memory? Why should i oF should ‘enor? ‘ ‘fe Bs er co Reem me, Ge RT se Aah aga wash 2 of oes are al 8, ae? sifetfén Rees or Set aa 8 aga A Gah 2 wae 27 ten ach OT safe 8 et ee? 6. 3) Which fe.allocation method would you use forasystem whose main ask isdatabase management? Why? 7 ae fre Free fre Freee FA Hr Ah vance a Sem etn 87 2 hups:wwwrgpvontinecom OM» ° 1 occupies are simply whena files removed, te blocks it ccupi roby Tack onto the fe lst. Can you see any problems if 30, ow would you overcome tem and ‘would now exist an a dof a, age wed ad aint ang ren ge eh ee ae Ye TE See a ae ene EY SETA A rah eon, a an @, ace atge Er tk STE eras Sat a? placed feath his problems, i any. resolve these? ra ahd ager RCT Gwe an example for an ape pat could neh open Ss A cam 2 ea CARR aT BTA gH eR ETT FE eden br Bo hr far eR Sarat I TTT El Some fil system allows disk storage to be allocated at ‘Micrent levels of granularity. For instance, a file system ould alloeste 4KB of disk space as a single 4K block SEL gntsl2 byte blocks. How could we take advantage Ske flexibility to improve performance? What Shodifications would have to be made to the free-space ‘management scheme in order to Support this feature? 7 go orgs Rees Bea wha a Heya & Aft EI Sree are} AL gah 28 Ei were BF HG, Ge ET FEN AKB Re eI aD AK eles UT S12 TEC atin oa A ota at wee Ae mets que & Pg eT aS ant GAH thd Gor waa 87 ge ye ery ETO aT 2 hr perce st shee 3 en see ah BH? irs01 Gs) pro hups:/'www.rgpvonline.com (8 How long docs it take to load 64 Ki disk whose average secktime is 1 2omsec ané tack Holds 32 Kbytes Calculate tne oe Bage sizes 2 Kbyte and also when page sizeis4 Keres ‘Assume that pages are spread around the disk end neo Pages are on the same cylinder. Grote. oem a 64 foratarse sta a ahs arch i" ere @ Pree tee) at ae Tome fee oe 20msce & Se 32 Rcherge cae 8h Ee nto re Ge 1 TR 2 Prensa ite Oe YS am are 4 ftsohnee eh arts gs er Bs ee a 8 a 8a Ww 8 Ria weal ge al 1) Given a disk with 200 tracks, where sewed ae lowing re 7 20080 arc ce fee &t mie MER, oi da oahu Pret a 35,58, 39, 18, 90, 160, 150, 38, 184 The sting postion forthe rm stack 100, Cal Is track 100, Caleulte the number of tracks crossed when the Totten algorithms are used * ') First Come First Serve ii) Shontes Seek First iit) The elevator algorithm starting in the direction ‘wl & fore ser FRR Bas 100 81 Per eaters a ‘soul eh ae ane eR ot staat oT a ) oR mae at ti) eee eas ee tiny re Costes Re A apes BT ee aI ‘byte program from a Imsee, rotation time ig ‘wack requests are 1501 (Gs) hups://www.rgpvontine.com