ee <7 aplininbriet te folowing ay sr 58 orate eran TO eg as Ah, ing. . . (8 & 2=16) SE STE oH agg oe wen Pt PD Prering Sem « ) He anything on : . umber, otherwise i shat pr est'On-paper except Roll intr mens an as mee sg eae H swemcats taken as per rules,” Roll Ne, a Gress BCA.) ‘CPU utilization 1716 Operat.Sys. Om . B.C.A. (Part-II) Examination 2017 eamming O-Aeing Paper- VII . 7 . BCA 201: Operating Systems . Taso. pat Time - Three Hours . ‘Maximum Marks - 80 ”” Latency time te - (1) er Hea ee aPrard Bi ae we HS fre ae Give the brief description on" Operating sytem wera, Eee cr asiguonenntemonnt Note:-(1) Question No. 1 is Compulsory. Attempt any four (5. Whavis process state? ‘Describe all process states with question from the remaining questions. ‘b suitable diagram, S216 f Describe Scheduling queues with queueing diapram, Ae (2) wa ved cio wa RL (2) All questions carry equal marks. mmencanseo «a cont MeBeart300 on, https:f/vww.jnvuontine.com hitos:www_jnvuontine.com tpgiven in milliseconds:- ses wih cry Process Burst time 1 Py to mn Py I Qf Pr 2 3 P 1 a Py s 2 { Draw the Gantt charts that illustrate the. these processes using FCFS. SIF. RR igus and non- preemptive priority (small priory higher priority) algorithms. . 5-@ Whats fragmentation? Differentiate tween ing «gy and external fragmentations x GD _ Describe paging technique with suitable diagans +6 Whatis Demand Paging? Describe basic ‘Demand paging. comet 1 Cy What is Dish Scheduling? Why 1tt used? Descn FCES and SSTF disk scheduling with europier sy PACE Management in felatiot S swap IBBCAN IoD 9» htlos:twww.jnvuontine.com li, Write short notes on :. First fit, Best fit and klorst fit techni @@ Filesystem concep. ‘hniques. ii) Critical section problems, fi) Schedulers, 4x4=16 bitps:www.javuonline.com ‘Whatsapp @ 9300930012 Send your old paper & get 101 eh et tt a ate 10 set oe, Paytm or Google Pay 3 https:iwwwejnvuontine.com