Register

UGC NET CSE | December 2019 | Part 2 | Question: 92

• edited by
725 views

1 Answer

0 votes
0 votes

According to the given graph $F$

  • Total number of vertex $(V)=9$
  • Total number of edges $(E)=11$
  • Number of predicate node$=3\to(1,(2,3),6)$

$\therefore \text{ Cyclomatic complexity of flow graph is = number of predicate node +1}\implies  3+1=4$

So Cyclomatic complexity of given flow-graph $F$ is $4$

Option $(C)$

Ref: Gate 2015

 

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
2 answers
1
soujanyareddy13 asked May 12, 2021
2,858 views
UGC NET CSE | December 2019 | Part 2 | Question: 1
A basic feasible solution of an $m \times n$ transportation problem is said to be non-degenerate, if basic feasible solution contains exactly _______ number of individual allocation in ______ positions. $m+n+1$, independent $m+n-1$, independent $m+n-1$, appropriate $m-n+1$, independent
A basic feasible solution of an $m \times n$ transportation problem is said to be non-degenerate, if basic feasible solution contains exactly _______ number of individual...
User Avatar
4 votes
4 votes
6 answers
3
soujanyareddy13 asked May 12, 2021
1,938 views
UGC NET CSE | December 2019 | Part 2 | Question: 3
The Boolean expression $AB+A \overline{B}+\overline{A}C+AC$ is unaffected by the value of the Boolean variable _________. $A$ $B$ $C$ $A, B$ and $C$
The Boolean expression $AB+A \overline{B}+\overline{A}C+AC$ is unaffected by the value of the Boolean variable _________.$A$$B$$C$$A, B$ and $C$
User Avatar
Link Copied!