Step 1: Evaluate Statement \(S_1\).
In a write-through L1 cache, every write is immediately propagated to the lower-level cache (L2). Therefore, L1 cache lines are never dirty.
Hence, on a read miss in L1, there cannot be any dirty line to write back to L2.
Thus, statement \(S_1\) is true.
Step 2: Evaluate Statement \(S_2\).
Write allocate and write no-allocate policies are design choices and are not mandatory combinations with write-through or writeback caches.
Although write-through caches are commonly paired with no-write allocate and writeback caches with write allocate, this is not a strict requirement.
Hence, statement \(S_2\) is false.
Step 3: Conclusion.
Since \(S_1\) is true and \(S_2\) is false, the correct option is (A).

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).