Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive currently serving a request at cylinder 2,150, and the previous request was at cyline 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 t disk arm moves to satisfy all the pending requests for each of the following dis scheduling algorithms? c. SCAN d. LOOK

Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive currently serving a request at cylinder 2,150, and the previous request was at cyline 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 t disk arm moves to satisfy all the pending requests for each of the following dis scheduling algorithms? c. SCAN d. LOOK

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

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 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 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 6,000 cylinders, numbered 0 to 5999. The drive is currently serving a request at cylinder 3797, and the previous request was at cylinder 1375. The queue of pending requests, in FIFO order, is: 1589, 5474, 2104, 1350, 4336, 3678, 1697, 1780, 3794, 3982, 2508 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? Show the calculation result Show the sequence of the position of the head and calculation steps 1. SSTF 2. SCAN
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 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
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
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
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 Alice computes the Secret suffix MAC (page 322: secret suffix MAC(x) = h(x || key)) for the message ”GD” (in ASCII) with key " H”(in ASCII) that both Alice and Bob know. The hash function that is used is h(x1x2x3)= g(g(x1 XOR x2) XOR x3 ) where each xi is a character represented as 8 bits, and g(x) is a 8-bit string that is equal to the complement of bits in x. For example, g(10110011) = 01001100. The MAC is 8 bits. (8-bit ASCII representation of the characters is given below.) What is the Secret suffix MAC computed by Alice? Show the MAC as the single character. What information is sent by Alice to Bob.
In MaxPQ, suppose that a client calls insert() with an item that is larger thanall items in the queue, and then immediately calls delMax(). Assume that there areno duplicate keys. Is the resulting heap identical to the heap as it was before these operations? Answer the same question for two insert() operations (the first with a keylarger than all keys in the queue and the second for a key larger than that one) followedby two delMax() operations.
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.…