0% found this document useful (0 votes)
1 views2 pages

Algorithm

An algorithm is a finite, ordered procedure for solving a problem, consisting of a set of instructions that transform input into output. Key characteristics of an algorithm include having inputs, producing outputs, terminating after a finite number of steps, being clearly defined, and being easy to execute. An example algorithm for summing two numbers illustrates these properties through its defined steps.

Uploaded by

Rajasomeshwar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
1 views2 pages

Algorithm

An algorithm is a finite, ordered procedure for solving a problem, consisting of a set of instructions that transform input into output. Key characteristics of an algorithm include having inputs, producing outputs, terminating after a finite number of steps, being clearly defined, and being easy to execute. An example algorithm for summing two numbers illustrates these properties through its defined steps.

Uploaded by

Rajasomeshwar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

Algorithm:

An algorithm is a finite, ordered step by step procedure to solve a particular


problem.

An algorithm consists a set of instructions to solve the problems.

It is a sequence of steps that transform the input into a valuable or required output.

Properties of an algorithm:

Algorithm must have the following characteristics.


Input:-An algorithm should have zero or one or more inputs.

Output:-An algorithm must have at least one output.

Finiteness: An algorithm must terminate after finite number of steps.

Definiteness: Each step of the algorithm must be clearly defined (unambiguous.).

Effectiveness: Each step must be simple, clear and easy to carry out with pen and
Paper.

Example:

Write an Algorithm to find the sum of two numbers.

Step1: Start

Step2: Read two numbers a,b

Step3: s= a+b

Step4: Display s

Step5: Stop

In the above algorithm

Input – a,b

Output – s

Finiteness – Completed in finite amount of time ( 5 steps)

Definiteness – each step is clearly defined (unambiguous.)

Effectiveness: Each step must be simple, clear and easy to carry out with pen
and paper.

You might also like