EXERCISE 2 Name Date. Section. 1) Start the Job Scheduling app and cick on the ramon. Four jobs appear in the jb it 2) Rum the program using the first come, st ered algorithm. You should pt the sume ans a shown in the Acti seton. 8) Select Shores Job Hirt fom the era menu an lick on the Ru ton Dos this metho ‘ve the fame total te roqlrment asthe fst come, ist saved ago? Note the reac ime ‘completion. sitter han fest come fas served? Take a srensl 4) Select ound Robin fom the drop-down mes and click on the Ra button. Wee down the merge agoletion. ow does it compare to the other two methods” Takes sreenshot. 3. No, il doesnot have the same tial Une required as tis 479 in FCFS and 387m SUF. Ves, has a beteraverage time to completion than at 96 75 vs 119.75in FCS, 4. Completion time: 122 25I requires a lot mare time in total (725), but the average time to ‘completion is substantially shorter. 5) Lacking the lof city, ha sundae diferent abo ound rb om the olbe as 4b scheduling algorithms? Wt kind of computing system wou kel refer to use ound one [Every pracess recaives the same amount of ime in Round Retin, every process in FCFS is Inandled one at 2 ime based on pity, and every process in SUF is given time based on ‘se withthe smallest process being procesced Fra na system vith numerous long-running ‘processes, round robin may be lized to prevent them from intertring with shorter processes.4) Restart the app and click on the Buample huton agin, (You can restart the ap by closing and opening your browser) Delete jobs 2nd 8 again. 5) Ada jb hat eaines 75 KB, Whove do you exes itt go? Into to lat, approprataly sized amply black = 9) Redo tep 4. Select the Best it algnithe rom the pulldown menu. Adda 75-KB job. Whee wll it ‘Tomake i essier 0 access, the 75 KB Job was placed in he nearest empty sector ‘The 75 kB job went into the closest empty section so that itis easer to access “7 Based on your cbseraions of the thee algonthms on the ample request st, tate what kind of request Ist would make frst come fst served lake up 2 tof ie. In other words, what pattern ‘would the numbers the request ist have to show so that ist come, fist served consumes ot tine? ‘The order ofasks in a first-come, fist-served (FCF) queue directly affects processing time. No matter how big the work is # 2 request list starts with ona that requires lot of processing, all following tasks may have to wea longer The head-o-ine’ blocking isthe term forth phenomena As a raul alljobe in the lt wil have an extended average processing time i there a rend where larger tasks are a the font ofthe queue. This is ‘bocauso cach task that comet afer has to wall forthe provious anos to Thich Before it can ba procascod. Essential, a higher number athe beginning indicates thatthe system vl take longer to finish that work than ‘moving onto others which can bs insfician f subsequent tasks are comparatively smal and quicker to process 28) Why does the operatlog psten always we the Compael Mamary button when Nea guessas to why frequent compaction swe ne jb enters? Its best to avoid compacting memory to frequently as this could cause data loss when another process fs runningEXERCISE 1 Name Date Sey 1) Stam the Placement of Joks in Memory app and click on the Example button. Delete Jobs 2 and 5 Hw many holes ae there? What ithe total amount of tee memory? What the largest jo th ould be entered without compacting the marory? 2 Holes “400 KB of fre memory largest job of 300KE, 2) Tyo ada job that 125 Kt long What happens? “The final portion is fled withthe 125 KB Job, leaving 275 KB of memory avallable 3) Comgaet the memory (ick om the Corgpact button) ani answer the questions in steps 1 and 2 again 400K of ftee memory in one hole. A 400KBIT job edds the job tothe final block, utlizing the remaining 275 KB of memory