The complexity of an individual program

  • Authors:
  • John L. McTap

  • Affiliations:
  • Software Engineer, Menlo Park, California

  • Venue:
  • AFIPS '80 Proceedings of the May 19-22, 1980, national computer conference
  • Year:
  • 1980

Quantified Score

Hi-index 0.00

Visualization

Abstract

Zolnowski and Simmons proposed an interesting measure of program complexity. But it suffers from four major practical defects: a) It cannot be applied to an individual program without first identifying a group of existing programs as a reference base. b) It does not provide a reliable measure since the measure usually changes each time the composition of the group of programs changes. c) It is burdensome to compute because the computation must be for an entire group of programs to make possible measuring the complexity of an individual program. d) It cannot be applied to the components within a program, such as modules or subroutines.