Aspire's Library

A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations - NIMCET

Previous Year Question (PYQs)


 What is the cyclomatic complexity of flowgraph $F$?




Solution

Cyclomatic complexity is:

$V(G)=E-N+2$

Here,

Number of nodes:

$N=9$

Number of edges:

$E=11$

So,

$V(G)=11-9+2$

$V(G)=4$


Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More

Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More
Ask Your Question or Put Your Review.

loading...