lec-15 Metrics-Complexity精选.pptVIP

* /apps/wiki/testing/Linearly_independent_path * This equation means to concatenate paths 2 and 3 together to form the path A, B, C, B, C, G, A, B, E, F, G and then remove the four nodes that appear in path 1, resulting in the required path 6. * * * * * Shi Wenxuan Nankai University LECTURE 15: Software Complexity Metrics * Topics Measuring Software Complexity Cyclomatic Complexity * Measuring Software Complexity Software complexity is difficult to operationalize complexity so that it can be measured Computational complexity measure big O (or big Oh), O(n) Measures software complexity from the machine’s viewpoint in terms of how the size of the input data affects an algorithm’s usage of computational resources (usually running time or memory) Complexity measure in software engineering should measure complexity from the viewpoint of human developers Computer time is cheap; human time is expensive * Desirable Propertiesof Complexity Metrics Monotonicity: adding responsibilities to a module cannot decrease its complexity If a responsibility is added to a module, the modified module will exhibit a complexity value that is the same as or higher than the complexity value of the original module Ordering (“representation condition” of measurement theory): Metric produces the same ordering of values as intuition would Cognitively more difficult should be measured as greater complexity Discriminative power (sensitivity): modifying responsibilities should change the complexity Discriminability is expected to increase as: 1) the number of distinct complexity values increases and 2) the number of classes with equal complexity values decreases Normalization: allows for easy comparison of the complexity of different classes * Cyclomatic Complexity Invented by Thomas McCabe (1974) to measure the complexity of a program’s conditional logic Counts the number of decisions in the program,under the assumption that decisions are difficult for people Makes assumptions about decision-co