...
UGC NET CS 2013 June-paper-2
May 20, 2024
UGC NET CS 2013 June-paper-2
May 20, 2024
UGC NET CS 2013 June-paper-2
May 20, 2024
UGC NET CS 2013 June-paper-2
May 20, 2024

UGC NET CS 2013 June-paper-2

Question 5
Cyclometric complexity of a flow graph G with n vertices and e edges is
A
V(G) = e+n–2
B
V(G) = e–n+2
C
V(G) = e+n+2
D
V(G) = e–n–2
Question 5 Explanation: 
Cyclomatic complexity uses 3 formulas:
1. The number of regions corresponds to the cyclomatic complexity
2. V(G),Flow graph is defined as V(G)=E-N+2 where E is the number of flow graph edges, and N is the number of flow graph nodes.
3. V(G),Flow graph is defined as V(G)=P+1 where p is the number of predicate nodes contained in the flow graph G.
Correct Answer: B
Question 5 Explanation: 
Cyclomatic complexity uses 3 formulas:
1. The number of regions corresponds to the cyclomatic complexity
2. V(G),Flow graph is defined as V(G)=E-N+2 where E is the number of flow graph edges, and N is the number of flow graph nodes.
3. V(G),Flow graph is defined as V(G)=P+1 where p is the number of predicate nodes contained in the flow graph G.
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x