SOFTWARE TESTING
TEST PLAN AND TEST CASE DEVELOPMENT
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
T. J. McCabe
|
|
|
B. W. Boehm
|
|
|
Roger S. Pressman
|
|
|
Mike Cohn
|
Detailed explanation-1: -Cyclomatic complexity is a software metric used to indicate the complexity of a program. It is a quantitative measure of the number of linearly independent paths through a program’s source code. It was developed by Thomas J. McCabe, Sr.
Detailed explanation-2: -What is McCabe’s Cyclomatic Complexity? Cyclomatic Complexity in Software Testing is a testing metric used for measuring the complexity of a software program. It is a quantitative measure of independent paths in the source code of a software program.
Detailed explanation-3: -McCabe, the cyclomatic complexity metric is always provided as a whole number. The lower the number is, the fewer linear paths of execution the code contains. A lower number means you’ll have to write fewer unit tests in order to ensure a given piece of software has tests for every conceivable permutation.