5. Suppose that a disk drive has 40 cylinders, numbered 0 to 40. The drive is currently serving a request at cylinder 20 (the previous request served was at cylinder 19) when the last of these requests is made with 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, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending request and also calculate the total seek time needed to serve these requests, for each of the following disk-scheduling algorithms? Explain with the help of a diagram in each case. [2X4] a. FCFS b. SSTF C. SCAN d. LOOK

5. Suppose that a disk drive has 40 cylinders, numbered 0 to 40. The drive is currently serving a request at cylinder 20 (the previous request served was at cylinder 19) when the last of these requests is made with 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, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending request and also calculate the total seek time needed to serve these requests, for each of the following disk-scheduling algorithms? Explain with the help of a diagram in each case. [2X4] a. FCFS b. SSTF 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

Related questions

Q: A certain picture is constructed of a matrix of dots of color which have been created by mixing 3…

A: Picture is of matrix form with dots of color, created by mixing 3 primary colors of ink. we have to…

Q: Suppose that unfolded boxes are stacked, on top of one another, on a storage rack of height 2m. If…

A: Logic used:- Number of boxes= height/ thickness of Each box

Q: Suppose that a disk drive has 200 cylinders, numbered 0 to 199. The drive is currently servicing…

A: Given that, The total number of cylinders= 200 numbered from 1 to 199 Current service request at…

Q: Disk I/O: Consider a magnetic disk with N cylinders rotating at a speed of R revolutions per minute.…

A: Actually, OS is an system software which manages computer hardware and software.

Q: we apply the conditional function on E, F, and G buffers. if the leftmost hexadecimal digits of…

A: Step 1 The answer is given in the below step

Q: Suppose that a disk drive has 40 cylinders, numbered 0 to 40. The drive is currently serving a…

A: Operating systems use a disk scheduling algorithm to schedule I/O requests that arrive at the disk.…

Q: write algorithm: Input: Parameters for the GA. Output: Population of solutions, P. Each of these…

A: Input: Parameters for the GA.Output: Population of solutions, P. Each of these solutions can be used…

Q: Suppose you are asked to design a rotating disk where the number of bits per track is constant. You…

A: Consider the information given:

Q: ppose that a disk drive has 5,000 cylinders, numbered 0 to 4999. The drive is currently serving a…

A: I have solved all the 4 parts and have provided step wise solution for it. In the end we will…

Q: suppose that a disk drive has 200 tracks, numbered 0 to 199. The drive is currently serving a…

Q: Write a script file to make a table with x and y columns with 100 rows and plot the curve y as a…

A: Please upvote me please. I am providing you the correct answer below. # python code import…

Q: The parity function is a very simple hash function producing a one-bit digest, which is 0 if the…

A: Hamming code is a bunch of error detection codes that can be utilized to distinguish and address the…

Q: First give the Trs for this NFA: Trs(q1, 0) = {} Trs(q2, 0) = {} Trs(q2, 1) = {} Then give…

A: - We have to work with NFA and it's transformations.

Q: . A security system is used to encrypt the password of a cryptocurrency wallet (crypto wallet) and…

A: There are 10 different codes and at least 6 of them are required to reconstitute the password to…

Q: Connect a 5*7 dot-matrix display to the 8051-microcontroller (Draw the schematic on paper). Then,…

Q: The DFA M = ({90,95}, Σ, 6, 90, 91, 95}) with = {0, 1} is given by this table for the transition…

A: See below step for proper explanation.

Q: ne method that can be used to compress text data is run length encoding (RLE). When RLE is used the…

A: Input : Text to compress Output : Compressed text

Q: Deep in the forest of Hanoi there is a temple with three large pillars. At the beginning of time…

A: here the scenario is related to towers of Hanoi problem. where there are three pillars we need to…

Q: For Heap File with a page directory, assume that a page can contain up to 100 directory entries and…

A: Given Statement: In this question firstly we will find out what is already given in our question.…

Q: In the desert there is a jail. After rebellion the single guard has been immobilized. He watched…

A: Answer is given below. Assume the two prisoners are P1 and P2 and the guard is G. P1 travels…

Q: Assume we have a hard disk with 300 cylinders (numbered 0 to 299) with the disk head starting at…

Q: edict when the world would end. They had a set of three diamond needles. ed on the first diamond…

