Comparison of Software Complexity Metrics

Khan, Ali Athar; Mahmood,  Amjad; Amralla , Sajeda M.; Mirza,Tahera H.

doi:http://dx.doi.org/10.12785/IJCNT/040103

Journals About us Ethics and Policies Objectives Values Contact us

UOB Journals
→
11. International Journal of Computing and Network Technology
→
Volume 04
→
Issue 01
→
View Item

dc.contributor.author	Khan, Ali Athar
dc.contributor.author	Mahmood, Amjad
dc.contributor.author	Amralla , Sajeda M.
dc.contributor.author	Mirza,Tahera H.
dc.date.accessioned	2018-07-31T08:42:36Z
dc.date.available	2018-07-31T08:42:36Z
dc.date.issued	2016
dc.identifier.issn	2210-1519
dc.identifier.uri	https://journal.uob.edu.bh:443/handle/123456789/1720
dc.description.abstract	One of the main problems in software engineering is the inherent complexity. Complexity metric is used to estimate various parameters such as software development cost, amount of time needed for implementation and number of tests required. In this paper, different software complexity models are critically studied and compared. For application, quick sort algorithm is considered. The programs are written in three object oriented languages: C++, Visual Basic and Java. Software complexity for each program is found using the four popular LOC, McCabe, Halstead and Cognitive models. The results are compared.	en_US
dc.language.iso	en	en_US
dc.publisher	University of Bahrain	en_US
dc.rights	Attribution-NonCommercial-ShareAlike 4.0 International	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-sa/4.0/	*
dc.subject	Software Complexity Metric
dc.subject	Line of Code
dc.subject	Cyclomatic Number
dc.subject	Cognitive Complexity
dc.title	Comparison of Software Complexity Metrics	en_US
dc.type	Article	en_US
dc.identifier.doi	http://dx.doi.org/10.12785/IJCNT/040103
dc.volume	04
dc.issue	01
dc.source.title	International Journal of Computing and Network Technology
dc.abbreviatedsourcetitle	IJCNT