ISRO CSE 2014 PYQ

A wait state is an extra clock period inserted when the memory cannot complete an access within the processor's normal memory cycle. The CPU clock period is $T = 1/(33 \times 10^6) seconds \approx 30.30 ns$. The memory plus address-decoding/buffering delay is 60 + 10 = 70 ns. Two clock periods provide about 60.61 ns, which is insufficient. Three periods provide about 90.91 ns, which is sufficient. Therefore, one additional wait state is required (assuming the normal access window is two T-states).

The memory contains m words, each n bits long, so it stores mn independent bits. Each bit can be either 0 or 1. Hence the total number of distinct memory contents (configurations) is $2^{mn}$. An FSM that explicitly represents every possible memory configuration requires one state per configuration, giving $2^{m*n$} states.

The preprocessor substitutes the argument text into the macro body. With #define SQR(x) (x*x), SQR(b+2) expands to (b+2*b+2), not (b+2)*(b+2). Since multiplication has higher precedence than addition, this is 4 + (2$\times 4) + 2 = 14$. The macro is unsafe for general use; define it as #define SQR(x) ((x)*(x)) to preserve the intended grouping.

Cyclomatic complexity is V(G) = number of independent decision outcomes (predicate contributions) + 1. The while condition contributes one decision. The compound if condition has two atomic Boolean tests; when short-circuit/control-flow evaluation is represented separately, these contribute two more decision points. Thus V(G) = 3 + 1 = 4. If a course counts the compound if as a single predicate node, it may report 3; the intended answer 4 assumes each atomic condition is counted.

The grammar generates balanced-parenthesis strings using S → SS (concatenation), S → (S) (wrapping a balanced string in a pair of parentheses), and S → $\epsilon (empty string)$. A derivation-step count depends on the convention: whether the final $\epsilon -productions$ are counted and whether the derivation is leftmost or arbitrary. The supplied question does not define that convention, so the keyed value 15 should be treated as provisional rather than independently verified. The string itself is generated by recursively splitting it into balanced components and wrapping them.