Scribd
Upload
3 views

Module 1 DAA

The document introduces algorithms, defining them as well-defined computational procedures that transform input into output. It emphasizes the importance of designing algorithms to minimize costs and analyzing their performance in terms of resources. Key characteristics of algorithms include finiteness, definiteness, correctness, output, input, and effectiveness.

Uploaded by

sdabbara
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
3 views

Module 1 DAA

The document introduces algorithms, defining them as well-defined computational procedures that transform input into output. It emphasizes the importance of designing algorithms to minimize costs and analyzing their performance in terms of resources. Key characteristics of algorithms include finiteness, definiteness, correctness, output, input, and effectiveness.

Uploaded by

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

INTRODUCTION TO

ALGORITHMS
INTRODUCTION
• The word algorithm comes from the name of a Persian mathematician Abu Ja’far
Mohammed ibn-i Musa al Khowarizmi.

• In computer science, this word refers to a special method useable by a computer


for solution of a problem. The statement of the problem specifies in general terms
the desired input/output relationship.

• For example, sorting a given sequence of numbers into nondecreasing order


provides fertile ground for introducing many standard design techniques and
analysis tools.
Algorithms

• Informally, an algorithm is any well-defined computational procedure that


takes some value, or set of values, as input and produces some value, or
set of values, as output.

• An algorithm is thus a sequence of computational steps that transform the


input into the output.
INTRODUCTION TO DESIGN & ANALYSIS OF
ALGORITHMS

Design: design algorithms which minimize the cost.

Analysis: predict the cost of an algorithm in terms of resources and performance.

Algorithm: is a finite sequence of unambiguous instructions for solving a problem


i.e., for obtaining a required output for any legitimate input in a finite amount of
time.
CHARACTERISTICS
1 2
1. Finiteness Algorithm is a finite sequence of unambiguous instructions for
3 4
solving a problem i.e., for obtaining a required output for any
2. Definiteness 5 6
legitimate input in a finite amount of time.

3. Correctness

4. Output

5. Input

6. Effectiveness
FUNDAMENTALS OF ALGORITHM &
PROBLEM SOLVING

You might also like