Which of the following assertions about the cyclomatic complexity is false? The
ID: 3823591 • Letter: W
Question
Which of the following assertions about the cyclomatic complexity is false?
The cyclomatic complexity is used to find out how many independent paths are enough to cover the control flow graph;
The cyclomatic complexity equals to the number of regions in the control flow graph;
The cyclomatic complexity equals to the number of predicates plus 1;
The cyclomatic complexity measures the time complexity of the given program;
The number of independent paths to discover is always less than or equal to the cyclomatic complexity number.
The cyclomatic complexity is used to find out how many independent paths are enough to cover the control flow graph;
The cyclomatic complexity equals to the number of regions in the control flow graph;
The cyclomatic complexity equals to the number of predicates plus 1;
The cyclomatic complexity measures the time complexity of the given program;
The number of independent paths to discover is always less than or equal to the cyclomatic complexity number.
Explanation / Answer
The cyclomatic complexity never measures the time complexity of the given program; is false because it does not measure the time complexity of a give program , By no means it measures that
So this statement is wrong, OPTION D
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.