Question

Define algorithm? explain its characteristics

Answer 1

 an algorithm is a sequence of finite instructions, often used for calculation and data processing. It is formally a type of effective method in which a list of well-defined instructions for completing a task will, when given an initial state, proceed through a well-defined series of successive states, eventually terminating in an end-state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as probabilistic algorithms, incorporate randomness.
A step-by-step method of solving a problem or making decisions, as in making a diagnosis.
An established mechanical procedure for solving certain mathematical problems.
Properties of the algorithm

 Finiteness. An algorithm must always terminate after a finite number of steps.Definiteness. Each step of an algorithm must be precisely defined; the actions to be carried out must be rigorously and unambiguously specified for each case.Input. An algorithm has zero or more inputs, i.e, quantities which are given to it initially before the algorithm begins.Output. An algorithm has one or more outputs i.e, quantities which have a specified relation to the inputs.Effectiveness. An algorithm is also generally expected to be effective. This means that all of the operations to be performed in the algorithm must be sufficiently basic that they can in principle be done exactly and in a finite length of time.

Answer 2

Answer:

algorithm is a step proceduce to solve the problem.

characteristics:

input:algorithm must acept one or more data to be processed.

definite:each operational steps must clearly specify that what should be done.

effective:the opperations must be simple and carried out in finite time.

output:the algorithm must produce one or more computed results caller outputs.