Isro 2011 65

Question

In given graph, i found only a and c as decision points ( 2 outgoing edges) . Hence cyclomatic complexity is 3. Am i correct?

Comments

I think its option B 4

Answer 1

M=E-N+P

No. of edges =7

No. of Nodes=5

No. of Predicates =2 (at A,C)

Cyclomatic complexity =M=7-5+2 =4

Therefore Option B is Answer

M=R+1

R=3 since (region 1 ---- abc   ,  region 2 ------ bd  , region 3 -----bcde )

M=3+1=4

Answer 2

nOT IN sYLLABUS