Algorithm :
Program = Algorithm + DataDef : Algorithm is a finite set of instructions that, it followed accomplishes a particular task.
Algorithm should satisfy the following criteria.
- Input : Zero or more quantities are externally supplied.
- Output : At least one quantity is produced.
- Definiteness : Each instruction is clear and unambiguous. Ex Add B or C to A.
- Finiteness : Algorithm should terminate after finite number of steps when traced in all cases
Ex: Go on adding elements to an array - Effectivenes :Every instruction must be basic i.e., it can be carried out, by a person using pencil and paper.
Algorithm must also be general to deal with any situation.
Example : Calculate Fibonacci Series.
There are two forms of representing an activity. They are
- By describing the process step - by - step - Algorithm
- By representing the various steps in the form of a diagram - flowchart.
Algorithm with Examples :
The same problem can be solved with different methods. So, to solve a problem different algorithm, may be accomplished. Algorithm may vary in time, space utilized. User writes algorithm in his/her own languages.So, it can not be executed on computer. Algorithm should be in sufficient detail that it can be easily translated in to any of the languages.
Examples - 1 : Algorithm for adding two numbers.
- Step - 1 : Start
- Step - 2 : Read 2 numbers as A and B
- Step - 3 : Add ;numbers A and B and Store result in C
- Step - 4 : Display C
- Step - 5 : Stop
- Step - 1 : Start
- Step - 2 : Read the numbers a, b, c
- Step - 3 : Compute the sum and divide by 3
- Step - 4 : store the result in variable d
- Step - 5 : Print value of d
- Step - 6 : Stop
- Step - 1 : Start
- Step - 2 : Read the numbers n
- Step - 3 : Initialize i to zero
- Step - 4 : Initialize sum to zero
- Step - 5 : If i is greater than n
- Step - 6 : Read a
- Step - 7 : Add a to sum
- Step - 8 : Go to step - 5
- Step - 9 : Divide sum by n & store the result in avg
- Step - 10 : Print value of avg
- Step - 11 : Stop
0 Comments