PROGRAM
Program is a set of step by step instructions written in a computer language.
A program tells the computer to:
1. Read input
2. Process
3. Store
4.Write Output
We can divide a programming tasks into two phases:
1. Problem solving phase: This phase involves producing order sequence of steps that describe a solution . This sequence of steps called an algorithm.
2. Implementation Phase : This phase involves implementing the algorithm in some programming language.
ALGORITHM
Computer does not have a brain of its own . It works as instructed. This series of instructions is known as algorithm . Algorithm can be defined as telling all instruction the computer the series of steps to perform every work step by step the basic steps are:
1. Start
2. Get input by keyboard, mouse ,scanner, camera or mike.
3. Process
4. Output by store , display , print
5. Stop
An algorithm can be a simple process such as adding two numbers together or a complex function that is adding effect to any image let us follow a real life example to understand algorithm.
Algorithm to prepare tea
Step 1 : Go to the kitchen
Step 2 : Boil water in a pan
Step 3 : Put sugar and tea leaves
Step 4 : After a few boils add milk
Step 5 : Strain the leaves while pouring in a mug
Step 6 : Serve hot.
Most computer programmer spend a large percentage of the time trading algorithms the goal is to create efficient algorithms that do not waste computer resources save time and give the desired output.
FEATURES OF AN ALGORITHM
Let us learn about the basic features of an algorithm.
1. Input
2. Algorithms have effectively computable operation
Each operation in an algorithm must be doable , that is , is the operation must be something that is possible to do . For computers , many mathematical operations such as division by zero error finding the square root of a negative number are also impossible. These operations are not effectively computable so they cannot be used in writing algorithms.
3. Algorithms produce a result
4. Algorithms halt in a finite amount of time
Algorithms should be composed of a finite number of operations and they should complete their execution in a finite amount of time .
5. Algorithms are definite.
The steps in an algorithm must be clearly defined in a pseudo code. A pseudo code can be defined as a statement in a plain and simple English language which is later translated into a programming language.
STEPS TO DEVELOP AN ALGORITHM
The steps involved in developing an algorithm are:
1. Describe the problem
2. Analyse the problem
3. Writing serial wise steps
4. Refine the algorithm by adding more detail
5. Review the algorithm
Rules for writing an algorithm are listed below:
1. It must begin with start
2. Write each step in a separate line and even number to each line
3. To get an input use the keyboard input or read
4. To display an output use the keyboard print or write
5. An algorithm must end with stop
6. Keep the algorithm short.
ADVANTAGES OF ALGORITHMS
The use of algorithms provides a number of advantages . some of them are :
1. The development of the procedure involves identification of the processes , decision points and variable necessary to solve the problem.
2. Developing an algorithm allows and even forces the developer to examine the solution processes properly.
3. Identification of the processes and decision points reduces the task into a series of smaller steps of more manageable size.
4. Problems that are difficult or impossible to solve are approached as a series of small, solvable sub- problems.
5. An algorithm aids in decision making.
6. It makes the process more efficient and more consistent.
7. An algorithm for such as mnemonic device and help ensure that variables are parts of the problems are not ignored. Presenting the solution processes as an algorithm allows more precise communication.
Post a Comment