• recategorized by
7,547 views
5 5 votes

Disk requests come to a disk driver for cylinders in the order $10$, $22$, $20$, $2$, $40$, $6$ and $38$ at a time when the disk drive is reading from cylinder $20$. The seek time is $6$ ms/cylinder. The total seek time, if the disk arm scheduling algorithms is first-come-first-served is

  1. $360$
  2. $850$
  3. $900$
  4. None of the above

5 Answers

Best answer
10 10 votes

In FCFS, the request which comes first to disk driver is served first.

Given cylinder Queue: $10, 22, 20, 2, 40, 6, 38$

Head Movements:$(20-10)+(22-10)+(22-2)+(40-2)+(40-6)+(38-6)=146$
Seek Time= $6ms$/cylinder

For $146$ seeks, seek time= $6*146=876ms$ 

Hence Option d) is the correct answer

• selected by
2 2 votes

In FCFS, the request which comes first is served first.

Given cylinder Queue: $10, 22, 20, 2, 40, 6, 38$

Head Movements:$(20-10)+(22-10)+(22-2)+(40-2)+(40-6)+(38-6)=146$

Seek Time= $6ms$/cylinder

For $146$ seeks, seek time= $6*146=876ms$ 

Option d) is the correct answer

Answer:
Position:
Show:

Related questions

4 4 votes
2 answers 2 answers
4.0k
4.0k views
Arjun asked Apr 22, 2018
4,030 views
A particular disk unit uses a bit string to record the occupancy or vacancy of its tracks, with $0$ denoting vacant and $1$ for occupied. A $32$-$bit$ segment of this str...
6 6 votes
3 answers 3 answers
14.1k
14.1k views
Arjun asked Apr 22, 2018
14,084 views
The following $C$ program:{ fork(); fork(); printf("yes"); }If we execute this core segment, how many times the string yes will be printed?Only once2 times4 times8 times
4 4 votes
3 3 answers
5.2k
5.2k views
Arjun asked Apr 22, 2018
5,222 views
The difference between a named pipe and a regular file in Unix is thatUnlike a regular file, named pipe is a special fileThe data in a pipe is transient, unlike the conte...
2 2 votes
2 answers 2 answers
1.7k
1.7k views
Arjun asked Apr 22, 2018
1,713 views
Determine the number of page faults when references to pages occur in the order - $1, 2, 4, 5, 2, 1, 2, 4$. Assume that the main memory can accommodate $3$ pages and the ...