Given a flow graph with 10 nodes, 13 edges and one connected components, the number of regions and the number of predicate (decision) nodes in the flow graph will be
A. 4, 5
B. 5, 4
C. 3, 1
D. 13, 8
Answer:B
Given a flow graph with 10 nodes, 13 edges and one connected components, the number of regions and the number of predicate (decision) nodes in the flow graph will be
A. 4, 5 B. 5, 4 C. 3, 1 D. 13, 8
Explanation: Cyclomatic complexity is a software metric. It provides a quantitative measure of the logical complexity of a program.