GATE 2006-IT

Question 16

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

Question 16 Explanation:

Note: Out of syllabus.

Correct Answer: C

Question 16 Explanation:

Note: Out of syllabus.