= 1O_Management_and_Disk week 9 Saving... ~ Search a @ - o x Wj sutosave File Home Insert Draw Design Layout References Mailings Review View Help |p Comments | | 7 Editing ~| Tr Find > al 9 oo Q@ & : + : z b Normal No Spacing Heading 1 Heading 2 & Replace Dice | Editar | Adciis LJ [> Select v Clipboard fi Font & Paragraph Bi Styles & Editing Voice Editor Adc+ins ~ (C53C303X Assignment 9.4 - 0 Management and Disk Scheduling Name Listen to the narrated PowerPoint and watch the assigned videos for Week 9. Work the following problems. For credit you must show all steps and all work. 4. Consider the following series of disk requests: '300,330,50,220,450,280,390,420, 100,70 Determine the number of cylinders that would be traveled for each of the following Disk Scheduling algorithm assuming the previous request was 219 and the disk head is currently on cylinder 350. Show the results of each traversal from one request to the nexi. Be cure and show your work e0 I can see what you have done. For example, if the read head moves from track 300 to 330 be sure and write something like: 300 to 330 = 30 3301050 = 280 'Then sum the number of traversals. Note that the disk has 500 cylinders (0 through 499). Be sure to show the order of disk reads as indicated above and which disk scheduling scheme results in the lowest number of cylinders traveled. Will this always be the case? Briefly describe how each algorithm works. Here are the algorithms: A. FGFS. B. SSTF c. SCAN D. C-SCAN E, C-LOOK O 2. How long would it take te transfer an 8KB block on a 18,000 RPM dick with a2 ms average seek time, 1Gbisec transfer rate with a 1 ms controller overhead? Show your work. 3. Do alitie research! Write one or two pages explaining how a fle system using (npdles.and a file system using an index such as a FAT works. What are the benefits and issues with each? A @ Go FwWo H++ 63% Pagelof1 271 words [English (United States) Text Predictions: On' {@Accessibility: Good to go Q Search L - e fe 11:16 AM 6/1/2025 66F Mostly sunny