With respect to software testing, consider a flow graph G with one connected component. Let E be the number of edges, N be the number of nodes, and P be the number of predicate nodes of G. Consider the following four expressions:
- E – N + P
- E – N + 2
- P + 2
- P + 1
The cyclomatic complexity of G is given by
(A) I or III
(B) II or III
(C) II or IV
(D) I or IV
Answer: (C)
Explanation:
Quiz of this Question
Please comment below if you find anything wrong in the above post