| Explain ih detail abouk Poying and Seqmentation. ie aging: Paging is a memory - management scheme thek permits the physicoh address space of- a process to be nencontiquous. Faging avoids extemal progmentation -and the need for compaction, TE also Selves the problem of freeing memory considenable onto the Veckig chunks of — voryiing SBS Steve wos — wemo ny - management before the introduction of (gin? aeffored Prem this prebvlem : schemes used froma Mumber ° Page of | .Poge 0) Po | tf ze Page 2 2/3 3 | page o | Page 3 leet =e Doaiedd pore % [pope | “4 s Pte. s mm Eno! Cian 7 | Poe 3 | Phys ical wnernory, Fig dl: Paging mod of. Dogiea and physical me moaty., The haxdwenre tmplemutabiox of the page table con be dene in Sever woys, The Btondiond azclubion te this problem IS tocache , Cee). Poort is used anailable Each entry in 4 ae poge table gprenckes by the pt erenked te the ie found, is rome Rolle, cate ad use @ special, small, fest- Qookup hendwone celled a tvonslation Rock-aside ‘buffer The TLB is shociative, high - speed rsa, the Tle consists . of twe a key Com bag) and o vole! The TLB Lith —poge tables in the foldowing TLA@ Covtoaius onky a feo of the Dogiedd. address is number iS entries, When a ceo, iS pogt used Fe access. take Loy thon lo peronk wil ae unmapped MUMTY eye rs Jonger then iF sofoena Woe oe vuunban TS not wm the +LeC TLE miss), & mennrg oefe- agence to the pogt table must be made. Boogic aes [cpu | “Ses humlber fone 718 bie Physica mem Ei FE | aoe ° rel PSs austelet TLE miss = Page = | table[Segmentation ’ Seqwankakion | is a Winrar wana - USL “yn 6 BOhene — -thob Suppers this view oft memory. A Logical addyess space is a collection of segments: Each segment hoy @ nome and a Sength Fon Simplicity of implemanbeki on, Sequnsuls dove wmbaned and ote sofocad- to by o Begursik num ber, seth then by & 4 name, Thus, & Sogecal consists Of & two trple: addwyess Segment -rumber, offset 7. ss oo : Tmt | bese cpu; as] { Se mert table Physical ttop ‘ addnessing e116 Fi 3: S$ ehien herd one - Segmentation e xomple t Ss! e ° a Opracking System 2oo Seawant O geo PSSamentl | i bool Segenente 2 PeecessQ- Iwplemevt 3 Replacemank algorithms CFIFo* LRU anh Optivneld)) avd stake. effackive replacumane agen thre with exomple. a Lee suapanene string | ist 7, 01,2, 073, 0, 4,2,3, FIFO > placernant abgorithm' - considering th frame size +o vie 42). SoM O 3 O' * st 7 Ee IB ewe oO ° } Bi\ 13. Eu (zap (les aly Le t| fol fel lel [3 Phan Proms Poge Fouts, = Ot Least Recanthy used CLRV)? 7 o |! 2023 0 b.2 7] (74 YY 2 z] > 4 eI } oO 2 2 oO g 3 i ! [3 2) [3 2 L fogs Fad = 2 Optima Replacamant A ich» 7 ° (|. Fe = FF -_ hh 7 7 7 2 2 2: ° } } } aE | I 3 3 Pop Folks =G Frem above thou ithms, we cm obseswe thal — Cptima RepSacamunte hos tas Poop Fouts te 6'.So it is best tn this cate,3. Oefine Access motrin with the lbp of on’ exemple. The model of prebection con be viewed On access yatyin. The vows of the domains, ond Each a : ccesS matrin Prepresent the colwnns creprsent objects. entsy In the ee cases hr of access wrights. the cok Of a sek enboy access Cj) dofines the ations thee a petecess jh domain D; ca tnvoke 0” e neaking th aca only those objets specified in mows, fy ports only oF aWdowed by = a mak xiX éentsies’ Process domain the accesS- aye) ec | oma pet Pa F232 || printer DI Pread |' ae 02 ! : pone [P8 ) ned | execute | neod ol conibe ate | : | Fig B11 Access makvix. The access .woksin provides an’ appropriatemechonism for dafining ard imaplaranting Strick control for Lath Atakte ond dujnamic apociation pekuveen © prtocesses and domains. Porotessed ahodh be able te alts fan one Boman to onothan: nett] es rel rs |lee,) br | 92 | 3 | OF pl mead] | |¥eod Vewiten Ox “| esiat Suite | switch o3 need Perec Ae ete se eT Fig 3-2 Access matvin with Bomairs os ; objects: b. Explain in Jato about dineckory atnuctures . A. There ore differank types of diveckona. ateuchunes : Seme of then we: i) Single Level Dirre cory. i’) Two Lev Directory. ii) Trree- Structured Diveckovies ww Acydlic - Gop Dineckonies i), Single - Lew Dinectosy The simplest dlivedssy steucwre is the Single levAimectory. ASX the files one contained ih the Some cdivectory, which is os, to Sup- =port ond understand. A Single Swd direckory hos, sigmificont Bini babies , hewevest, whan the numben of pbs lucreases + 071 when the apsten hho, = morte. Diene ere Chex —> Root dive’ ckom,. Sd de." fi) Tese -Level_Distectory ¢ diseckory ateuchow, each 43" hes , eum, Hse fie eed CuFD. The UFD's ea similar atruckunes. ». buk eaki lists ; of a ASin ugen. Whenua Dogs im, the how, ody the piles wen seb atotsy era un systems moster file hi vector, (MEP) &S Seanthed: [A] > Root diveckory 7 User dinedory 84 db. ce Tine Devel dine S[sp tcc. steuhoek Pinectory A bree is) ji), Toee~ Struckned Pinectony - A Eee is 1 the most Common daveckory, structune. the tree has a moot diredoy, and vey fie in the system ne a unique poth nome. soe i oh deweckorng B Cc > vier divectory . #l) [él [Fl |@ i] 2) (#3) Gu) GS . i Toree- Structured dlivectoy. iv Acyclic-Grap le 0: irack ony * An eter rh — theb iS, & he with vo cycles - odlow directories to aon Aub ditectories ‘ nk ple) A a> yoo Aivectony e11e. > ao divectony.G. WettFe sherk uetes on the. fallow! a) Thotashi e . b> Convey, effect: <). Semopherid’: and tits types: a Fide System 2: Page. fou sake. fice Thoteshing + re is a phn ae octuns in Computer a a spends am lentassive own system s wk aystem of time on pagt susp ping, mrathon thon, | exeusking wooft wsork : ; eer CPU ‘t Utilization oo > Degg of va udiprogrrewinsing . 5) Convey ‘ Effe ck’ This. a phenoman oH ayoctokedgemnth the First Come Fixst Sesive crces> abgonith mr, iw wahich the whole opeuting system ‘Slows dawn dua to few Glow processes: fob arene Shorkex jobs Ct a€) Sewmaphoras oe ivctegen —yasdables that ees este eee orem critica Beckion poroblom by wing, tue atomic operations, walk ond signal. thek oe. uged fon prices ayneborevigakion TE hos, ‘twe he fons 5 voaat and, two, typ? of ‘si then OR: Seyroporus * \. Counti _ Semap anes § the tS inkegert ven > ermayp hor Lunrst vicked vols domain’ Rs Binony Semaphe’ * the binary Sema- —phees ae Dike count Senay Wortes but tie velua 1S sustyicked FO O andl. A fide sygptem is a method an ope bg 4). to tone, ergprige, ond Aystem ges monagr fils ond directories on 2a Stevoge davice: ; : e): . Pose Fant Rote - rt is given thd a (29% foul: oCcauns fen every 10s Meme. accesses, Pe PT aeG6. Wetite ahet oe Coa ee eed Monsgzimant. fl: Virtual aie omy iavatves eee Separte- stew of Logecal rem omy, Os percaived Ve hes | om plysicad mamory . This Separation aouss on ext semally Dasige Vvi¥- to be provided for atu Wm coup prog aminsss — usher ondy a dinatlin physi- cod. rsa ore is available. Vintusll aounee makes the task of. prepram ming. much COSi WM, bemuse the progres no Dongen the amount needs to ohee about’ available, 5 he can of physical yrs om i i the preblena o be Conant vate “Instead on virtual * addness space ot the Rogical on virtual is Sbeved in thee a programmed. the. a process sufoy te View ef: hoplene process Meworry.. Tye icathy ie this veew is Plocess “begins at & centain Bogical ad§nes - So adduess O- and remists; in Combi garou® mewn 24 L 6.l- as Bhewn i” the Figur e7 ailustrate the: imaposckonce of © dammand paging rand pure demand paging with the blp of enomple. F Ae A Jamand.-peging, aystem is too paging austen wotth suscpping vohwre prscesses neside in Secondary memory (os - —uallly a disk) USkem, We Wonk to excake similoan a process, we swap TE’ Inte) pom Rabllen than Swapping the enkive process inks wren however, we wea Rasy By a ‘ wapeer: A Swap pen Monipdates entire processes, Sheu, a Pogen is con cxnedwith the vinduvidue thus . pages of pret a ae Poge ruthor thon Sopher, ia connection with — clomand. eoyrg * Pt : rs (oO 10 20 Soap oe NE oth ik [| . ko 9D wo WO ona is oO fmf BBB Swap lu Ss Fig ls Transfer of eee mrsim org to contiguars Vi Pace Pune demand pagirh ” UShan the prreces of i untill every, iE weagpes is th antotes 4 the psocess con exeube with no more CH fees: This’ Schame is cabled pure oeinand Pegg. BQ. What is Beladys Av oveally 9, ce A. USkon the frome Sie Surcahe: Increased then page. feos ae!en “1S Kn also jncveased. This . phononen ow, oe Bela dys Anomedy operations of On OPYIa. q. List the — ti Buytem: a ne Aes The. major operations of opreheg Cus 7 Process Momagement oo File Operating Mornoru f= eSusti Device |, °! mM ae “fees, Movaggmante: Tha operating AyTee" sespovaibl € for wonoging, the procenes ie ABI giving, the proce to a process oat @ Hime. This ig Known 4, process schadubing Tho differant algorithms used fen pros schabubing. gow FCES, STF, sound webin eke: [ee UE — | isjue! | v the \ ‘| ae wom eG ae oe, pigs binary NS a Prtecenen. a 2 = ips ow a as, 7oyne 1 ah Bais, mie ae he Jusesust fe algorithms . eynaink ¢ Thor oe “4 ae by the opoelg, re Kagborard disk drive ete , FiSes au used to provide view of dada. atorwge by system ARR the. fle, ome Qe davices eet hel ine p buyaic te so. dake iS soe 10. How ‘Acaddock “Cain be avoided explain with the bade % eramplet Explain: the necsraod conditions for Aasdlk occur -ene. i Ae There aoe for ae ee fon Yabalodk ovewunce: 1) Markus: Excdanion TH Babak sched See eae hog fon porshasrableos printer anne by Sevesral) : pesos. For evample be st imbansonsly shored P wocesses. 2) att ond 1st | Te Yibien 6 Ne OCCasy, we must » goorankee the enpwe tha t, = he gd- and- wait No preempbrn | ‘ droasy pean allowed. . 7 iv) Coradan Woik ‘the foot te : or, lls ie the ore 5 era the couli ien condition. Ove Of” hobs ise ae pe walk g this covdition newer a | totad ony of ae types ans be egy’ thor 1A, on ey proiess seagpsts FA, OUI CES ~ easing ont des of encima ationvad ° sowie = Allo cakien- Re Geuph Hm: HE we suseure adocass : on t System with one ins tan oy of each Pounce type, use . — Caen of the FUsewre- we Mon pap daftad fon dnd widen © Su, additten: te the 7ase uo aasighumamte digs abound Srey be ye intyoduce & “EY tye of of edge called 2 claim edge: A claim edge Pia R indicat es that perecess p; yew, roguast Ry aby Some. Live in the ae fas usr ce fotwre ) a oe) ~~ 7 Kz Fi lol Resour | Mocabion Pe “deadlock wwoidonce “Guoidance- eae Alganithon Tha ruse e-alllo cation Toph cbganit mn — not . applicable to aFA%eunce - allocation system with multiple instances of each , susousce, type: The doaMack avoidant: ithm thet We dexcvibe next 1S appl Ayptem bak is the 2Usewte aWMocakian — ger" Schone, This ithyn js comnorday Kee The bankers algerither- re hes differant | eres Wauch os ‘ Availeble', ‘Max, \ Mocakien' ond “Need * iis _Sabeby Adgonithin: ud Finish be vectors of Suspectiv . Dnitiali | — 1. Lee Werk Dangkh onk % Werks Available and Finish Cil=folte] ae por adh i=o,1,----wol 2. Fink am index i Auch that both a. FimishCil== fodse- b, Need; & Work, x Yo Such j . = i exists, jo te step ¥ : Work= Wertk+ Allo cosion Finish(ite true. ‘ ee ‘if Ge to step 2: ly Th Finish CiJaz true fon all 1 the system is in Sofe stake: Resource — Request Algorithm: |) Cp Roqmest; 2 Need; , go te Step > [ 2. ZR Requasb; 2 Avaclable, gore Sth 3 2. Available = Available Raq Allscakion; = Allocation; + Rayssts : Need; = Need; - Regent; ; Enomple: Let 1 =S Ree 5, Ra ie i fllineaben Max Available Need R [Ro] R3] Rif Kr] RS | Ri Kz | RB] Rt [Ro [RB aA i) fete |2[4[oli 2\Clo[s) |B {2fopeye] s[3/a]1 | svoj e f2l2{'}3s}4lr [3/3/44 {2/o SS. Sa : <6 Ay Gz