ALGORITHM

&
IT’S
CHARACTERISTICS
 OUTLINE

• Introduction
• ALGORITHM
• Real life examples
• Algorithm examples
• Characteristics part(I)
• Characteristics part(II)
• Conclusion
 INTRODUCTION

Algorithms are a critical part of

computer science and technology.
They are step-by-step procedures for
solving problems and performing
tasks, and they are essential in a
wide range of applications, from
search engines to self-driving cars.
 ALGORITHM ?

An algorithm is a finite sequence of instructions that are

used to solve a problem or perform a task. These
instructions can be in the form of computer programs,
mathematical formulas, or any other method of problem-
solving. An algorithm must have a well-defined input, a set
of instructions, and an output that meets the requirements
of the problem.
REAL LIFE EXAMPLES

Directions : to some place.

Cooking : Recipe for preparing a dish.
Origami : The art of folding.
Example
1.To find product of two integers

Step 1 − Start
Step 2 − declare three integers x, y & z
Step 3 − define values of x & y
Step 4 − multiply values of x & y
Step 5 − store result of step 4 to z
Step 6 − print z
Step 7 − Stop
2.Find factorial of a number
CHARACTERISTICS

1.Well-defined: An algorithm must have a well-defined set of inputs and

outputs, and the steps to get from the inputs to the outputs must also be
well-defined. This means that the algorithm must be clear and precise in
its instructions and actions.

2.Correctness: An algorithm must be correct and produce the correct

output for all valid inputs. It should also handle any invalid inputs in a
meaningful way, such as producing an error message.
3.Finiteness: An algorithm must terminate in a finite amount of
time. This means that it should not enter into an infinite loop or
never terminate.

4.Generalization: An algorithm should be general enough to be

applied to a wide range of inputs, not just specific cases.

5.Modularity: An algorithm should be modular, meaning that it

should be broken down into smaller, more manageable pieces that
can be tested and debugged independently.
7. Efficiency: An algorithm should be efficient in terms of time and
memory usage. This means that it should be designed to minimize
the number of steps required to complete the task and use the least
amount of memory possible.
 CONCLUSION
Algorithms are the backbone of modern computing, providing a
systematic approach to solving problems and performing tasks.
They are characterized by several key features, including well-
defined inputs and outputs, correctness, efficiency, finiteness,
generalization, and modularity. Understanding these
characteristics is crucial for designing effective algorithms that
can improve the performance of various applications.
THANKING YOU