A computer network uses polynomials over GF (2) for error checking wit – McqOptions

MCQOPTIONS

1.	A computer network uses polynomials over GF (2) for error checking with 8 bits as information bits and uses x3 +x +1 as the generator polynomial to generate the check bits. In this network. The message 01011011 is transmitted as
A.	01011011010
B.	01011011011
C.	01011011101
D.	01011011100
Answer» D. 01011011100

Discussion

No Comment Found

Related MCQs

Four bits are used for packed sequences numbering is a sliding window protocol used in a computer network. What is the maximum window size?
A and B are two stations on a Ethernet. Each has a steady queue of frames to send. Both A and B attempts to retransmit after a frame collide and A wins the first back off race. At the end of this successful transmission by A, both A and B attempt to transmit and collide. The probability that A wins the second back off race is
A IP packet has arrived in which the fragmentation offset value is 100, the value of HLEN is 5 and the value of total length field is 200. What is the number of the last byte ?
A network using CSMA / CD has a bandwidth 10 Mbps. If the maximum propagation time (including delays in the devices and ignoring the time needed to send a jamming signal) is 25.6 micro seconds. What is the minimum size of the frame?
Assume that a 12-bit Hamming codeword consisting of 8-bit data and 4 check bits is d8d7d6d5c8d4d3d2c4d1c2c1, where the data bits and the check bits are given in the following tables:Data bitsd8d7d6d5d4d3d2d1110x0101 c8c4c2c1Y010Which one of the following choices gives the correct values of x and y?
In CRC calculation if divisor is 1011, and dataword is 1001 what will be the CRC?
Bit stuffing refers to
In an Ethernet local area network, which one of the following statements is TRUE?
Maximum channel utilization in case of pure ALOHA is:
Maximum throughput of slotted ALOHA network is: