The cyclomatic complexity of the flow graph of a program provides:
PYQ GATE 2006
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
Attempted by 110 students.
Sign up free to check your answer
Sign up freeLoading lesson…

