Best Answer

The first step is to convert the logical device number into a physical address. Then you must schedule an IO request. You improve the seek time by testing the IO numbers to see what gives the best results.

Q: How do you calculate shortest seek time first algorithm Average?

Write your answer...

Submit

Still have questions?

Continue Learning about Math & Arithmetic

"OSPF detects changes in the topology, such as link failures, very quickly and converges on a new loop-free routing structure within seconds. It computes the shortest path tree for each route using a method based on Dijkstra's algorithm, a shortest path first algorithm."

printf ("%g\n", (n+1.0)/2);

1.Start Algorithm 2.Enter first number 3.Enter second number 4.Enter third number 5.Enter fourth number 6.Enter fifth number 7.Add five number 8.display five number / 2 9.Display result 10.End Algorithm

Calculating an average is done in two steps: - First: you calculate the sum of the terms whose average you would like to calculate. - Second: you divide the sum of the terms by their number. In your case: - First: 10 + 6 + 12 = 28 - Second: 28 / 3 = 9.33333.... 3 is the number of terms added together which are: 10, 6 and 12 (3 numbers). Answer: Therefore your average is: 9.33333....

Day 1 is the first day of bleeding. Last day is the day prior to the start of next period. Average cycle is 28 days with an average bleeding duration of 3-5 days.

Related questions

what is the diffrnce

Dijkstra's algorithm is used by the OSPF and the IS-IS routing protocols. The last three letters in OSPF (SPF) mean "shortest path first", which is an alternative name for Dijkstra's algorithm.

its the algorithm that tells the os what to process next.goes according to :shortest job firstshortest remaining time firstround robin- first in first out system

OSPF stands for open shortest path first. OSPF is an exterior routing protocol. OSPF uses Path vector routing algorithm.

"OSPF detects changes in the topology, such as link failures, very quickly and converges on a new loop-free routing structure within seconds. It computes the shortest path tree for each route using a method based on Dijkstra's algorithm, a shortest path first algorithm."

Priority scheduling is a CPU scheduling algorithm where each process has a priority associated with it. Shortest job first (SJF) is a scheduling algorithm where the process with the shortest burst time is scheduled first. The relationship between the two is that a priority scheduling algorithm can be used where the priority of a process is determined by its burst time, effectively making it similar to a shortest job first algorithm.

Average wait Time of processes is minimized

Shortest Job First (SJF) scheduling algorithm selects the process with the smallest burst time for execution next, which helps in reducing average waiting time. Shortest Remaining Time First (SRTF), on the other hand, preempts the currently running process if a new process with a smaller burst time arrives, resulting in even lower waiting times but with increased context switching.

A "first fit" algorithm is any algorithm which doesn't care about how "good" a solution is, it just returns the first one that works.

Most universities calculate the average of the first and second cumulative average at the end of every academic year.

Link-state routing algorithms, also known as shortest path first (SPF) algorithms.

Routers that run a link-state protocol can establish a complete topology of the network. The shortest path first algorithm is used.