2.1. Process of becoming familiar with the problem because we need to analyze and understand it well before solving
3. Algorithm design
3.1. Effective procedure for solving a problem in finite number of steps. Is the process that step by step description of the method to solve a problem
4. Compilation and execution
4.1. Once the compilation is completed then the program is linked with other object programs needed for execution, there by resulting in a binary program, and then the program is uploaded into memory for the purpose of execution and finally it is executed
20. The first sketch of an algorithm is called pseucode, this is a verbal account of the solution, the original language of the programmer, it is independent of any programming language, it is an algorithm description language