Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is currently serving a request at cylinder 2,150, and the previous request was at cylinder 1,805. The queue of pending requests, in FIFO order, is: 2,069; 1,212; 2,296; 2,800; 544; 1,618; 356; 1,523; 4,965; 3,681 Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for each of the following disk-scheduling algorithms? a. FCFS b. SCAN c. C-SCAN d. LOOK e. C-LOOK

Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is currently serving a request at cylinder 2,150, and the previous request was at cylinder 1,805. The queue of pending requests, in FIFO order, is: 2,069; 1,212; 2,296; 2,800; 544; 1,618; 356; 1,523; 4,965; 3,681 Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for each of the following disk-scheduling algorithms? a. FCFS b. SCAN c. C-SCAN d. LOOK e. C-LOOK

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter8: Advanced Data Handling Concepts

Section: Chapter Questions

Problem 20RQ

See similar textbooks

Similar questions

Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is currently serving a request at cylinder 2,150, and the previous request was at cylinder 1,805. The queue of pending requests, in FIFO order, is: 2,069, 1,212, 2,296, 2,800, 544, 1,618, 356, 1,523, 4,965, 3681 Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for each of the following disk- scheduling algorithms? e. C-SCAN f. C-LOOK
Suppose that a disk drive has 6,000 cylinders, numbered 0 to 5,999. The drive is currently serving a request at cylinder 3,250, and the previous request was at cylinder 4,805. The queue of pending requests, in FIFO order, is:1515, 1212, 1296, 3800, 544, 618, 356, 2523, 5965, 4681Starting from the current head position, what is the total distance (in cylinders) that thedisk arm moves to satisfy all the pending requests for each of the following diskscheduling algorithms?a. FCFSb. SSTFc. SCANd. LOOK
Suppose that a disk drive has 7,000 cylinders, numbered 0 to 6,999. The drive is currently serving a request at cylinder 1,958, and the previous request was at cylinder 1,807. The queue of pending requests, in FIFO order, is: 2,069, 1,212, 2,296, 2,800, 544, 1,618, 356, 1,523, 4,965, 3681 Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests with First Come First Serverd(FCFS) alogrithim?
Suppose that a disk drive has 6,000 cylinders, numbered 0 to 5999. The drive is currently serving a request at cylinder 2225, and the previous request was at cylinder 5195 (Hint: this indicates the reading head’s moving direction). The queue of pending requests, in FIFO order, is: 5962,2876,5452,1369,3594,5046,866,3269,409,1744 Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for each of the following disk-scheduling algorithms? a. FCFS SSTF SCAN LOOK C-SCAN C-LOOK
Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is currently serving a request at cylinder 2,150, and the previous request was at cylinder 1,805. The queue of pending requests, in FIFO order, is: 2,069 1,212 2,296 2,800 544 1,618 356 1,523 4,956 3,681 Calculate the total seek time for each of the schedules TOTAL DISTANCE TOTAL SEEK TIME FCFS SSTF SCAN LOOK C-SCAN C-LOOK
In the Josephus problem from antiquity, N persons agree to the following population-reduction technique because they are in desperate need. They form a circle and place themselves in spots numbered from 0 to N-1. As they move around the circle, they eliminate every Mth person until there is only one person left. Josephus allegedly discovered where to sit to avoid being eliminated, according to legend. Create a client for the Queue system called Josephus that takes two parameters, N and M, from the command line, and prints the order in which persons are removed (thereby indicating to Josephus where to sit in the circle).% java Josephus 7 21 3 5 0 4 2 6
Suppose there are 8 processes in a system which are waiting to be assigned to the ready queue. The processes have the following properties. Process P1 has burst time 15, priority 6 Process P2 has burst time 12, priority 4 Process P3 has burst time 6, priority 12 Process P4 has burst time 5, priority 11 Process P5 has burst time 8, priority 9 Process P6 has burst time 9, priority 2 Process P7 has burst time 2, priority 20 Process P8 has burst time 17, priority 6 You have to use Multilevel Feedback Queue. It has three queues. The first queue takes processes with priority value from 1 to 5, the second queue takes processes with priority value of 6 to 10 and rest of the processes go to the third queue. First queue follows Round Robin Scheduling with time quantum= 4 Second queue follows Round Robin Scheduling with time quantum = 6 Third queue follows FCFC scheduling. Draw the gantt chart and calculate the average waiting time.
In the Josephus problem from antiquity, N people are in direstraits and agree to the following strategy to reduce the population. They arrange themselves in a circle (at positions numbered from 0 to N–1) and proceed around the circle,eliminating every Mth person until only one person is left. Legend has it that Josephusfigured out where to sit to avoid being eliminated. Write a Queue client Josephus thattakes N and M from the command line and prints out the order in which people areeliminated (and thus would show Josephus where to sit in the circle).% java Josephus 7 21 3 5 0 4 2 6
Given the following sequence of arrivals and called to the counter, what will be the content of the following queue: 1. Alia 2. Shaari 3. Alwee 4. Marion 5. Call from counter 6. Aliffa 7. Call from counter 8. Call from counter 9. Shukri 10. Leon Select one: a.Marion, Aliffa, Shukri, Leon b.Alia, Shaari, Alwee, Marion c.Alia, Shaari, Shukri, Leon d.Alia, Shaari, Alwee, Marion, Aliffa, Shukri, Leon
Hi, currently I'm working on a project of "Queue Management System". I'm doing it by using ESP8266. So the scenario is that I've two ESP8266. One ESP8266 is connected to the keypad (4x4) and the other ESP8266 is connected to the 7 segment display. When I press any number from the keypad (4x4) it will show on single digit 7 segments. So I need a code of Arduino IDE for this scenario. Please help me with this. Thanks!!
Queuing system A has a utilization of 80 percent, and queuing system B has a utilizationof 90 percent. Both have a single server. Say the utilization of both systems increasesby 5 percent; that is, A increases from 80 percent to 85 percent while B increases from90 percent to 95 percent. Which system is likely to experience the bigger change in theaverage time in queue?a. System Ab. System Bc. Time in queue for each system will increase by the same amount.d. More information is needed to determine which has a bigger change in average time inqueue.
Suppose you are provided a file “process.txt” having data in the following format:Process_Name Priority_Level Entry_TimeP1 1 13.43.41 You need to write C++ code that should read data from the file and use that data to build doubly linked for implementation of the priority Queue. The priority of the process should be according to given priority_level(1 to 6, where 6 is least and 1 is higher) but if two processes with the same priority_level exist in the queue then the process with earlier entry time should exit first.User should be given choice to whether enter a new process into the queue or dequeue existing process.