ISRO2011-65

Question

The Cyclomatic Complexity metric V(G) of the following control flow graph

• A. 3
• B. 4
• C. 5
• D. 6

Comments

Do not study this dude, Its out of syllabus.

---

these questions coming in isro,,,,and other exams

---

Not really. This question is from s/w engineering  and the anzwer is 4. As the no.  Of regions is 4. Three inner and one outer.

Answer 1

Cyclomatic complexity = e - n + 2 p

= 7 - 5 + 2(1)

= 4

Or cyclomatic complexity is the number of regions enclosed = 4

Comments

What is e,n,p?

---

e - edge

n - node

P - component

---

Yes.

Answer 2

Cyclomatic complexity is a software metric (measurement), used to indicate the complexity of a program.Cyclomatic complexity is computed using the control flow graph of the program

The complexity M is then defined as

M = E − N + 2P,

where

E = the number of edges of the graph.

N = the number of nodes of the graph.

P = the number of connected components.

 

Cyclomatic complexity(M) = E − N + 2P,

=7-5+2(1)=4

Comments

But this video from nptel has a different definition. watch at 11:34 sec .

Even this video has same definition..