Question

In: Computer Science

Suppose the following disk request sequence (track numbers) for a disk with 200 tracks is given:...

Suppose the following disk request sequence (track numbers) for a disk with 200 tracks is given: 23, 89, 132, 42, 97, 35, 187 Assume that the initial position of the R/W head is on track 100. Draw the diagrams for arm movement for the seek strategies given below. Calculate the total and average number of tracks travelled and conclude which strategy performed best in the given scenario. Note: You can use pencil and paper method to draw, but you have to write your id on every pic included in the answer sheet.

a) FCFS

b) SSTF

c) SCAN

d) C-SCAN

e) LOOK

f) C-LOOK

Solutions

Expert Solution

If you liked the solution then give a thumbs up ? it will be really appreciated ?

venereology answered 1 year ago
Next > < Previous

Related Solutions

Suppose the following disk request sequence (track numbers) for a disk with 200 tracks is given:...
Suppose the following disk request sequence (track numbers) for a disk with 200 tracks is given: 23, 89, 132, 42, 97, 35, 187 Assume that the initial position of the R/W head is on track 100. Draw the diagrams for arm movement for the seek strategies given below. Calculate the total and average number of tracks travelled and conclude which strategy performed best in the given scenario. Note: You can use pencil and paper method to draw, but you have...
(a) The Fibonacci numbers are the numbers in the following integer sequence, called the Fibonacci sequence,...
(a) The Fibonacci numbers are the numbers in the following integer sequence, called the Fibonacci sequence, and are characterised by the fact that every number after the first two is the sum of the two preceding ones: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 114, … etc. By definition, the first two numbers in the Fibonacci sequence are 0 and 1, and each subsequent number is the sum of the previous two. We define Fib(0)=0,...
Given the following numbers in the given order, show the red black tree              100, 200,...
Given the following numbers in the given order, show the red black tree              100, 200, 150, 170, 165, 180, 220, 163, 164 Show the pre-order traversal of this red black tree while showing the color of each node in the pre-order traversal. Write (C++) the red black tree code and insert the above numbers. Show the screen shot of the pre-order traversal of the resulting tree. Distinguish the colors by writing a * next to the black color values....
Consider a single-platter disk with the following parameters: rotation speed: 7200 rpm; number of tracks on...
Consider a single-platter disk with the following parameters: rotation speed: 7200 rpm; number of tracks on one side of platter: 30,000; number of sectors per track: 600; seek time: one ms for every hundred tracks traversed. Let the disk receive a request to access a random sector on a random track and assume the disk head starts at track 0. a. What is the average seek time? b. What is the average rotational latency? c. What is the transfer time...
Please use C++ 1. A Sequence of numbers and a sum is given as input. List...
Please use C++ 1. A Sequence of numbers and a sum is given as input. List all combinations of numbers that can add upto the given Sum. User input:- Enter numbers: -   1, 3,7,9,11 Enter a sum :- 20 Output: 11+9 = 20 1+3+7+9 = 20 2. Print absolute prime numbers between a given range:- Enter Range - 2,99 For eg Prime numbers are:- Prime numbers ==> 2,3,5,7,11,13,17,19,23 Absolute Prime numbers ==> 2,3,5,7,11,23 3. Write an encoder and decoder program,...
Describe the following disk concepts or compo- nents. a. Platter and recording surface. b. Track. c....
Describe the following disk concepts or compo- nents. a. Platter and recording surface. b. Track. c. Cylinder. d. Read/write head. e. Access-arm mechanism.
E.C. 2. (10 pts.) Suppose that (sn) is a sequence of real numbers such that sn...
E.C. 2. (10 pts.) Suppose that (sn) is a sequence of real numbers such that sn ≥ 0 for all n ∈ N. (a) Show that the set of subsequential limits of S satisfies S ⊆ [0,∞) ∪ {+∞}. (b) Is it possible for S = [0,∞) ? (Hint: apply Theorem 11.9.) Legible handwriting is a must
Suppose that you are given the following information. Answer the following question: Labor force 200 million...
Suppose that you are given the following information. Answer the following question: Labor force 200 million Adults in the military 1 million Population below 16 50 million Employed adults 180 million Institutionalized adults 3 million Not in Labor force 40 million 1. What is the total population? ( show your work) 2. How many people are unemployed, and what is the unemployment rate? 3. what is the labor force participation rate?
python coding Suppose a list of positive numbers is given like the following list (remember this...
python coding Suppose a list of positive numbers is given like the following list (remember this is only an example and the list could be any list of positive numbers) exampleList: 15 19 10 11 8 7 3 3 1 We would like to know the “prime visibility” of each index of the list. The “prime visibility” of a given index shows how many numbers in the list with indexes lower than the given index are prime. For instance, in...
Suppose we have an array A that contains a prime numbers from 2 to 200 in...
Suppose we have an array A that contains a prime numbers from 2 to 200 in sorted order. How many items of the array A would the binary search algorithm have to examine before concluding that 60 is not in the array A? 30 200 100 6 2- Suppose we have an array that contains 182 village name. These names are sorted alphabetically. How many names would binary search algorithm examine to locate a particular name in the array, in...
ADVERTISEMENT
Subjects
ADVERTISEMENT
Latest Questions
ADVERTISEMENT