Register

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

• edited by
1,182 views

1 Answer

0 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

 

Voting & Accepting an answer helps improve the community
← Previous · UGC NET CSE | Decemb...Next → · UGC NET CSE | Decemb...
← Previous in category · CMI-2018-DataScience...Next in category → · UGC NET CSE | Decemb...
Position:
Show:

Related questions

0 0 votes
0 0 answers
432
432 views
soujanyareddy13 asked Jan 9, 2022
432 views
NIELIT 2021 Dec Scientist A - Section B: 63
The Cyclomatic complexity of two modules $\text{A}$ and $\text{B}$ are $10$ and $15$ respectively :What is the cyclomatic complexity of sequential integration of $\text{A...
1 1 vote
1 1 answer
381
381 views
soujanyareddy13 asked May 12, 2021
381 views
UGC NET CSE | December 2019 | Part 2 | Question: 59
Consider the following statements:$S_1 : \forall x P(x) \vee \forall x Q(x)$ and $\forall x (P(x) \vee Q(x))$ are not logically equivalent.$S_2 : \exists x P(x) \wedge \e...
2 2 votes
2 2 answers
981
981 views
soujanyareddy13 asked May 12, 2021
981 views
UGC NET CSE | December 2019 | Part 2 | Question: 95
A flow graph $F$ with entry node $(1)$ and exit node $(11)$ is shown below:How many predicate nodes are there and what are their names?Three: $(1,(2,3),6)$Three: $(1,4,6)...
0 0 votes
1 1 answer
1.5k
1.5k views
soujanyareddy13 asked May 12, 2021
1,517 views
UGC NET CSE | December 2019 | Part 2 | Question: 33
In a system for a restaurant, the main scenario for placing order is given below:Customer reads menuCustomer places orderOrder is sent to kitchen for preparationOrdered i...