The principle of Cyclomatic complexity, considering L as edges or links, N as nodes, P as independent paths
Software Testing Exam from International Software Testing Qualifications Board (ISTQB)
(Continued from previous question...)
The principle of Cyclomatic complexity, considering L as edges or links, N as nodes, P as independent paths
The principle of Cyclomatic complexity, considering L as edges or links, N as nodes, P as independent paths
A. L-N +2P
B. N-L +2P
C. N-L +P
D. N-L +P
Answer:
(Continued on next question...)
Other Interview Questions
|