Execution profiles are indicators for code coverage of program; this has been demonstrated by researchers on a large scale through their contributions on the same. Test suite reduction is a feature which achieves code coverage with minimum number of test cases ensuring that all code items have been tested. It is a Non-deterministic Polynomial-time Complete (NP-Complete) problem. Few approaches like greedy approach, Harrold, Soffa and Gupta (HGS) approach have been used in literature which is good approaches. Current paper achieves similar milestones with reduced test cases as well.