...
Compiler-Design
October 7, 2023
Database-Management-System
October 7, 2023
Compiler-Design
October 7, 2023
Database-Management-System
October 7, 2023

NIC-NIELIT Scientist-B 2020

Question 66
Which one of the following statements is incorrect?
A
The number of regions corresponds to the cyclomatic complexity.
B
Cyclomatic complexity for a flow graph G is V(G) = N – E + 2, where E is the number of edges and N is the number of nodes in flow graph.
C
Cyclomatic complexity for a flow graph G is V(G) = E – N + 2, where E is the number of edges and N is the number of nodes in flow graph.
D
Cyclomatic complexity for a flow graph G is V(G) = P + 1, where P is the number of predicate nodes contained in the flow graph G.
Question 66 Explanation: 
To find the cyclomatic complexity using three formulas.
The number of regions
Predicate(P) + 1 [ Predicate divides minimum 2 or more ]
E-N+2
Correct Answer: B
Question 66 Explanation: 
To find the cyclomatic complexity using three formulas.
The number of regions
Predicate(P) + 1 [ Predicate divides minimum 2 or more ]
E-N+2
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!