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 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

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 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 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
Write a JAVA program that will maintain a phone directory using a Linked-List. The program should be able to perform the following operations: Add persons details (first name, last name, phone number, city, address, sex and email) to the phone directory, where phone numbers in the directory have to be unique. (Note: each person record will store in one node in the linked-list and insert each person to the last) Delete any person details by a given phone number. Update telephone number by providing person first name. Display all details of persons from a phone directory. Search telephone number based on person first name. (Note: use sequential search to find all telephones for the given first name) Sort all persons in the phone directory ascending based on person first name. (Note: use bubble or selection sort to arrange the entire phone directory)
Suppose that the sequence P R I O * R * * I * T * Y * * * Q U E * * * U * E (where a letter means insert and an asterisk means remove the maximum) is applied to an initially empty priority queue. Give the sequence of letters returned by the remove the maximum operations.
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
Write a JAVA program that will maintain a phone directory using a Linked-List. The program should be able to perform the following operations: 1) Add persons details (first name, last name, phone number, city, address, sex and email) to the phone directory, where phone numbers in the directory have to be unique. (Note: each person record will store in one node in the linked-list and insert each person to the last) 2) Delete any person details by a given phone number. 3) Update telephone number by providing person first name. 4) Display all details of persons from a phone directory. 5) Search telephone number based on person first name. (Note: use sequential search to find all telephones for the given first name) 6) Sort all persons in the phone directory ascending based on person first name. (Note: use bubble or selection sort to arrange the entire phone directory) Project Outputs The output has to display a menu of choices. Then the user can select which operation want to perform.…
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
Consider a situation of a boarding gate of a plane where passengers are allowed to board on the place based on their age. All passengers are on a line (queue) to board on the place, however, the oldest one is always allowed to board first no matter when he/she got in the line (queue). In this case, you cannot sort the passengers by their age, however, you know that oldest ones are always at the top of the line. This is an example of a priority queue where data will be accessed and processed based on their level of priority. Suppose you need to organize such type of data so that the data in highest priority can be accessed in a constant time, O(1). What type of data structure would you use in such cases? Justify your answer.
program in C# the following sequence: S1 = N; S2 = S1 + 1; S3 = 2*S1 + 1; S4 = S1 + 2; S5 = S2 + 1; S6 = 2*S2 + 1; S7 = S2 + 2; … Using the Queue class, write a program in C# which by given N prints on the console the first 50 elements of the sequence. Example: N=2  2, 3, 5, 4, 4, 7, 5, 6, 11, 7, 5, 9, 6, …
Suppose that we would like to implement a queue system for a commercial website. Given that the website offers 3 items for sale (or a list of items), each item has a limit quantity in stock. Implement a queue of customers, each customer can buy only a few number product among the available three items. Determine the item name, their quantity in stock; Specify a queue of n customers, each customer can buy k products from one item (k is different for each customer); Customers take turn to enter (enqueue) and leave (dequeue) the queue according to the FIFO order to purchase wanted products; If a customer successfully purchased products, then display a message and reduce the number of products in stock; otherwise, if the item has been run out, display a warning message. Implement the above problems in C/C++ using a Queue data structur. Write a main function for testing all written functions.
A singly linked list can be reversed by altering the nodes' pointers. The original list's nodes should still contain the data that the list represents.For instance, if a single linked list START is supplied, as in Figure P6.9(a), the list must be reversed using just the links, as in Figure P6.9(b).
Given the queue myData 12, 24, 36 (front is 12), what is the result of the following operations? Enqueue(myData, 48)Enqueue(myData, 60)Dequeue(myData)print(Peek(myData))print(IsEmpty(myData))