Skip to main content

Features of Algorithms

An algorithm has the following features:

1 ) Input: An algorithm is supplied with information. This information is called input. Addition operation can be performed with two numbers. An algorithm performing addition is given two numbers as input.  Input transformation is the job of algorithm design. The addition algorithm transforms the two input numbers into 'sum'.


2 ) Output: The result(s) of an algorithm is called output.  Output is produced by an algorithm. The addition of two numbers gives a result. This result is the output of the addition algorithm. Similarly, the quotient is the output given by the division algorithm.


3 ) Definiteness: Each step of an algorithm is very clear. There is no scope for confusion. In the addition algorithm the step dedicated to accept a number definitely ensures input of a number. This step cannot dedicate itself to accept an alphabet. Number means only number and not an alphabet. If an alphabet is accepted as input for addition, it is confusing for a Computer. We know that an alphabet cannot be considered for addition. If an alphabet is considered, the output cannot be correct. Definiteness ensures the correctness of output. 

4 ) Finiteness: An Algorithm has a finite number of steps. It means an algorithm has an end. An algorithm ( solution) that does not end is not a problem solver and hence not an algorithm. In fact, it is a problem. But we know that a solution is an algorithm. The finiteness feature has resulted in the development of excellent solutions using algorithms.

5 ) Effectiveness: Each step of an algorithm produces effect. An algorithm has a series of steps. So, we may say that an algorithm produces a series of effects. 

The effect of each step can be felt. To realize the feeling, we trace each step using pencil and paper. 

For example, when output is given by an algorithm, the transformation of inputs is the effect produced.


Labels:

Comments

Post a Comment

Popular posts from this blog

Local-Area Networks

Local-Area Networks ( LANs ) are restricted to a small area. Such Networks may be established within a building. Computers that are part of Local-Area Networks are Personal Computers ( PCs ) or microcomputers. These Computers are connected to each other. Simple communication lines connect these Pers Networks bring people together. When people join  hands teamwork becomes possible. The structural composition of LANs simplifies teamwork. In other words, LAN hardware supports teams having similar processing requirements. LAN Computers readily support personalization of tasks allocated to professionals.  Office staff can work together and share information. This improves the efficiency of the entire workforce. It has been noted that here all the Networked Computers are Personal Computers. They are of equal capacity. Mostly LAN users have similar tasks. If situations allow, a user is independent to access any Computer to serve his purpose. LAN users can exercise the option of secu...
Post a Comment
Read more

Computers - An Introduction

Computers are man made machines. They are made to work very fast. Working fast they can solve  big and small problems.  Modern science has given us these computers. They are very popular. Computers affect and change lives. They keep us happy.The happiness grows. Computers are quick and smart. Great problem solvers and simplifiers are our computers. They can do our work without stopping. Focus is on doing only what is needed. Not needed, not done.  Computers are  life-less servants. They cannot think or make decisions on their own. They are empowered to work. They are given each and every thing so that they carry out our orders. Orders are respected by computers. The manner in which computers work is wholly dependent on man.  The quality of service provided by computers is remarkable. They are loved by human beings. Computers are known for smart and quick service. Computers do not give wrong results. Correct answers are always given. Questions which are difficult...
Post a Comment
Read more

Euclid's Algorithm

The Greatest Common Divisor ( GCD ) of  two numbers is a number. The number ( GCD ) causes division of the two numbers. This number ( GCD ) is the greatest number that is possible. This divisor partially forms the two numbers. Adding  the divisor successively may result in formation of the two numbers. One can note that when the divisor is the greatest, the division of the dividend is the sharpest. The division operation is very effective. When the Greatest Common Divisor of two numbers is considered, we think of a number that can cause division of both the numbers. Here the two numbers are unequal. The Greatest Common Divisor causes divisions of the two numbers differently. This is clear from the two different quotient values.  The GCD value is very interesting to note. It relates very well with the two numbers. The GCD of two even numbers is also an even number. The GCD of two odd numbers is an odd number. So, we can say that GCD is an abstraction of the two numbers in ...
1 comment
Read more