5 years ago in Operating System

Which of the following disk scheduling strategies is likely to give the best throughput ?

[A] Farthest cylinder next
[B] Nearest Cylinder next
[D] Elevator algorithm
Next Question

Overall Stats

Attempted 963
Correct 69
Incorrect 341
Viewed 553


Bhawna wadhwa - 2 years ago

Elevator Algorithm is scan algorithm

Akshay Balhara - 3 years ago

Can you please provide more info about option A and B?

Chandra Shekhar Brijwasi - 4 years ago

Nearest Cylinder next

SAHEED MOHAMMED P - 5 years ago

I think Nearest cylinder next (also known as Shortest Seek Time First) is the optimal algorithm

Tsega Asresa Mengistu
Tsega Asresa Mengistu - 1 week ago

Tsega Asresa Mengistu from Dessie, Ethiopia is saying FCFS is correct answer

Related Questions

A major security problem for operating system is

  • [A] Authentication problem
  • [B] Physical problem
  • [C] Human problem
  • [D] None

The mechanism that bring a page into memory only when it is needed is called _____________

  • [A] Sagmentation
  • [B] Fragmentation
  • [C] Demand Paging
  • [D] Page and Replacement

The number of processes completed per unit time is known as.... ?

  • [A] Output
  • [B] Throughput
  • [C] Efficiency
  • [D] Capacity

What is the memory from 1K - 640K called ?

  • [A] Extended Memory
  • [B] Normal Memory
  • [C] Low Memory
  • [D] Conventional Memory

A system program which helps the execution of user programs is known as---

  • [A] system software
  • [B] operating system
  • [C] application program