xplaint (Boarct ¢ Q@ Tracks and Sectors t) Seek time. ® Transmission time . () Latency time / Rotabional lela ‘ © Tracks G sectors: Magnetic dick susface ie made up aaa OF Concentrre circles cabled tracks. The Number of bracks Vase ep excabg on the dat Cape. A sector fs oo Smattee une 6 information toWich Con be reac Prom or written co the disk. Sector Vatien Prim 2 bytes to Hoab bare, & DEeeariae es track Contains ca fo 42 Sectors per track & from ts 40 fps Ureekel (pak dice Surface, ® Seek’ tHme + The time requind for read [ wrt-e. hends to move to the Correct crack is called 2 Seek time, acer Tronemrssion time: The time requirect Por 4 acivels Read forte heact For appmrpn'ale surface and reat dolu fs cabled branimissan th me, © Latensy ime! The E'me requirel Por requested Serer an treck +0 rorate ladow the heag is Collet a4 lainey time or rotabronadl Aedes= Procers Management 2 oor” = On ceu | Mon memory Second Mem ee Ore Program undsr execulien te called ot % paocers, Hat Comperer for cpu time and othe, Terour ces @ Pa peeseere teas Piette So beet er reside On sk . It moy le Compiled or rested buy ie sti dom not Compdé for computing TeLOUTES + MM) once User Wants ed execuke a program, Tes, Located on the desk and Looded im the main meme, at that time, Tk becomes a process ® Explain Centex swortch ney Process process = ] Conter” swirding @ muteipregrammring is the Concer’ OF Treveas (ng urilization of cpu by alway s having Something Por CPU FO ehkeuke . @y fn mutt” Bred ya miming cpu can eveculr two or mere Proetses Simulteneously . (38) cohen proces 1 Waits Por On eytetnal evenr Such as On t[d epuation, CPU execs Protas 2.Ei ® when cpu switches from one Poot ner the time required for sw eel nay eee conterr Switelu'ng | @ Expla'n Panning , Realy and Blocked protess shales Tp process Manojement- Process {warring 5 Q Rwaning stale: There ts only one prdcess, wluch 1s exeenhesl by eres er oy tre moment. This protus "Ss Cabltel On ranning protests. Gy Realy stole t The process, Clic is noe washing fer on exreine! even Such os On alo Gpadi'sn, lus dth ts not tanning tg Sard to be th realy chet . G Blocked stale, When a procets 's walt! ng for On external enany Such a4 On lo apesatien the process Vs gl sad to pe tn bleckel gtale.‘l Explain @ Tamaround time. 2 Board F 4 Merky @® Tesminad ruponse time, © waiting eme. ® Event response tims. © Tarnarounct time? Tusnaround time fs the elapsed . aes time letweer the time a program 5) Submitrea — Ond the time When ft is completed . ©) wating time ¢ wasting time fs the time oO job Spends Waiting in the quumt oP the newly admit tel Provuses for the 0.5 te atlocale reyeurte,, —— © Terminal response time > En the Bime= Shaving system, Terminal Yesporse tyme ic the time to respond wrth an answer ft depends on the ctf ene OF lardware @ Event response Lime! Sn the veal ume system, event response time is the time an went. Fo Teh pend withSs @ har Functions ave performed by memory management” oF operat ng Systems? 6 To keep track oF a Memory Lecations free or ollotaGd and [Pf aecalicl to Which proteus anel how much. @ To deetde memory allecalian poltey We oShich Proces Should get how much mem ovy when and chege. @) To we Various techwiques anal alge nithins to Ouocale or deatlocale memory Lecaion s 6 Contigusut, > Fired partitioned! > Vograble partit'onedt © Non- Cont'guous — paging — seg meutalion, Oia contiguous = Virtual menorIS sry etme enema es Le fs categon’ zee! into 2 type, /~ Cosuks'g uous Non- Cont g uous flared VY Varialele we paging Seqmentarten Poxtitien pasxitied eceme scheme = w po of Pastitions are fixed fr memory > site of each partiron may be Sarne oF may he ditferent- > for eg: we made @ partitions fn tne memory so, the ho. 8 Ps frxed > In each partion 6 Placed, In the care Sua pwiees Can be , We con place aa B pwcericy ab a time. © sp kB Prous PL +————|- = ; Boke of size 100 kB 2 [Pt ES Tsou Garives . @ 4 ean Sales is wastte a Boks and tt is known a4 Pived aca ‘ ok ewolion Patron. Ht lo ké internal froym ocean eee ee = go ks SSS sek 6 pee tec ae eae eae VPC 6 200 kB age rook & ae Poteet (20 ks Provgweut a> Vatrobie partition scheme meee ena — En ths, wWhenevea The vequertl™ OF the prvcers arrive accoreli mat y partition ig mace tn memory > Por eg. HPO proces of Size Sok B® ansrives, — a pastiten of oo kA fs Made ty mem o7y | con Crealz as many paxtibons at needed Ertl the ear (Ratt en’, TF wqnaly te like this Pi = so KB Po: 20 KH pa: 4o KB Pur to ke PO= loo ue then we make the pasrifions Uke, cokes 20k & bok to Ks bok 8. Ls crreanal Progmedation Merefowr, we com not allocate Py of size (o0ks—> Pastitten Ailocalion Methods © rest Fhe ~ © aur sr ® aspen fre Py = 20koNeon - Contiguous Memory Allocalien Paging pon® et gro: Tae FI \K6 ee ~ Ve 8 eg © V2 (Pia > LZ PA ae Main Membig Setonclady Progcan x igke } eer) Aetdters “Fran Poging Ts 0 memory M Computed Storer and wetweves dala from secondary stomge fer vse in main memoy. gpersling System Yeats dala From Secondaty Storage (in jslocks cablech Pages, ov oF wladr has tdertial size, And the, axe called fromes. emeanr scheme by odala biocks Tn main memoyAdavas trenstalyon rp paging. Prgram xX has 4 Pages cack Page has ¢ freeructions otek wt Seco wes meinen Lam Progiu K Addves Troslalion Logical PAAR) physread ceeAdArAS Tonalelron tn Page ng : Every Prasam Yerlde In the sece Pero the program Oleh has to be rxeented shold be foaded Inside the matn memory .. ceU genegater Logit? address For Secondary Heme Mar, Memory has physveal addresses . So, we hove bo tronsialé Logic addres to plhysrcal add vas. Stnee poges are Loaded fh a non- Lonetg uous fashion fn man Memory Every Prgram has €6 mo'inta'n o page Lable . page table Ts a dake Seruckeve and is Stored fnetdte the main memory Definetion of page table .- rr ty Hie dolu seruclire, Stored In metn memory tha stoves the maparn between Vixvtuad add terse, and Plygsicad add rerier, Now Cpo geneater Logica) addrere The Logical Gddras Consists of 2 parts- ( page no. © Ense melon OHset Then CPO Yetets the page table and Pint our Och poge no. fs pretenr af wluech Prame no. are = Pei tate heme trowiali the phgst cal addwers . Phycreat Addres Consists Of EWwo Pads - © frame no ® Inctruciren oFFserye Non: Contiguous “emery Allocation. Seqmewlalion Preblem wfth pay '> Paging don't bothes whtte are preqram Srotrs ana end, te stinply Aivices our PIUPYvAw~) Into page. To achieve wert View of memory alloca’ | segmevfarien is useol | management tecluurgre Pn na? * Bed ¢ It is a memo wlWich the inemed fs divided wnto vartotele cstze pairs: Gad posr Ts known o+ Seqment” wlidr Can be ollocatest +o % prDlet. Advantages of Sed mental on, ® Ko internat Pragmenalior DQ seamenr foie consumes Jes Space Compared 2 PANE robo) e . Dry. aclvanray es © Sxremat Srogmnyalion Cogt pasnti ng i } ae!Sey mention secowhory Logrcal Add ers Space -Virtuo) Memory 2oks Main Peery Memoky, "luston +. the ved iran hy thor Programs of larqet Size than acrucd phg stead memory Cn he exe cubecl . * wrruad Memory gives an e Virtues memory deein’c really exrses, hur the Pogr of Seco relary cue are made as Viyrudd oad ° @ Vittued eer fs a feolure tn Cas, here large PM{rams Con store themselves In Form of page, while therr creation cory anet oa the requwifed pages of porten of processes are Loodedl fn to Hne main memory, 7. Terms Related +0 virtual memory | © Locality of reherence 1 In Locality of veperence fc is Forecage Whether og page fs sical +o be Teterencect Pn neat fuluve or noe dependh'ng eh fs behavior Mn patye (i) pag e Fawt ! When a page, Oleh is net Mh main memo y fs reference, then @ poge fault” ares. Ay this time the 0-S Loads thar Page Working SEO > The ser of Pages wluch ave Cex vel Tetented to an ay working Seb . tn main memory in Phy srcas memory f moment ts cal el ® Pege yeplace ment polrey : Te thee vs no Page Frame, in main ieee Gccommodake new Page, the ©S Oveswrite, Some exseing Pages. @ Biry page 2 A page whi'cl v's modRred after fe ts Loaded Mm main memens tS calle ay diary P24 6 Co Bemand paging: In demand Ragin a page a's Loaded fn “memory , | Whee tb 1S demancledt.Access and security Aspects of 0-5 Secatlry Seeuriey System wilt control, through ure oF Specific Pentures, acces Eo fnformotion that only authorized Individuod or procetses epesading on therr G) eles? oil have oetts, vd ead, write er delete. Elements of secustly peace a ee te condifentrablry : Ensuring ther the informalion fe not accersed in Gn unaurhorized mannek fe hy conteoili ng read Sperobien . 9. Integrity + Ensuring that Prformation fs nov amended or Aeleteel tn Gn unauthorized mannet te hy Conreolling writ® appl spetation. thas (nformealion is 3. Availobility 1 Ensuring aGuoilahle to Outhorized wey a righr time ie by Controlling reas) and delete speralidn,(Ct @ what ave the attacks On secusfty. ¢ 4) 4. Authenticalion > Guessing or Stealing Some body's password and then We rE: + Use of vender Supplied P con be used by oe sgctem admin = anaes porsword. > tf ures Logs On ahd goes for rea, then using terminal fo aeens conFrdenbad info. aagword which 2. Browsling ; > An Some Systems, These existe Files with accers Controls, which are very permissive, > One can browse Throwyh the System frie re ger 4uic tefermelion, after Bluch , unperected eiiea/ Jotabares Could be easily acessed. 5 Con@rdenlial fnFormabien Could be read or even modified. 3. Trap doors * = Some times , software engineers leave Some Secret ent’y point to modify thers prgrams - These are called ETap Aoors- =. Theg Can be misused by otheas. &. Electric dela capture ¢ -y Use of achvVe oF passive write traps, yechaiw ean ied: pick up thet sere? yao al’en and te Tewgnize Whar *s Gisplaye d &n Serecn is called elect tre data caprure. otAG §. Invalid paramedets + > passing fnvabicl parameters mey Conte Setious secutiny violations. 6. Line trapping * > A spectal terminad fs ured to tap fro a communcotion Une Tr Caures accets bo Conticdentiod dali F. Waste Receveng i. ae By using Some techuique deleted ries can he recovered, Password may be seollecttal 8. Ro age Software : . Certain programs like Worms, viruses attack On System=> Compurer Virus A compurer Virus fs a program Seqment wereten with @ cleat Intention of in Feeting Other programs. Tt gers enko many usePuk Pedgrams. There Gre several types OF viruses, 4. Boot Sector in€ectors * PD viruz can ger Inte Syctem mem re the madine sg booted with on Infected Ffloopy Or lool harddisk — 2. Memory Resident infector + t+ (cod upon exeabion of an Infected! Frle. Subsequantly , whenever o hon infecred file Ys execufed the virus "nFecte Te. a. fle Specrfre {nfectors ' *% Infection occurs When Ynfecrecd Pile execatect. A. Genera puspost tnfecror . T+ Pokect exe file. Tnfection Methods 4. Append. 2. Replace. a Inserr a. Delere S- Redirect0- Your pasticulag sjw Pe out oF MEINE Rex Prop @ Anarord virus derected > ok, Tha Take $15 Off your Fre 3 ade. @ to oetivats new Ohutape Pancu’n Yau muse - Provire (a Faienols. © Cony eeu toons, you Ore Luck Wer, Wefan - > Botk doos. > Bhes bodalke.2 piscurs virus detection, temoval & prevenden Whar ate Compuser worms 7 Differentralg beween Computes worms anol Compute, viruses. © pt veruses = A computes Worm fs > A computer virus Is Complies program net & Complete program bus & pott OF program | > A Computer worm Can lh Vaneced Viral = ‘independent 'y fan net ocr Pndepeslot ty _ a Genezally te de ner Conte |5 3; Comes. direct harm direct haim to the to the Computea Sysrem, Compuder system, 3 tt Jue gou on oo A Compuded vir ws On Fo nerwork and Comupis wte & doka Consumes NetWork Tesousces to 0 loge extent: 2 Vrojan Greek ging as ae > feces oSCo Fixed pagn tion . Past Hon be created — opurc} noe changed Patritien can be ot the detinect time OF generabion| - Ir suffers from protien OF Mrrernal Fraqmentolion Ro. ef Partdron And thery Stees ate Fixed => Ge Ul stycry > Seek serten > seekd sercat > Eblp gt TCP 25 Yartoble part hdn 4. Partitior createel Con be chong ed. Oe Can net be of Part Hon etined ar the time Gene rolien, 4. Prellem ef frreanal Progmerbion rs Solved 4. herr sizes are Vawehie i Peles No- of Patt Hen Anol windows %& xP Uns > veo