retagged by
1,651 views
1 votes
1 votes

In ________ disk scheduling algorithm, the disk head moves from one end to other end of the disk, serving the requests along the way. When the head reaches the other end, it immediately returns to the beginning of the disk without serving any requests on the return trip.

  1. LOOK
  2. SCAN
  3. C-LOOK
  4. C-SCAN
retagged by

2 Answers

3 votes
3 votes

ANSWER is D. In Circular scan head moves in one direction and servers request on its way, when it reaches to other end of the disk, it returns to the beginning of the disk without serving any requests on the return trip.

0 votes
0 votes
D

becoz if u go  clockwise direction or right side  one circle compeleted then automaticly come begining of the disk
Answer:

Related questions

0 votes
0 votes
3 answers
1
Arjun asked Nov 5, 2017
2,796 views
Which module gives control of the CPU to the process selected by the short-term schedular?DispatcherInterruptSchedularThreading
1 votes
1 votes
2 answers
2
Arjun asked Nov 5, 2017
3,067 views
Which speed up could be achieved according to Amdahl's Law for infinte number of processes if $5\%$ of a program is sequential and the remaining part is ideally parallel?...
0 votes
0 votes
1 answer
3
Arjun asked Nov 5, 2017
2,519 views
Which of the given wireless technologies used in IoT, consumes the least amount of power?ZigbeeBluetoothWi-FiGSM/CDMA
0 votes
0 votes
2 answers
4
Arjun asked Nov 5, 2017
4,592 views
Which of the following is not a Clustering method?K-Means methodSelf Organizing feature map methodK- nearest neighbor methodAgglomerative method