1
GATE CSE 2009
+2
-0.6
Consider the following statements about the cyclomatic complexity of the control flow graph of a program module. Which of these are TRUE?

$${\rm I}.\,\,\,\,\,\,$$ The cyclomatic complexity of a module is equal to the maximum number of
$$\,\,\,\,\,\,\,\,\,\,\,$$linearly independent circuits in the graph.
$${\rm II}.\,\,\,$$ The cyclomatic complexity of a module is the number of decisions in the
$$\,\,\,\,\,\,\,\,\,\,$$module plus one, where a decision is effectively any conditional statement in
$$\,\,\,\,\,\,\,\,\,\,$$the module.
$${\rm III}\,$$ The cyclomatic complexity can also be used as a number of linearly
$$\,\,\,\,\,\,\,\,\,\,$$independent paths that should be tested during path coverage testing.

A
$${\rm I}$$ & $${\rm I}$$$${\rm I}$$
B
$${\rm I}$$$${\rm I}$$ & $${\rm I}$$$${\rm I}$$$${\rm I}$$
C
$${\rm I}$$ & $${\rm I}$$$${\rm I}$$$${\rm I}$$
D
$${\rm I}$$, $${\rm I}$$$${\rm I}$$ & $${\rm I}$$$${\rm I}$$$${\rm I}$$
2
GATE CSE 2009
+2
-0.6
Which of the following statements are TRUE?

$${\rm I}.\,\,\,\,\,\,$$ The content diagram should depict the system as a single bubble.
$${\rm II}.\,\,\,\,$$ External entities should be identified clearly at all levels of $$DFDs$$
$${\rm III}.\,\,$$ Control information should not be represented in $$DFD$$
$${\rm IV}.\,\,$$ A data store can be connected either to another data store or to an external
$$\,\,\,\,\,\,\,\,\,\,\,\,$$entity.

A
$${\rm I}$$$${\rm I}$$ & $${\rm I}$$$${\rm I}$$$${\rm I}$$
B
$${\rm I}$$, $${\rm I}$$$${\rm I}$$ & $${\rm I}$$ $$V$$
C
$${\rm I}$$ & $${\rm I}$$$${\rm I}$$$${\rm I}$$
D
$${\rm I}$$, $${\rm I}$$$${\rm I}$$ & $${\rm I}$$$${\rm I}$$$${\rm I}$$
GATE CSE Subjects
EXAM MAP
Medical
NEET