Orerating Syster Iinrvew Que x bJhat ts an Operating cysrem? | ® Am Operating system $s a Progvam that acre qs an intermediary berwWeen 4ne user and Computer hardware. Tre purpose OF 97 OS is 40 provide a Convenient environment In bshich user Can execute programs In q convenient and efficlent manner % | uthat are ¢he cifkerent operating ystems? P 1. Barthed operating systems. 2 Melt programmed oferating systems. 3. timesharing Operating Systems 4 Distribored operating Systems. 5. Kess-time Operating Sygems. * P Desalock ts a sifuatton er condipon lheye the +100 processes ore waiting for each Other 10 complete fo thet they can sost. This yesust both the processes 40 hang. * DP fF program js execution is Called a process - Processes are +190 types? I. Operating System processes. a Usey (Processes: * [Leet are pha states OF a process? | DP 1 pew 2 Running 3 wlalting 4. Ready 5. Porminated. TERY - NOTES GALLERY.udhat le Semaphore? WD Semaphose 35a Variable, Whore Status yeports Common yesoura , Semaphore Is of +t90 dypes one fs Binary Semaphore and other }s Counting Semaphore *[ punat is 9 thread? | PP L-snvead ts.0 program line under execuHon. Thread Sometmec called a Lignt — Weignt process, isa baste eintt of CPU utilization > + comprises a thread jd, a Program Counter, a yegisy cet and a stack Z Att kumar CLINKEDIN)- eCEG RAN- NOTES GHUERY ®[bdhet do you now about” )nd pr? ®- Thterrept can be Understood as 4 Signal From 9 device causing context Switth- * Te handle the interrupts , Interrupt handlers or service youtines are yeysred: + The address ef e9th Interrupt service youtine ic provided Inq List Which is maintained In Jnterrupt vector. * RP context 1s associated “ith €4gch process encompassing al the information describing the current execution State of the Process + wlhen the OL caves the contxt oF program phat ts cusrently yunning and restores the context OF the next ready +0 yun process, it ts called as context Stitching. * JF 16 important for modsitasking OS. % \ idhat 35 a Cyiticad Section ? > Tr 10.0 section oF Code Whith Can be execured only by one process et q time.[same the cliferent types oF memory P| P a). Maln memory also called primary or Ram, 5). Secondary memory or baciing storage . ce). Cache. Jd). Internal Process Memory - [that ave Page Frames? | @ Tage frames are the Fixed Me contiguouc ayeqs into Which Phe main memory hs dtulded by the Virtod memory - ® (icthar are Pages? De fages are same ed piece oF logical memory of & Progra. Usually they range from YKB 40 2KB depending on the Addressing hardware OF -+he machine. . Pages Improve phe overall System rerforman and reduce yeyulrement OF Physical tprvage 9s Phe data is yead In page units, #& | Kthat)s 4 Complyer? @ 4 compiler isa preqyam that takes 9 Source code 9s an input and convests Info an objet code. During pre compilation process phe source code goes through lexical analysis , parsing and intermediate code generation pDiAich hs fren Optimized 40 give final output 95 an obfedt lode. elude isa ary 2 D> Tt Is a Ble uihich conpalns object Code for subyoutines and data 40 be used by the other program. ® [udnar ps a socket? DPA Somers Used 40 Mate Conneetion berioeen FWO epplleaHons, End ponts of the connetion are called socket. TUL Korn AR ( LINED ial):| what is BLM 3 | Po tr he the service called as Aistribeted lock manger- ° fn cluster ystems fo aeld File sharing the dispibuted Sy pems MUSH provide the gecers Contre) and File loddng. This ensures phat no Cnflicting operattons accur In the System + Here tne distributed File sysems axe not general purpose theverore It veguives Jocking - [ptisPeiaireas aalcl oem 2a Keal-Hme Sysrem ps used tn the case nlhen rigid - dime reyurements haue been plaud on the Operation of a x > Procecser= /t conpalns q Well defined Gnd Ared time conspralnt. Aruc Kumar (Linkedin). lunar le pernal?_] paieiaucn cea P Kernel i's the cove and most Important part ef 9 Computer operating cysrem which provides bask services Ley all parts oF the Of- Inat are tre Sifters cers 2 DP A List of dkferent states of process: > Aew process — The Procecs be being Created. 7 Running —fn pds state the insprutrions ave being execured. > ntalting — the process Ps in waiting crete unt) an event occurs ule I [0 operation completion by yeeeiving a signal. ? Ready — Tre process ps Walting #° be aestgned po a processor , PTevminattd — #4 process has ginlshed eveeutton. Al idhat 7s an Jdle fhread? DP The Special thread 4 AMecpather will exeente When no ready thread is found. Ara_Komak (4uniceD IN).H [pthet 7s the ateference between Process Gnd Program? PRocess FROGRAMN P ° A process 3s an executing Indane|. A Progvam }s g Sysem aethuley OF @ program. thet Uses a set of instruntons 40 Perform a deslgnated +a sk. fn other words, the Proce to Ny * Tt 16 considered @ pasebve entity a PrgraM In excetetton . 95 I+ yeddes on Jeuindayy memory A process hs entirely sependent on “the resource vequivernent is the Program less as i+ only yequires memory for storag = ® Lpdhotis Vivfual memory 9 DP Viral Memory isa Uery useful Memory management fechnigue HIND enables Procecser fo execute oursie of Memory . Tris technique iS ecpaciaily Used when an executing preg yam Cannot At in the physical Memory: [that ty phrasking 7 | PF Trashing ts a Phenomenon in uiypual memory scheme ighen the processor spends most of its dime in Swapping pages, yathey than executing Instructions. #|pihat is a thread 9] D fF thread ts q basic Urlt of CPU LU#bization. IF Conslstr ofa thread JD, prqram counter, register Ser anda srac. * "P Fragmentation 1 a phenomenon of memory wastage. IF yedutes the Capicity and Performance pbecujse space 7s used IneFFiciently - “Atue ompr CLIMKEDIA)-4 [that is phrashing 2) F 51 3s a Phenomenon In Vireual Memory Schemes when the Processor spends moct of Its dime cidapp pages, yather phan execating Instructions. TMS jc dust fo an jnowrdinate nurnber of pages Faults tl buhat hy cache memory P Cache memory is yancdem access memory CRAM) phat a Computer microprocersor Can Blcess move gaickly than St can access yegular RAM. As jne mjcroprocessor Pyocessec data, it Jooks Arst in the cache memory and IF it finds dre sata there (fm 4 previous yeading ef cata), I+ does not have yo do phe more fime- gonsuming yeading of data from 1079 Cee rut Komar CLINIKED IN) - TELEGRAM NOTE GALLERY. hat). ical an. nysical addresses Sface? P Logical addverses '- Logical address Space Is generated From CPU; it pound fo.a Separate Physical addrese span Ps Centyal 40 proper memory Management Lig pel addresses!- Physical address span Is seen by phememory unit. regieal address space is ulytuol Address space - Both these address space Will be same at compile tme hut Miffer at execution pme- x Dikbewentiare between Comptley and Interpreter ? DP Inrerpreer'- IN Inferpreter yeads One Instruction at @ Hime and carries out the aetions pmplied by that Instyuecion. Ir does not perform any fvansfation. — f Compller fransiates the entire Insfructions. Aqui pumak (waiice Dil).® [ithat 15.4 Real-Time System?) DP A veal time process 75 q Prwcests Phat must yespond fo phe events withina certain pime Period. A real Hime operating System PL an operating system phat Can yun veal rime i processes Sacecspuily+ nelnat i's Mayshaiting ? U nr P The process oF packaging and: sending Jnterface method Parameters Qevoss phread or proces boundaries + # [that de bucy waiting 7 | F The yepoated exeeutten of a Joop of Code while walting for an event 7o occur fs Called busy - waiting + The CPU fs not engaged In any yeu productive aeluty during ate perfod, and re pyocess dees not progress fowards completion a => Th Order 70 proret gne operating systems and phe Lystem programs From pne maltunctioning Programs the #130 mode operations plere evolved Sys mode Urey mode- # [inet 7s DRrarad = Dean ( Dynamic para) Stores the data }n the form oF Gepotizane , and Satic RAM stoves the data In Velrages. F |yathat are tha sub- Components of 110 manager in pindews NT?) 1) network vediverror / Server. 2). Cache manager. 3): File Sycberns. uw) aletwork driver 5)- Device Driver. Aruk ImAK (rIMICED/AL).What ig Starvation 17. Operating iy stern! — Stayvation js Rerouree management’ problem, In parts prvlen ,9 walring prcets Soes not get the resourus tr yneeds for @ Jong time pecause fhe resourcer are being allocated 40 ofher prwcesces | pinot are aging in Operating Sysem I | P Aging is aq rechnigus Used fo aueid the Starvation fn yesouree scheduling System . [nihat are overlays) ) = Overlays makes a Process to be sarge” than +t amount of memory @llocated fo jt. Ik ensure. fhar only imMporfant instruttions and data at any given pime are Kept fn memory. x P Kea - time system is used In one case when vigid-tme reyiremenrs have been plaud en the operation of a processor. jt Contains Q ell cefined and Axed Ame Constraints. * | thet is a drawback of pAvT D ') abirity fo support multiple processors 2) Virtual Sprage. 3). source level debugging . pthot is yelative path @nd ah solute ath 2 P Absolute pun: Exact path From yoot Aivectory - aque KumaAg (LINIKEDIN). TECEG RAM NOTES GALCER, Relative path:- Relative 4o phe current path. Atue_jomar CIMIceDIAl)-blhat 35 a data register and addrers register? DP Data vegioers - Dara vegisHers can be assigned $0 9 Variety of Funttions by 4 PrgvaMmMer. They can bé used bIth any machine Jnsfruction Phat performs operations on data. address yegtsers:— address yegtsterr ¢onpain main memory addresses oF data and Insfruttions or they contain & portion phe address frat js used in the catcntation of +he complete addrerses. oF [pdnat are the disadvantages of Context Switching 7 Time qascen for sitening From One process fo orher fs pure over head: Becouse the syskm does no usehiu tsork wale switching. £0 one ef fhe solutions te fo ge for prreiding nhenever possiele. * [phat ave citferent type of Real- pme Scheduting 7 } DP Hard yeel- time systems veguived fo Complete a Critical 4ask within a guranteed amount oF time . Soft real - Hime computing reyuives thet Critical processes yeweive prieriry over (ess forpunere ones. * DP ist of processes Waiting for a particulary } Ja device Is called devia queue. te [isthat i pooceteonlpeatn 2 DP Tt is pre prancter of Sufficient amount of tne state of proces From one mackine fo At farget macrfne. ATun woman CLINKEDIAL).x [icdhat are_yesidenee monitors? _ | P Lnrly Cperating sysHems Were Called yesidenue monitors. * | Define Compacitons, PF Compactione fra Procerc Jn wth the Free spa f+ Colletted | fn o large memory chunk fo make tome spon avalabte | for processes * | bdhar is cur? “P Té achieve maximum efticienty and yeliability a mode of Operation Known as symmetyie multiprocessing ps used. In essen, Lith Ip any pyocels ox fhreads can be assigned 40 any processor: Aru moma (LINKEDIN). + “TEley RAM- NOTES GALLERY, x WiYta “SQ daemon? P Daemon Is a progvam thet yans in the bacieg round tolthout users inteyoetion. g saemon yuns In g mUllidacking operching System Like YMIX. fe daemon is pniated and controlled by Spee programs known as Processes. A [Fler fy the meaning of mutex? | tury is4 short corm Lor ( nutuel Excluston onject). A mer alos mushple fhreids for shaving athe Same wource. The yesoure canbe fie. # mutter Mitha unions name is created gt the Hme oF Starting @ Pregram. A moter must be jouced From ofher threads, pihen any fhread great needs qe resolve inlhen the alata is no jonger used/needed me moty rs Let fo unlocks un Kumar CAINKEDIN) «