Page 48 - SPM FINAL
P. 48
● 1, 2, 3, 4, 5, 2, 6, 1, 7
● 1, 2, 3, 5, 2, 6, 1, 7
●Optimum Value of Cyclomatic Complexity
An applica on consis ng of zero decision points (IF, FOR, etc.) has an intricacy score of
1 because it contains a single path in the source code. If the program contains an IF
statement consis ng of one condi on, the code would contain a total of two paths:
TRUE or FALSE. The cycloma c complexity algorithm is used to derive a measurable
value based on the number of edges and nodes within the graph as well as the total
count of connected components or exit nodes. It is represented as shown below:
Complexity (M) = Edges (E) – Nodes (N) + Exit Nodes (P)
● 01 to 10 – Minimal Risk
● 11 to 20 – Moderate Risk
● 21 to 50 – High Risk
● Over 50 – Very High Risk
