Algorithmic Problem Solving

Algorithmic Problem Solving

Problem solving is based on the decisions that are taken. Following are the six steps of problem solving :

1. Identify the problem : Identifying the problem is the first step in solving the problem. Problem identification is very essential before solving any problem.

2. Understand the problem : Before solving any problem it is important to understand it. There are three aspects based on which the problem can be understood.

Knowledgebase : While solving the problem the knowledgebase can be related to a person or a machine. If the problem is to be solved for the person then it is necessary to know what the person knows. If the problem is to be solved for the machine then its instruction set must be known. Along with this the problem solver can make use of his/her own instruction set.

Subject : Before solving the problem the subject on which the problem is based must be known. For instance : To solve the problem involving Laplace, it is necessary to know about the Laplace transform.

Communication : For understanding the problem, the developer must communicate with the client.

3. Identify the alternative ways to solve the problem : The alternative way to solve the problem must be known to the developer. These alternatives can be decided by communicating with the customer.

4. Select the best way to solve the problem from list of alternative solutions : For selecting the best way to solve the problem, the merits and demerits of each problem must be analysed. The criteria to evaluate each problem must be predefined

5. List the instructions using the selected solution : Based on the knowledgebase (created/used in step 2) the step by step instructions are listed out. Each and every instruction must be understood by the person or the machine involved in the problem solving process.

6. Evaluate the solution :

When the solution is evaluated then - i) Check whether the solution is correct or not ii) Check whether it satisfies the requirements of the customer or not.