Finally, we will be able to give the first approximation algorithms. We will do this using basic techniques which are commonly used in the development of computer algorithms. The first technique is the "development of sequential algorithms": with this technique we will be able to give approximation algorithms for the minimum bin packing problem and for the minimum vertex cover problem. The second technique is the "greedy technique": by using this technique we will able to show that the maximum sat problem is approximable within performance ratio of 2. Then we will switch to the local search technique.: by using the local search technique we will be able to show that the maximum cut problem is approximable within performance ratio of 2. Finally by using another well known technique, that is "dynamic programming minimum partition" will be able to develop an approximation algorithm for minimum partition problem.

---