Step 1: Cache size.
Total cache size = 64 KB = \(64 \times 1024 = 65536\) bytes.
Step 2: Assume block size.
By default, block size = 64 bytes (standard unless otherwise mentioned).
Thus, total number of blocks in cache = \(\dfrac{65536}{64} = 1024\) blocks.
Step 3: Number of sets.
It is 8-way set associative. Hence, each set contains 8 blocks.
Number of sets = \(\dfrac{1024}{8} = 128\) sets.
Step 4: Address breakdown.
Address size = 32 bits.
- Block offset bits = \(\log_2(64) = 6\).
- Index bits = \(\log_2(128) = 7\).
- Tag bits = \(32 - (6+7) = 19\).
\[ \boxed{19} \]
A packet with the destination IP address 145.36.109.70 arrives at a router whose routing table is shown. Which interface will the packet be forwarded to?

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