A: The Above problem can be handled the same way as Tower of Hanoi Understanding the problem and…

Q: To solve the Hanoi Towers problem, run the following program in image 1 with using the recursive…

A: #include <bits/stdc++.h>using namespace std; void towerOfHanoi(int n, char from_rod,…

Q: 2. For the DFAs given below find the minimum state DFA. The start state is go. The set of final…

A: We need to find minimum Dfa state. See below step.

Q: QUESTION 5 The Towers of Hanoi game starts with a pile of disks with different sizes on one of three…

A: The question is on finding the accurate recurrence relation for the given problem.

Q: Implement the following Boolean function F(A, B, C, D)= m(1,4, 6, 7, 8,9, 12, 13,15) with: An 8x1…

A: In the given question, the function F(A,B,C,D) is in terms of minterms that is to be implemented…

Q: (a) Suppose a disk drive has 3,000 cylinders, numbered 0 to 2,999. The drive is currently serving a…

Q: When purifying drinking water you can use a so-called membrane filtration. In an experiment one…

Concept explainers

Hash Table

A hash table also called a hash map, is a data structure that maps key-value pairs. The hash table can be used in complex systems to provide fast access and compact storage. A hash table is a structure that stores data in an abstract data type kind of associative array. It keeps data in an array format, with a distinct index value for every data value. If the index of the required data is known, then the data can be accessed very easily.

Question

100%

5. Suppose that a disk drive has 40 cylinders, numbered 0 to 40. The drive is currently serving a request
at cylinder 20 (the previous request served was at cylinder 19) when the last of these requests is made
with 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, what
is the total distance (in cylinders) that the disk arm moves to satisfy all the pending request and also
calculate the total seek time needed to
these requests, for each of the following disk-sc
ling
algorithms? Explain with the help of a diagram in each case. [2X4]
a. FCFS
b. SSTF
c. SCAN
d. LOOK

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

Step 2

Step 3

Step 4

Trending now

This is a popular solution!

Step by step

Solved in 4 steps with 3 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

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
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.
QUESTION 5 The Towers of Hanoi game starts with a pile of disks with different sizes on one of three pegs. The other two pegs start empty. The disks are initially piled in order of size with largest on the bottom. The aim of the game is to transfer all of the disks to a destination peg by moving one disk at a time, never placing a disk on top of a smaller one. The spare peg may be used for intermediate moves. One solution to the problem recursively moves all but the largest disk to the spare peg, moves the largest disk to the destination peg, and then recursively moves all the other disks from the spare peg to the destination peg. This process is described by the following pseudocode: Hanoi( n, start, destination, spare ) // n is the number of disks and start, destination and spare are peg numbers if n>0 Hanoi( n-1, start, spare, destination) moveTopDisk( start, destination) // move top disk on start peg to destination peg Hanoi( n-1, spare, destination, start) Which of the following…
Consider a disk drive that cab complete an average request in 10ms. The time to complete a request is approximately distributed.Over a period of 30minutes, 117,000 request were made to the disk.How long will it take to complete the average request and what is the average number of queued request?
(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.
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
Suppose the head of a moving-head disk with 200 tracks numbered 0 to 199 is currently servinga request at track 100 .The queue of outstanding requests in FIFO order is: 23, 89, 132, 42 and 187.What is the total number of head movements (in cylinders) for the following disk-schedulingalgorithms?
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
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. For the DFAs given below find the minimum state DFA. The start state is go. The set of final states are indicated. (a) The final state set is (93). 01 State 90 91 92 93 91 90 90 92 93 91 93 90 94 93 95 95 96 94 96 95 96 97 96 93 (b) The final state set is (92-95-98). State 0 1 90 92 93 94 95 96 97 98 91 94 92 95 93 97 94 97 95 98 91 97 91 98 92 90 94
solve part B
Student information is being held in a data area, where each student record has the following format: The first nine bytes are the student number, held in ASCII The next byte is the course mark The next word is the section identifierThere are well over three hundred such student records that have been loaded sequentially into memory starting at address $10000. The last record loaded is a dummy record with a section identifier of $FFFF, to show the end of the records.Write an assembler subroutine GetMax that will scan the entire list and find the highest mark. If there is a tie, the first student in the list with the highest mark should be found. The subroutine should return the starting address of this record in address register a3.