UNIT 1
PROGRAMMING
BASICS
By: Hema Patel & Janki
,Introduction to Algorithm
A typical programming task can be divided into two phases:
Problem Solving Phase
Produce an ordered sequence of steps that describes solution of problem
This sequence of steps is called an algorithm
Implementation Phase
Implement the program in some programming language
,Introduction to Algorithm
The algorithm is defined as a finite sequence of explicit instruct
(that are written in human understandable language), when pro
with a set of input values, produce output and terminates.
An algorithm is:
◦ “A sequence of activities to be processed for getting
desired output from a given input.”
◦ An algorithm is a procedure or step-by-step instruction for solving a problem
, PROPERTIES OF ALGORITHM
Donald Ervin Knuth has given a list of five properties for an algorithm, these
properties are:
1. FINITENESS
2. DEFINITENESS
3. INPUT
4. OUTPUT
5. EFFECTIVENESS
PROGRAMMING
BASICS
By: Hema Patel & Janki
,Introduction to Algorithm
A typical programming task can be divided into two phases:
Problem Solving Phase
Produce an ordered sequence of steps that describes solution of problem
This sequence of steps is called an algorithm
Implementation Phase
Implement the program in some programming language
,Introduction to Algorithm
The algorithm is defined as a finite sequence of explicit instruct
(that are written in human understandable language), when pro
with a set of input values, produce output and terminates.
An algorithm is:
◦ “A sequence of activities to be processed for getting
desired output from a given input.”
◦ An algorithm is a procedure or step-by-step instruction for solving a problem
, PROPERTIES OF ALGORITHM
Donald Ervin Knuth has given a list of five properties for an algorithm, these
properties are:
1. FINITENESS
2. DEFINITENESS
3. INPUT
4. OUTPUT
5. EFFECTIVENESS
