Question 142
A flow graph F with entry node (1) and exit node (11) is shown below:
What is the cyclomatic complexity of flowgraph F?
Answer : 3. 4 
What is the cyclomatic complexity of flowgraph F?
Explanation Question 142
To find cyclomatic complexity we have 3 formulas
To find cyclomatic complexity we have 3 formulas
- The number of regions(R) corresponds to the cyclomatic complexity. Total number of regions(R) are 4.
- 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. Predicates are 3 + 1 = 4
- 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.
Edges(E) - Nodes(N) + 2
= 11 - 9 + 2
= 2 + 2
= 4
| Previous | Next |
| UGC NET CS December 2019 - Question 141 | UGC NET CS December 2019 - Question 143 |
UGC is the lifeline of the Indian Education System. Its main priority is to oversee all the things related to Higher Education In India. It was established for this sole purpose, to maintain quality and harmony among universities, government, and community.
ReplyDeleteUGC has many ways of doing there work, such as through the standard of UGC Approved Universities and UGC CARE which establishes a Criteria for the scientific journals.
Without UGC there would have been a lot of discrepancies among the Indian Academia and there would have been no strict standards as to how universities must function creating a plethora of useless graduate and postgraduate degrees being handed out.
UGC Care List
A strict set of standards created by UGC ensures that everything is in order and every university is adequately funded and looked after.