. Suppose that a disk drive has 200 cylinders, numbered 0 to 199 and the disk head is initially at cylinder 53. The queue of pending requests, in FIFO order is 98, 183, 37, 122, 14, 124, 65, 67 Starting from the curent 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? i) FCFS ii) SSTF ii) SCAN iv) C-SCAN v) C-LOOK

. Suppose that a disk drive has 200 cylinders, numbered 0 to 199 and the disk head is initially at cylinder 53. The queue of pending requests, in FIFO order is 98, 183, 37, 122, 14, 124, 65, 67 Starting from the curent 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? i) FCFS ii) SSTF ii) SCAN iv) C-SCAN v) C-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

(a) Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder 143, and the previous request was at cylinder 125. The queue of pending requests, in FIFO order, is 86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130 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? i. FCFS ii. SSTF (b) Assume that a disk can perform a seek to an adjacent cylinder in 1 millisecond and a full-stroke seek over all 5000 cylinders in 18 milliseconds. The total seek times for FCFS is computed to be 65.20, SSTF is 31.52, SCAN is 62.02, LOOK is 40.29, C-SCAN is 62.10 and C-LOOK is 40.42. Which of the algorithms is the fastest? And what is the…
929. Suppose that a disk drive has 200 cylinders, numbered 0 to 199. The drive is currently serving a request at cylinder 50, and the previous request was at cylinder 55. The queue of pending requests, in FIFO order, is: 82,170,43,140,24,16,190. 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 the following disk- scheduling algorithms? (You will get full credit if you can work out 3 out of the 5 algorithms. Please clearly indicate which 3 algorithm you did.) a. FCFS b. SSTF C. SCAN d. LOOK e. C-SCAN
Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder 133, and the previous request was at cylinder 115. The queue of pending requests, in FIFO order, is:76,1460, 903, 1764, 938, 1499, 1012,1740,120. 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).SSTF (c) SCAN (d) LOOK (e) C-SCAN (f) C-LOOK
(a) Suppose a disk drive has 3,000 cylinders, numbered 0 to 2,999. The drive is currently serving a request at cylinder 500 and the previous request was at cylinder 600. You are required to construct a queue of random pending requests in FIFO order (of minimum 10 inputs). Starting from the current head position, what is the difference between the total distance (in cylinders) that the disk are moves to satisfy all the pending requests for FCFS and SSTF.
S Edit & Create v e Share 1.. Suppose that a disk drive has 200 cylinders num- bered 0 to 199. The drive is currently serving a request at cylinder 95, the queue of pending requests, in FIFO order is 98, 181, 37, 120, 14, 122, 65, 69. 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 al- gorithm, (1) SCAN (ii) C-SCAN.
2. Suppose that a disk drive has 200 cylinders, numbered 0 to 199. The drive is currently servicing request at cylinder 60 and the previous request was at cylinder 80. The queue has a pending request at cylinder 58, 26, 54, 68, 49, 61, 63, 69 ,24, 14 and 90. Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests by using the Shortest Seek Time First algorithm.
Suppose that a disk drive has 40 cylinders, numbered 0 to 40. The drive is currently serving a requestat cylinder 20 (the previous request served was at cylinder 19) when the last of these requests is madewith none of these requests yet served. The queue of pending requests, in FIFO order, is 5, 25, 18, 3,39, 8, and 35. A seek takes 5ms per cylinder movement. Starting from the current head position, whatis the total distance (in cylinders) that the disk arm moves to satisfy all the pending request and alsocalculate the total seek time needed to serve these requests, for each of the following disk-schedulingalgorithms? Explain with the help of a diagram in each case. a. FCFSb. SSTFc. SCANd. LOOK
suppose that a disk drive has 200 tracks, numbered 0 to 199. The drive is currently serving a request at track 50, and the previous request was at track 20. The queue of pending requests, in FIFO order is, 95, 180, 34,119,11,123,62,64. Starting from the current head position, what is the total distance (in tracks) that the disk arm moves to satisfy all the pending requests, for each of the following disk scheduling algorithms? a. FCFS: b. SSTF
code in python attached please Define a hash table with an associated hash function ℎ(?)h(k) mapping keys ?k to their associated hash value. b) In simple uniform hashing, each key is assumed to have equal probability to map to any of the hashes in a given table of size m. Given an open-address table of size 500500 and 22 random keys, what is the probability that they hash to the same value? What is the probability that they hash to different values?
b) Consider a disk queue with requests for IVO 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)
Suppose Disk drive has 300 cylinders. The current position of head is 90.The queue of pending request is 36,79,15,120,199,270,89,170Calculate head movement for the following algorithms. i) FCFS ii) SSTF
ng Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is currently serving a request at cylinder 2,100, 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- C-SCAN (the head by default goes to the higher cylinder first.)