0
Add your answer:
Earn +20 pts
Why is dijkstra's algorithm not suitable for distributed applications with large number of distributed nodes?
"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."
What is the program to calculate the average of first 'n' natural numbers?
printf ("%g\n", (n+1.0)/2);
How to write an algorithm that accepts five numbers and displays the sum and average of the numbers?
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
What is average of 10 6 12?
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....
How do you calculate menstral cycle?
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.
What relation holds between priority and shortest job first algorithm?
what is the diffrnce
What is Dijkstra's algorithm?
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.
What do you mean by scheduling algorithm in OS?
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
What does the Cisco IOS use to calculate the OSPF cost to a destination network?
OSPF stands for open shortest path first. OSPF is an exterior routing protocol. OSPF uses Path vector routing algorithm.
Why is dijkstra's algorithm not suitable for distributed applications with large number of distributed nodes?
"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."
What relation between priority and shortest job first?
In that work system, the shortest job gets higher priority because more gets accomplished in any amount of time. If you have two hours to do 4 tasks and one task will take five minutes, one will take 30 minutes, one will take an hour and one will take an hour and a half, by using the shortest job first method, you will accomplish three tasks in those two hours and part of the fourth task. If you do the longest job first, you will accomplish the task that takes an hour and a half, then only part of the one hour task, but nothing on the 5 minute or 30 minute tasks. That means that by doing the shortest jobs first, you will accomplish three times as many tasks as you will by doing the longest jobs first.
What are the advantages of shortest job run first?
Average wait Time of processes is minimized
What is difference between SJF and SRTF?
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.
Explain first fit algorithm?
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.
How do universities calculate the comulative average of a student?
Most universities calculate the average of the first and second cumulative average at the end of every academic year.
What two names refer to the same algorithm used by all link-state routing protocols?
Link-state routing algorithms, also known as shortest path first (SPF) algorithms.
What are the two most commonly encountered link-state routing protocols in ip network?
Routers that run a link-state protocol can establish a complete topology of the network. The shortest path first algorithm is used.
