The cyclomatic complexity of a flow graph V(G), in terms of predicate nodes, is: [where P is the number of predicate nodes in the flow graph V(G)]
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: A. (A) P + 1
More Software Engineering questions
- In software testing, how are error, fault and failure related to each other?
- Verification: (A) refers to the set of activities that ensure that software correctly implements a specific function (B) gives answer to th…
- In which testing strategy are the requirements established during requirements analysis validated against the developed software?
- COCOMO stands for ………………
- Size and complexity are a part of
- Which of the following is an indirect measure of product?