Step 1: Understanding activation trees.
An activation tree represents the hierarchy of procedure calls during program execution, where each node corresponds to a procedure invocation.
Step 2: Verification of Statement \( S_1 \).
In program execution, a procedure is recorded at the moment it is called, before its children are invoked. This corresponds exactly to a preorder traversal of the activation tree. Hence, \( S_1 \) is true.
Step 3: Verification of Statement \( S_2 \).
A procedure returns only after all its child calls have completed. This corresponds to a postorder traversal of the activation tree. Hence, \( S_2 \) is also true.
Step 4: Conclusion.
Since both statements are correct, the correct option is (C).
In a 4-bit ripple counter, if the period of the waveform at the last flip-flop is 64 microseconds, then the frequency of the ripple counter in kHz is ______________. {(Answer in integer)}
Consider the following C code segment:
int x = 126, y = 105;
do {
if (x > y)
x = x - y;
else
y = y - x;
} while (x != y);
printf("%d", x);
The output of the given C code segment is ____________. (Answer in integer)
The following two signed 2’s complement numbers (multiplicand \( M \) and multiplier \( Q \)) are being multiplied using Booth’s algorithm:
| Multiplicand (\( M \)) | Multiplier (\( Q \)) |
|---|---|
| 1100 1101 1110 1101 | 1010 0100 1010 1010 |
The total number of addition and subtraction operations to be performed is __________. (Answer in integer)
The maximum value of \(x\) such that the edge between the nodes B and C is included in every minimum spanning tree of the given graph is __________ (answer in integer).
Consider the following C program
The value printed by the given C program is __________ (Answer in integer).