Circuit theoretic approaches to determining software complexity

Abstract

New methodologies for complexity of software engineering systems are proposed. The new methodologies proposed in this paper are based on the classical approach of McCabe [ 11, Halstead [2], and Ramamurthy and Melton [ 3 ] . In this new method, the McCabe method (based on graph theoretic loops) is modified to take into account the effect of the number of operators and operands. Comparison results for the four methodologies based on different programs are presented. In this apper, a combination fo McCabe's and Halstead's methods [2] similar to Ramamurthy and Melton is developed.