a) Define the term algorithm.

b)What are the different ways to describe algorithms?

c) What is the difference between an algorithm for solving a problem and a computer program that solves this problem?

Step 1 :

(a) An algorithm is an effective method that can be expressed within a finite amount of space and time and is a well defined formal language for calculation a function.

Step 2 ;

(b) There are different ways to describe algorithm

* Step form : it is one of the most easiest way to describe the algorithms, this way consist of several sequence of steps.

* Pseudo code: it is basically text based algorithms it contain steps, selection of steps, iteration, and sequence.

* Flow chart : it is very easy and graphically showing algorithm that contain regular sequence of steps and many types of various boxes and there order by connecting them with arrows.

* Nassi Schneiderman : It is a graphical design representation for structural program.