The first one is external sorting which can be applied to the data source stored on secondary devices like disks or tapes or drums etc. The disks on which information present contains redundant data sometimes and raw data which require data preprocessing initially, then refining of existing external sorting method to produce results in less time than the time taken up by the existing methods. The Second is a pattern-matching algorithm that takes only the text. In this, initial data can be improved using data preprocessing and refinement of existing pattern matching algorithm can search the pattern in quick time compared to existing methods used. The existing methods may be used for small text in which pattern going to be searched. The proposed method can be applied to all the real-time texts which can be of any size. The proposed method is going to be scaled for any given data. The Third is optimal binary search trees which can be still be refined to get better time complexity. By taking a general tree as a tool over the evaluation procedure of any education system on or below the post-graduate level, the hierarchical structure to be developed and the result to be displayed.