0
Why is dijkstra's algorithm not suitable for distributed applications with large number of distributed nodes?
Wiki User
∙ 14y ago
"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."
Wiki User
∙ 14y ago
Add your answer:
Earn +20 pts
What is the adverb for suitable?
The adverb is suitably (in a suitable manner).
What solid figure rolls and slides?
A cylinder is a solid figure that can both roll and slide. Its shape and symmetry allows it to roll smoothly along a surface, and its circular base provides stability for sliding. Both of these properties make it suitable for applications such as wheels and rollers.
What is suitable adjective for the word punctuality?
Punctual
What is the approximate of each irrational?
Every irrational number can be represented by a non-terminating non-repeating decimal. Rounding this decimal representation to a suitable degree will provide a suitable approximation.
Is suitable a compound word?
No. -able is a suffix, not a separate word.
What is the spiral model suitable for?
The spiral model thus may suit small (up to $3 million) software applications and not a complicated ($3 billion) distributed, interoperable, system of systems.
Which algorithm was the first to be found suitable for both digital signing and encryption?
RSA
Is the round robin CPU scheduling algorithm suitable for time sharing OS?
Yes, it is one of many scheduling algorithms suitable for time sharing.However it is not suitable for scheduling in a hard realtime OS that must consistently meet deadlines.
What is the difference between implementation and algorithm?
An algorithm is a instruction for solving a problem. It is typically illustrated using prose, pseudo code or flowcharts, but other methods exist. The algorithm is the "here's how it's going to work" part of the solution. An implementation (of an algorithm) is a specific expression of this algorithm, using a specific programming language or any other suitable means. The implementation is the "here's how I've done it" part of the solution.
Why are planes not made from copper alone?
It is too expensive, too heavy and not a suitable material for most applications.
Why isn't polypropylene manufactured instead of other polymers since it has no recognized health hazards?
Different polymers have different physical and chemical properties. This makes some polymers more suitable for particular applications than others. As a result, no one polymer is suitable for all applications.
What companies can one purchase visualization applications from?
There are many visualization applications which one may find suitable. AGI, and Visual.ly each offer visualization apps. There are many to choose from on on each site.
Why is Gold Mined?
For its monetary value making it suitable for bullion (currency references), jewellery and gilding, its chemically-inert nature and high conductivity make it suitable for various applications in electronic and medical components.
Why magnetic media is suitable for multimedia applicatiion?
Magnetic media like a hard disk drives are fairly fast so it is suitable for multimedia applications. Optical media like DVDs and CDs are much slower.
List at least four different applications that are naturally suitable for P2P architectures?
* Streaming Video, where multiple users are attempting to view the video simultaneously in real time * Broadcast Applications * File Sharing applications (BitTorrent) * Applications where the function that is to be performed can be broken up into different sub-tasks * Instant messaging, VoIp etc
What are the advantages of power transformers over voltage transformers?
Power transformers can be used for power transformation. Voltage transformers are not suitable for high power applications.
What are the main characteristics of algorithm explain with suitable example?
1. Finiteness : An algorithm must terminate after a finite number of steps and further each steps must be executable in finite amount of time. 2. Each step of an algorithm must be precisely defined; the action to be carried out must be rigorously and unambiguously specified for each case. 3. Input: An algorithm has zero or more, but only finite number of inputs. zero input example: ASCII chart of 0-255 4. Output: An algorithm has one or more output. 5. Effectiveness: Should be effective that means each of the operation to be performed in an algorithm must be sufficiently basic that it can, in principle, be done exactly and in a finite length of time, by a person using pencil and paper and should be computer programming language independent
