Peer Reviewed Open Access

This paper is reviewed in accordance with the Peer Review Program of IRA Academico Research


Retrieval of Similarity Measures of Code Component

M. K. Patil, P. P. Jamsandekar
Abstract

Modern programming languages, especially object oriented languages facilitate to create libraries of reusable components (e.g. class definition). The majority of software companies are designing the components and reusing those wherever applicable. Maintaining such components (i.e. class library) and accessing those at right time in right form is challenging because large no. of components in library. Object Oriented Programming supports the reusability of the code. The major challenge in programming is to improve the learning quality and productivity of the software developer, subject teachers and students.

To support programming in Java, researcher implemented a design retrieval algorithm which will make it possible to search through potentially reusable Java classes. The proposed work, selects the appropriate descriptors of the inputted cases - .java files. It will separate the code components automatically and stores in the repository. The different levels of ambiguity in selection of cases are controlled through data preprocessing technique of data mining. The set of adjustments applied to get the similarity of the code components.

Keywords
Code reusability; retrieval; ambiguity; data mining
Full Text:
PDF


©IRA Academico Research & its authors
This article is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. This article can be used for non-commercial purposes. Mentioning of the publication source is mandatory while referring this article in any future works.