...
Question 2946 – Communication
April 24, 2024
Question 2949 – Communication
April 24, 2024
Question 2946 – Communication
April 24, 2024
Question 2949 – Communication
April 24, 2024

Question 9129 – Software-Engineering

<consider the="" following="" statements="" about="" cyclomatic="" complexity="" of="" control="" flow="" graph="" a="" program="" module.="" which="" these="" are="" true?=""

    I. The cyclomatic complexity of a module is equal to the maximum number of linearly independent circuits in the graph.

    II. The cyclomatic complexity of a module is the number of decisions in the module plus one, where a decision is effectively any conditional statement in the module.

    III. The cyclomatic complexity can also be used as a number of linearly independent paths that should be tested during path coverage testing.

Correct Answer: B

Question 41 Explanation: 
Note: Out of syllabus. [Software Engineering]
A
I and II
B
II and III
C
I and III
D
I, II and III
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!