Basics of Algorithm
Definition
“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.”
Thus an algorithm is a sequence of computational steps that transform the input
into the output.
We
can also view an algorithm as a tool for solving a well-defined computational
problem.
Roughly
Speaking;
- A set of rules to carry out calculation either by hand or on a machine.
- A finite step-by-step / well-ordered procedure to achieve a required result.
- A sequence of computational steps that transform the input into the output.
- A sequence of operations performed on data to be organized in data structures.
- An abstraction of a program to be executed on a physical machine.
Example of simple Algorithm of
Engineering student’s daily routine
Properties of Algorithms
Ø Finiteness
Ø Unambiguity
Ø Definition
of Sequence
Ø Feasibility
Ø Input
Ø Output
Algorithms↑ v/s Program↓
- Program is an expression of an Algorithm in a programing language.
- Program is set of instruction which computer will follow to solve the problem.
Real
Time (Practical) applications of Algorithms
Ø Data
Retrieval
Ø Network
Routing
Ø Games
Ø Internet
Algorithms
Ø Electronic
Commerce
Ø To
solve many concrete (hard) problems
Mathematics for Algorithms - Knowledge about Set Theory - Relation and Function - Vectors and Matrices
Above mentioned all Topics related to Algorithmic Mathematics are covered in given PDF here, kindly download it by the link given below.
No comments:
Post a Comment