Consider a system with 4 types of resources R1 (3 units), R2 (2 units), R3 (3 units), R4 (2 units). A non-preemptive resource allocation policy is used. At any given instance, a request is not entertained if it cannot be completely satisfied. Three processes P1, P2, P3 request the sources as follows if executed independently. Which one of the following statements is TRUE if all three processes run concurrently starting at time t = 0?

The coupling between different modules of a software is categorized as follows
$${\rm I}.\,\,\,\,\,\,\,\,\,\,\,$$ Content coupling
$${\rm II}.\,\,\,\,\,\,\,\,\,$$ Common coupling
$${\rm III}.\,\,\,\,\,\,\,$$ Control coupling
$${\rm IV}.\,\,\,\,\,\,\,$$ Stamp coupling
$${\rm V}.\,\,\,\,\,\,\,\,\,$$ Data coupling
Coupling between modules can be ranked in the order of strongest (least desirable) to weakest (most desirable) as follows.

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.

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.