ALGORITHM
An algorithm is a step-by-step set of instructions, or a set of rules designed to perform a specific task or solve a particular problem.
- An algorithm is a sequence of computational steps that transform the input into a valuable or required output.
- Algorithms are precise sequences of operations or procedures that can be followed to achieve a desired result.
- They provide a systematic way to solve problems, perform computations, or accomplish tasks in various fields.
v Properties
of Algorithm
1. Finiteness :
Algorithms must be finite, meaning they have a defined number of steps. They
should eventually halt and produce a result.
Algorithm must have a defined and limited number of steps or operations. A finite algorithm should eventually reach a conclusion or produce a result after executing a finite sequence of instructions one.
2. Effectiveness
: Algorithms should be effective, meaning they solve the problem or accomplish
the task for which they were designed. An effective algorithm achieves the
desired outcome within a reasonable amount of time and resources.
3. Input :
Algorithms take input, which is the data or information the algorithm
processes.
4. Output : Algorithms displays the output of
the successful taken input and successfully performing operations on input.
Output in algorithm gives the initial idea of expected output.
5. Unambiguous: Each
step of the algorithm must be clearly defined and unambiguous, leaving no room
for interpretation. Algorithm should be precise and explicitly stated. This
clarity helps in preventing misunderstandings or errors during the
implementation of the algorithm.
6. Proper Sequential : A proper sequential algorithm consists of a series of well-defined steps
or instructions arranged in a specific order to solve a particular problem or
perform a task. The sequential nature of the algorithm implies that each
step is executed one after the other, in the order specified
Name – Snehal Bhushan
Paranjape
Roll no. – 01
No comments:
Post a Comment