Question 10899 – Software-Engineering

The cyclomatic complexity of the flow graph of a program provides

Correct Answer: C

Question 14 Explanation:

Note: Out of syllabus.

an upper bound for the number of tests that must be conducted to ensure that all statements have been executed at most once

a lower bound for the number of tests that must be conducted to ensure that all statements have been executed at most once

an upper bound for the number of tests that must be conducted to ensure that all statements have been executed at least once

a lower bound for the number of tests that must be conducted to ensure that all statements have been executed at least once