The cyclomatic complexity metric provides the designer with information regarding the number of __________.
Independent logic paths in the program
Cyclomatic complexity, introduced by McCabe, is a software metric computed from the control-flow graph of a program and is the basis of basis-path testing.
Step 1 — It is computed as \(V(G) = E - N + 2\) (edges minus nodes plus two), or as the number of decision (predicate) nodes plus one, or as the number of regions of the flow graph.
Step 2 — The value equals the number of linearly independent paths through the program, which is the number of test cases needed to execute every statement and every branch at least once in basis-path testing.
The metric does not count loops (cycles) as such, it cannot predict the number of errors (it only indicates where errors are likely), and it is unrelated to the count of statements: a long straight-line program has complexity 1.
Independent logic paths in the program option is correct.
Maximum possible value of reliability is
Which one of the following is not a source code metric ?
In software testing, how the error, fault and failure are related to each other ?
Which design metric is used to measure the compactness of the program in terms of lines of code ?
Verification :
In which testing strategy requirements established during requirements analysis are validated against developed software ?
Which one of the following is not a definition of error ?
Assume that a program will experience 200 failures in infinite time. It has now experienced 100 failures. The initial failure intensity was 20 failures/CPU hr. Then the current failure intensity will be
Software testing is
Regression testing is primarily related to
Equivalence partitioning is a ______.
What is the other name of White-box testing?