Performance Evaluation of Implementation Languages on Cognitive Complexity of Dijkstra Algorithm

Journal Title: Annals. Computer Science Series - Year 2018, Vol 16, Issue 1

Abstract

Maintainability is a key factor in measuring the quality of developed software and it becomes important due to dynamism of software. Partially, maintainability is a function of source code understandability on the part of developers. Therefore, cognitive complexity of software is relevant to its maintainability. In fact it is not an overemphasis to state that, quality of software in general can hardly be control if the code is complex (Banker, Datar and Zweig, 2009;francalanci and Merlo, 2010). Hence as a result of strong impact that cognitive complexity has on the software quality this research work investigates the effect of some implementation languages on cognitive complexity. Three earlier and recent implementation languages were sampled in term of Procedural Programming Languages and Object Oriented Languages then implemented on a unique algorithm and appraised using Procedural Cognitive Complexity Metric[P.C.C.M] and Multiparadigm Cognitive Complexity Metrics [ M.C.C.M] respectively. The experiment results have shown that among the procedural programming languages, Fortran has least cognitive complexity with sixty six while among Object Oriented Languages C++ has the least with one hundred and thirty eight. Cross assessment of Fortran and C++ using both [P.C.C.M] and [M.C.C.M] reveal that Fortran has the least cognitive complexity among all the implementation languages used. The research results has shown that Fortran 77 is the best for implementation of Dijkstra algorithm among the selected languages to have the least cognitive complexity and has reaffirmed that some languages are more appropriate for easy understandability of source code than others.

Authors and Affiliations

Isah Olawale Mustapha, Stephen O. OLABIYISI, Rasheed Gbenga JIMOH, Maruf Olasunkanmi ALIMI

Keywords

Related Articles

Steady Flow of a Reactive MHD Fluid through a Permeable Pipe under Optically Thick Limit Radiation

his research work investigates the analytical solution of the temperature profile distribution of a one-dimensional fluid under the influence of magnetic fluid strength of a reactive hydromagnetic fluid flow through poro...

Technique detection software for Sparse Matrices

Sparse storage formats are techniques for storing and processing the sparse matrix data efficiently. The performance of these storage formats depend upon the distribution of non-zeros, within the matrix in different dime...

E-learning and use of computer in forensic field

In the Romanian penitentiary establishments and those of other European countries one talks about the formal and informal education. Since the correspondence education system, important steps have been made towards the e...

Framework for a Genetic-Neuro-Fuzzy Inferential System for Diagnosis of Diabetes Mellitus

One of the most dangerous diseases in the modern society is diabetes mellitus and it is not only a medical problem but also a socio-economy. Artificial Intelligence techniques have been successfully employed in diabetes...

Performance Evaluation of PSO, PSOCA and MPSOCA for Solving University Timetabling Problem

In this paper, performance evaluation of Particle Swarm Optimization algorithm (PSO), Particle Swarm Optimization based Cultural Algorithm (PSOCA) and Modified Particle Swarm Optimization based Cultural Algorithm (MPSOCA...

Download PDF file
  • EP ID EP521415
  • DOI -
  • Views 92
  • Downloads 0

How To Cite

Isah Olawale Mustapha, Stephen O. OLABIYISI, Rasheed Gbenga JIMOH, Maruf Olasunkanmi ALIMI (2018). Performance Evaluation of Implementation Languages on Cognitive Complexity of Dijkstra Algorithm. Annals. Computer Science Series, 16(1), 49-54. https://europub.co.uk/articles/-A-521415