Aspire's Library

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

Previous Year Question (PYQs)



The cyclomatic complexity of the following flow graph is:






Solution

Cyclomatic complexity formula:


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


Where

$E$ = number of edges

$N$ = number of nodes

$P$ = number of connected components (here $P=1$)


From the graph:


Nodes = 10


Edges = 12


So,


$V(G) = 12 - 10 + 2(1)$


$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...