Consider the transmission of data bits 110001011 over a link that uses Cyclic
Redundancy Check (CRC) code for error detection. If the generator bit pattern is
given to be 1001, which one of the following options shows the remainder bit
pattern appended to the data bits before transmission?
To detect transmission errors using CRC, the transmitter appends a remainder (the Frame Check Sequence) obtained by dividing the data bits, padded with zeros equal to the degree of the generator, by the generator using modulo-2 (XOR) division.
Step 1: Identify the degree of the generator. Generator = 1001 has 4 bits, so its degree is \(r = 3\). Append \(r = 3\) zeros to the data before dividing.
Data = 110001011, Padded data = 110001011000 (12 bits)
Step 2: Perform modulo-2 (XOR) division of 110001011000 by 1001. XOR is applied whenever the leading bit of the current window is 1.
1100 XOR 1001 = 0101
bring next bit -> 1010, XOR 1001 = 0011
bring next bit -> 0111, leading bit 0, no XOR
bring next bit -> 1110, XOR 1001 = 0111
bring next bit -> 1111, XOR 1001 = 0110
bring next bit -> 1101, XOR 1001 = 0100
bring next bit -> 1000, XOR 1001 = 0001
bring next bit -> 0010, leading bit 0, no XOR
bring next bit -> 0100, leading bit 0, no XOR
Step 3: After all 12 bits are processed, the last 3 bits of the final result give the remainder: \(100\).
Step 4: This 3-bit remainder is appended to the data before transmission, giving the transmitted frame 110001011100.
Hence the correct remainder bit pattern is \(\boxed{100}\), which is option (D).
A schedule of three database transactions \(T_1\), \(T_2\), and \(T_3\) is shown. \(R_i(A)\) and \(W_i(A)\) denote read and write of data item A by transaction \(T_i\), \(i = 1, 2, 3\). The transaction \(T_1\) aborts at the end. Which other transaction(s) will be required to be rolled back?

The forwarding table of a router is shown below. A packet addressed to a destination address 200.150.68.118 arrives at the router. It will be forwarded to the interface with ID
Consider a file of size 4 million bytes being transferred between two hosts
connected via a path consisting of three consecutive links of bandwidth 2 Mbps,
500 kbps, and 1 Mbps, respectively. All processing delays and propagation delays
are negligible. Assume that there is no other background traffic over the path and
no other additional overhead to transfer the file.
Which one of the following is the total time (in seconds) to transfer the file?
Note: 1M=106, 1k=103
Consider the implementation of sliding window protocol over a lossless link, with a
window size of 𝑊 frames, where each frame is of size 1000 bits (including header).
The bandwidth of the link is 100 kbps (1k = 103) 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 𝑊 (in number of frames) required to
achieve 100% link utilization?
It is necessary to design a link-layer protocol between two hosts that are directly
connected over a lossless link of length 3000 kilometers. Assume that the link
bandwidth is 108 bits per second and that the propagation delay in the link is 5
nanoseconds per meter. Every transmitted data byte is assigned a unique sequence
number.
Let 𝑁 be the minimum number of bits needed for the sequence number field in the
protocol header such that
i.
the sequence numbers do not wrap around before 60 seconds, and
ii.
the maximum utilization of the link is achieved.
The value of 𝑁 is ______. (answer in integer)