Consider the implementation of sliding window protocol over a lossless link, with a window size of $W$ frames, where each frame is of size 1000 bits (including header). The bandwidth of the link is $100 \mathrm{kbps}\left(1 \mathrm{k}=10^3\right)$ and the one-way propagation delay is 100 milliseconds. Assume that processing times at the sender and receiver are zero and the transmission time of acknowledgements is also zero. Which one of the following options gives the minimum size of $W$ (in number of frames) required to achieve $100 \%$ link utilization?

An ISP having an address block 202.16.0.0/15 assigns a block of 6000 IP addresses to a client, using the classless internet domain routing (CIDR) super-netting approach. Which of the following address blocks can be assigned by the ISP?

Match each addressing mode in List I with a data element or an element of a data structure (in a high-level language) in List II:

Consider a processor P whose instruction set architecture is the load-store architecture. The instruction format is such that the first operand of any instruction is the destination operand.

Which one of the following sequences of instructions corresponds to the high-level language statement $Z=X+Y$ ?

Note: $X, Y$, and $Z$ are memory operands. $R 0, R 1$, and $R 2$ are registers.