0
Who one of the following algorithm is used in finding shortest distance in a graphs -a) dynamic programming b)greedy method c)backtracking d)divide and conquer?
Wiki User
∙ 7y agoWant this question answered?
Be notified when an answer is posted
Add your answer:
Earn +20 pts
How does the Greedy Algorithm work?
There is not "a" greedy algorithm; "greedy algorithm" is a term to describe several algorithms that have some things in common. The general idea is that at each step, you look for what seems to be, "locally", the best solution. For example, in a shortest-distance problem, look for a step that takes you closer to the destination. This may, or may not, lead to the best solution overall.
Which of the following do you calculate when you divide the total distance traveled by the total traveled time?
Speed = Distance/Time
What is a horizontal distance?
The horizontal distance is the straight-line distance between two points on a map without including any extra distance because of following the upward and downward slopes of hills and valleys.
Which following of transformation does not preserve distance and angle measure?
The question asks about the "following". In those circumstances would it be too much to expect that you make sure that there is something that is following?
What is the distance between the following points. (1 -2) and (1 -5)?
Points: (1, -2) and (1, -5) Distance: 3 units by using the distance formula
Distance Vector protocols use what algorithm?
Distance Vector protocols use the Bellmanâ??Ford algorithm. The ARPANET system relied on Distance Vector protocols as their main routing technique in the early 80s.
How does the bellman ford algorithm work?
This distance-vector algorithm works by computing the shortest path , and considers weights. The algorithm was distributed widely in the RIP protocol.
What is the drawback of distance vector algorithm?
The distance vector algorithm does not take into account current traffic, type of link, speed of link, type of endpoint routers, etc. It cannot adjust for changes in network traffic and bottlenecks.
What is following distance?
What is following distance? Following distance is the space between your vehicle and the vehicle in front of you while driving. It's important for all drivers to maintain a safe following distance, so that they have time to safely stop in case the vehicle in front of them brakes abruptly.
Is computer programming useful in learning the distance formula in Algebra 1?
Computer programming is somewhat useful in learning the distance formula in Algebra 1. Learning the distance formula has more to do with your ability at mathmetics and you want to learn.
Is a treadmill computerized machine?
In a sense, it is since your tracking and jogging distance is calculated by an algorithm programmed into it.
What is the minimum seconds of following distance?
When following large trucks, maintain at least a minimum of a ______ second following distance.
Algorithm of a programme of bubble sort?
The algorithm for bubble sort, also know as pair exchange...Set a swap flag falseLoop for the first N-1 elementsCompare each element with the following elementIf the two elements are in the correct order, continue to next loop iterationOtherwise, swap the two elements and set the swap flag trueAt loop end, if the swap flag is true, repeat starting at step 1Otherwise, sort completedBubble sort is so named because out of order elements "bubble" to the end of the array, moving one step per inner loop iteration.As stated above, the algorithm is slow because it takes a while for a significantly out of order element to reach its final point when it needs to come closer to the beginning of the array. It can be improved by introducing a "distance" parameter, initially set to one half of the array size, and using that distance in step 3 to choose the second element. After the algorithm is completed for that distance, the distance is halved, and we iterate the entire algorithm until the distance is only one. (This variation is more formally known as merge exchange, but it still retains the "bubble" characteristic.)
You can maintain a proper following distance by?
The technique used for determining the proper following distance is the "3- second" rule.
Which of the following is not a climate control latitude altitude distance from oceans distance from mountains?
distance from mountains
Bharathiar university distance education question papers?
computing fundamentals and c programming
When driving you should always measure your following distance in?
Car lengths
