These are the Networking questions and I need you to answer all of them!

1.If the bit string 10111111011110111110 is subjected to bit stuffing, what output string will be transmitted?

2. Compute the parity bit to add to the bit string 1001011 to detect single bit errors. Use even parity

3.Using the generator (divisor) polynomial x^4 + x + 1 (10011) for CRC, what codeword will be transmitted for the data M = x^7 + x^5 + x^3 + 1 (10101001)? Show workings.

4.What would happen if a system using the Stop-and-Wait ARQ Protocol has a time-out of 4 ms and a round trip delay of 6 ms? Given the round trip delay, is the selected time-out appropriate? To justify your answer, either describe what would happen or draw a diagram

5. A system uses the Stop-and-Wait ARQ Protocol. If each packet carries 1000 bits of data, how long does it take to send 1.5 million bits of data with a 1 Mbps transmission rate if the distance between the sender and receiver is 4000 Km and the propagation speed is 2x10⁸ m/s? Consider transmission and propagation delay, but ignore waiting, and processing delays. We assume no data or control frame is lost or damaged. Ignore the overhead due to the header and trailer.

6.Suppose nodes A and B are on the same 10 Mbps broadcast channel, and the propagation delay between the two nodes is 325 bit times. Suppose CSMA/CD and Ethernet packets are used for this broadcast channel. Suppose node A begins transmitting a frame and, before it finishes, node B begins transmitting a frame. Can A finish transmitting before it detects that B has transmitted? Why or why not? If the answer is yes, then A incorrectly believes that its frame was successfully transmitted without a collision. Hint: Suppose at time t = 0 bits, A begins transmitting a frame. In the worst case, A transmits a minimum-sized frame of 512 bit times. So A would finish transmitting the frame at t = 512 bit times. Thus, the answer is no, if Bs signal reaches A before bit time t = 512 bits. In the worst case, when does Bs signal reach A?