Aspire Faculty ID #19102 · Topic: UGC NET Computer Science Dec 2019 (Paper II) · Just now
UGC NET Computer Science Dec 2019 (Paper II)


 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$

Previous 10 Questions — UGC NET Computer Science Dec 2019 (Paper II)

Nearest first

Next 10 Questions — UGC NET Computer Science Dec 2019 (Paper II)

Ascending by ID
Ask Your Question or Put Your Review.

loading...