in IS&Software Engineering recategorized by
499 views
0 votes
0 votes

A particular control flow graph has $15$ nodes out of which $7$ are decision nodes. The cyclomatic complexity and number of edges respectively can be given by the following :

  1. $7, 21$

  2. $15, 24$

  3. $8, 21$

  4. $16,16$

in IS&Software Engineering recategorized by
by
499 views

2 Answers

1 vote
1 vote
  1. number of nodes (V)=15
  2. number of edges (E)=?
  3. number of decision points =7

Cyclomatic complexity= number of decision points+1= 7+1=8

we also know that cyclomatic complexity=E-V+2

$\therefore 8=E-15+2\implies E=21$

So cyclomatic complexity is $8$,

The number of edges is $21$

Option $(C)$ is correct.

0 votes
0 votes
C
by

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true