Scribd
Upload
4 views

Daa Study Notes

Uploaded by

hdshb786
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
4 views

Daa Study Notes

Uploaded by

hdshb786
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/ 1

1.1 WHAT IS AN ALGORITHM?

The word algorithm comes from the name of a Persian author, Abu Ja'far
Mohammed ibn Musa al Khowarizmi (c. 825 A.D.), who wrote a textbook on
mathematics.
An algorithm is a finite set of instructions that, if followed, accomplishes a
particular task. In addition, all algorithms must satisfy the following criteria:

1. Input. Zero or more quantities are externally supplied.


2. Output. At least one quantity is produced.
3. Definiteness. Each instruction is clear and unambiguous.
4. Finiteness. If we trace out the instructions of an algorithm, then for
all cases, the algorithm terminates after a finite number of steps.
5. Effectiveness. Every instruction must be very basic so that it can be
carried out, in principle, by a person using only pencil and paper. It
is not enough that each operation be definite as in criterion 3; it also must be
feasible.
The study of algorithms includes many important and active areas of
research. There are four distinct areas of study one can identify:
l. How to devise algorithms Creating an algorithm is an art which may
never be fully automated. A major goal is to study various design
techniques that have proven to be useful in that they have often yielded good
algorithm.
2. How to validate algorithms - Once an algorithm is devised, it is necessary to
show that it computes the correct answer for all possible legal inputs. We refer to
this process as algorithm validation.Once the validity of the method has been
shown, a program can be written and a second phase begins. This phase is referred to
as program proving or sometimes as program verification.
3. How to analyze algorithms -- This field of study is called analysis of
algorithms.Analysis of algorithms or performance analysis refers to the task of
determining how much computing time and storage an algorithm requires.
4. How to test a program - Testing a program consists of two phases:
debugging and profiling (or performance measurement).
PRIORY AND POSTERIOR
Priory is independent of hardware posterior is dependent on hardware
Gives approximat gives exact value
Uniform ununiform

You might also like