answersLogoWhite

0


Best Answer

To solve problems in math and science. An algorithm is simply a method to solve a specific problem.

User Avatar

Wiki User

โˆ™ 2010-06-12 15:02:12
This answer is:
๐Ÿ™
0
๐Ÿคจ
0
๐Ÿ˜ฎ
0
User Avatar
Study guides
๐Ÿ““
See all Study Guides
โœ๏ธ
Create a Study Guide

Add your answer:

Earn +20 pts
Q: What are the uses of algorithm?
Write your answer...
Submit
Related questions

What type of CPU Scheduling algorithm is used in Windows Unix Linux?

Windows uses the multilevel feedback queue scheduling algorithm. Linux uses completely fair scheduler algorithm. Unix uses round robin scheduling algorithm.


Uses of algorithm?

An algorithm is a set of code that is used to solve a problem.


What is prim algorithm?

Prim's algorithm is a 'graph algorithm' which uses a 'greedy approach' to find the minimum spanning tree of a graph.


What authentication also uses the DES algorithm?

Message


What CPU scheduling algorithm is used by Windows XP?

Windows XP uses a quantum-based, preemptive priority scheduling algorithm


What is an Algorhithm?

An algorithm is a set of rules which a computer uses to excecute a task


What are the uses of flow chart in computer?

flow chart is pictorial representation of algorithm


What type of memory module uses an algorithm to verify data accuracy?

VCM


Make a comparison between Bresenham and DDA line drawing algorithms?

Difference Between DDA and Bresenham Algorithm• DDA uses floating points where as Bresenham algorithm use fixed points.• DDA round off the coordinates to nearest integer but Bresenham algorithm does not.• Bresenham algorithm is much accurate and efficient than DDA.• Bresenham algorithm can draw circles and curves with much more accuracy than DDA.• DDA uses multiplication and division of equation but Bresenham algorithm uses subtraction and addition only.


What is are advatages and disadvatages of bresenham's line algorithm?

The main advantage of Bresenham's algorithm is speed. It uses only integer addition/subtraction and bit shifting. The disadvantage of such a simple algorithm is that it is meant for basic line drawing. The "advanced" topic of antialiasing isn't part of Bresenham's algorithm, so to draw smooth lines, you'd want to look into a different algorithm.


What are the advantages of bresenhams's line drawing algorithm over the cartesian slope ana ddadigitial defrantial analyser?

First off, DDA uses float numbers and operators. While Bresenham's line drawing algorithm uses ints and only additions and subtraction.


What is the sequential step by step process which a computer uses to perform computations?

Algorithm


Why do you have a monitor and what are the uses?

A monitor is the "gateway" to your computer. It is the output of your computer. E.g. a mathematical formula has an input, an output and an algorithm. The keyboard & mouse is the input, the computer is the algorithm, and the monitor is the output.


What are the difference between DES and RSA algorithm?

DES is a symmetric cryptographic algorithm, while RSA is an asymmetric (or public key) cryptographic algorithm. Encryption and decryption is done with a single key in DES, while you use separate keys (public and private keys) in RSA. DES uses 56-bit keys for encryption while RSA uses 2600-bits of KEY


Who uses an algorithm?

guante el amigos yi soy ambicioso de mal un paciente!


What does algorithm design mean?

Algorithm design is a method to create a way to solve mathematical problems. Internet retrieval processes of web crawling, caching and packet routing are some of the current uses today.


What CPU Scheduling algorithm is used by Windows 8?

Windows 8 uses the multilevel feedback queue scheduling algorithm. Multilevel queue scheduling divides processes into groups. This is useful for shared memory.


How are the expanded algorithm and the standard algorithm different?

They are different because standard algorithm is more common then the expanded algorithm


Do JPEG images lose minor image details?

Generally yes, the JPEG algorithm uses a lossy compression, so minor image details are lost. For more details about the JPEG algorithm visit the related link.


What is the criteria for algorithm?

What is the criteria for algorithm?


What are the criteria for algorithm?

what is the criteria for algorithm


Which algorithm is more efficient lamport bakery algorithm or black and white bakery algorithm?

Black and White bakery algorithm is more efficient.


What is sub-algorithm?

It is an algorithm used by another algorithm as part of the second algorithm's operation.As an example, an algorithm for finding the median value in a list of numbers might include sorting the numbers as a sub-algorithm: There are plenty of algorithms for sorting, and the specifics of the sorting does not matter to the "median value" algorithm, only that the numbers are sorted when the sub-algorithm is done.For what an algorithm is, see related link.


What is the advantage of bresenham algorithm over dda algorithm?

DDA uses float numbers and uses operators such as division and multiplication in its calculation. Bresgenham's algorithm uses ints and only uses addition and subtraction. Due to the use of only addition subtraction and bit shifting (multiplication and division use more resources and processor power) bresenhams algorithm is faster than DDA in producing the line. Im not sure, though if i remember right, they still produce the same line in the end. One note concerning efficiency: Fixed point DDA algorithms are generally superior to Bresenhams algorithm on modern computers. The reason is that Bresenhams algorithm uses a conditional branch in the loop, and this results in frequent branch mispredictions in the CPU. Fixed point DDA also has fewer instructions in the loop body (one bit shift, one increment and one addition to be exact. In addition to the loop instructions and the actual plotting). As CPU pipelines become deeper, mispredictions penalties will become more severe. Since DDA uses rounding off of the pixel position obtained by multiplication or division, causes an accumulation of error in the proceeding pixels whereas in Bresenhams line algorithm the new pixel is calculated with a small unit change in one direction and checking of nearest pixel with the decision variable satisfying the line equation.


What graph traversal algorithm uses a queue to keep track of vertices which need to be processed?

Breadth-first search