The cyclomatic complexity of the flow graph of a program provides
(A)
an upper bound for the number of tests that must be conducted to ensure that all statements have been executed at most once
(B)
a lower bound for the number of tests that must be conducted to ensure that all statements have been executed at most once
(C)
an upper bound for the number of tests that must be conducted to ensure that all statements have been executed at least once
(D)
a lower bound for the number of tests that must be conducted to ensure that all statements have been executed at least once
Answer: (C)
Explanation:
Option (C) is correct, because the cyclomatic complexity of the flow graph of a program provides an upper bound for the number of tests that must be conducted to ensure that all statements have been executed at least once.
Quiz of this Question
Please comment below if you find anything wrong in the above post