Measuring Complexity of Object Oriented Programs

Simple item page
dc.creatorMisra, Sanjay, Akman, Ibahim
dc.date2008
dc.date.accessioned2025-03-26T16:45:16Z
dc.descriptionIn this paper, a metric for object oriented language is formulated and validated. On the contrruy of the other metrics used for object oriented programming (OOPs), the proposed metric calculates the complexity of a dass at method level and hence considers the intemal architecture of the classes, subclasses and member functions. The proposed met1ic is evaluated against Weyuker's proposed set of measurement principles through examples and val idated through experimentation, case study and comparative study with similar measures. The practical usefulness of the metric is evaluated by a practical framework.
dc.formatapplication/pdf
dc.identifierhttp://eprints.covenantuniversity.edu.ng/2352/
dc.identifier.urihttps://repository.covenantuniversity.edu.ng/handle/123456789/31823
dc.languageen
dc.subjectQA75 Electronic computers. Computer science, QA76 Computer software
dc.titleMeasuring Complexity of Object Oriented Programs
dc.typeConference or Workshop Item

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Prof. Misra 53.pdf
Size:
173.46 KB
Format:
Adobe Portable Document Format
Download

Collections

EPrint