Question discussion

N is the number of nodes of the control graph and E is the number of edges in the control flow graph. What is Mc Cabe's cyclomatic complexi…

359855Medium DSSSB TGT Computer Science 0 replies 0 views
0

N is the number of nodes of the control graph and E is the number of edges in the control flow graph. What is Mc Cabe's cyclomatic complexity V(G)?

  • AV(G) = E - N - 2
  • BV(G) = E + N - 2
  • CV(G) = E + N + 2
  • DV(G) = E - N + 2
Correct answer: D

Explanation

McCabe's cyclomatic complexity is V(G) = E − N + 2 for a connected control flow graph.

Discussion 0

Nobody has replied yet. Start the discussion!