JNTUH B.TECH CSE 3-1 DESIGN AND ANALYSIS OF ALGORITHMS SYLLABUS

JNTU CSE STUDY MATERIAL
JNTUH B.TECH R16 CSE 3-1 Design and Analysis of Algorithms

The word algorithm comes from the name of a Persian author, Abu Ja'far Muhammad Musa al Khowarizmi (c.825A.D)
Algorithm Definition: An algorithm is a finite set of instructions that, if followed, accomplish as 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 the instructions of an algorithm, then for all cases, the algorithm ends after a number of steps.
5.Effectiveness:.Every instruction must be very basic so it can be carried out, in principle, by a person using only pencil and paper.It is not enough that each operation be definite, it must be possible.

An algorithm is comprises of a finite set of steps, each of which may require one or more operations. Thee possibility of a computer carrying these operations necessitates that certain constraints be placed on the type of operations an algorithm can include.
In formal computer science, we distinguish an algorithm and a program. A program does not necessarily meet the fourth condition. An important example of such a program for a computer is its operating system, which never ends (with the exception of system crashes) but continues in a waiting loop until more jobs are entered.
We constitute an set of rules the usage of a pseudo-language that may be a aggregate of the structures of a programming language with casual English declarations.