ºÝºÝߣ

ºÝºÝߣShare a Scribd company logo
Chapter Name:
Introduction To Algorithm
Topic 1.1 :
What Is An Algorithm?
Project Prepared By:
KM Bappi
CSE 2006-2007
Q: What Is An Algorithm? What are the criteria an algorithm must
satisfy or describe the characteristics of an algorithm.
Answers :
An Algorithm is a process or set of rules to be followed in calculations or other problem-solving operations, especially by a computer.
In mathematics and computer science, an algorithm is a step-by-step procedure for calculations. Algorithms are used or calculation, data processing,
and automated reasoning.
An algorithm is an effective method expressed as a finite list of well-defined instructions for calculating a function. Starting from an initial
state and initial input the instructions describe a computation that, when executed, proceeds through a finite number of well-defined successive states,
eventually producing "output" and terminating at a final ending state.
 Criteria:
i. Input:
Zero or more quantities or quire should be inputted externally.
ii. Output:
At least one quantities should be produced.
iii. Definiteness:
Each instruction is clear and definite.
iv. Finiteness:
For n terms of cases the algorithm should terminate it’s process after n terms.
v. Effectiveness:
Must be very basic and feasible.

More Related Content

Introduction To Algorithms

  • 1. Chapter Name: Introduction To Algorithm Topic 1.1 : What Is An Algorithm? Project Prepared By: KM Bappi CSE 2006-2007
  • 2. Q: What Is An Algorithm? What are the criteria an algorithm must satisfy or describe the characteristics of an algorithm. Answers : An Algorithm is a process or set of rules to be followed in calculations or other problem-solving operations, especially by a computer. In mathematics and computer science, an algorithm is a step-by-step procedure for calculations. Algorithms are used or calculation, data processing, and automated reasoning. An algorithm is an effective method expressed as a finite list of well-defined instructions for calculating a function. Starting from an initial state and initial input the instructions describe a computation that, when executed, proceeds through a finite number of well-defined successive states, eventually producing "output" and terminating at a final ending state.  Criteria: i. Input: Zero or more quantities or quire should be inputted externally. ii. Output: At least one quantities should be produced. iii. Definiteness: Each instruction is clear and definite. iv. Finiteness: For n terms of cases the algorithm should terminate it’s process after n terms. v. Effectiveness: Must be very basic and feasible.