FCFS (Disk Scheduling Disk Scheduling): Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
(Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$ auxiliary words (Needs to keep track of seek distance but FCFS is fairly straightforward/no extra info needed) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1979 == Reference == -")
 
No edit summary
 
Line 5: Line 5:
== Space Complexity ==  
== Space Complexity ==  


$O({1})$ auxiliary words
$O({1})$ words


(Needs to keep track of seek distance but FCFS is fairly straightforward/no extra info needed)
(Needs to keep track of seek distance but FCFS is fairly straightforward/no extra info needed)

Latest revision as of 08:44, 10 April 2023

Time Complexity

$O(n)$

Space Complexity

$O({1})$ words

(Needs to keep track of seek distance but FCFS is fairly straightforward/no extra info needed)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1979

Reference

-