Logical-Reasoning
November 26, 2023Software-Engineering
November 26, 2023GATE 2006-IT
|
Question 16
|
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 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
|
Question 16 Explanation:
Note: Out of syllabus.
Correct Answer: C
Question 16 Explanation:
Note: Out of syllabus.