recategorized by
3,644 views
4 votes
4 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
recategorized by

5 Answers

Best answer
7 votes
7 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 votes
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:

Related questions

2 votes
2 votes
1 answer
1
3 votes
3 votes
3 answers
2
Arjun asked Apr 22, 2018
10,799 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
3 votes
3 votes
2 answers
3
Arjun asked Apr 22, 2018
3,729 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...