Question discussion

The control-flow graph of a program has 11 edges, 9 nodes and one connected component. What is its cyclomatic complexity?

965Medium DSSSB TGT Computer Science 0 replies 1 views
0

The control-flow graph of a program has 11 edges, 9 nodes and one connected component. What is its cyclomatic complexity?

  • A2
  • B3
  • C4
  • D5
Correct answer: C

Explanation

V(G) = E − N + 2P = 11 − 9 + 2 = 4.

Discussion 0

Nobody has replied yet. Start the discussion!