Consider a disk queue with requests for I/O to blocks on cylinders 108, 193, 51, 132, 24, 134, 75, 77. The head is initially at cylinder number 63. The cylinders are
numbered from 0 to 199.
Find out the total head movements using the following algorithms
a) First Come-First Serve (FCFS)
b) Shortest Seek Time First (SSTF)
c) Elevator (SCAN)
d) Circular LOOK (C-LOOK)

Write a program that reads a file consisting of students’ test scores in the range 0–200. it should then determine the number of students having scores in each of the following ranges: 0–24, 25–49, 50–74, 75–99, 100–124, 125–149, 150–174, and 175–200. output the score ranges and the number of students. (run your program with the following input data: 76, 89, 150, 135, 200, 76, 12, 100, 150, 28, 178, 189, 167, 200, 175, 150, 87, 99, 129, 149, 176, 200, 87, 35, 157, 189.)

In a game with three frames, where will the objects on layer 1 appear? a. next to the play area b. in the middle of the game c. behind everything else d. in front of everything else

Amitha writes up a one-page summary of a novel during her summer internship at a publishing company. when she reads over the page, she realizes she used the word “foreshadow” seven times, and she would like to reduce the repetition. which tool would best amitha solve this problem?