Data Communication

Complete the following problems from the end of Chapters 10 & 11 by the due date (Compare and contrast questions require you to explain the similarities and differences to get credit for your answer): Chapter 10 Q10-2 What is the definition of a linear block code? Q10-4 (2 parts in a codeword, we add two redundant bits to each 8-bit word. Find the number of a. valid codewords & b.invalid codewords Q10-6 If we want to be able to detect 2-bit errors, what should be the minimum Hamming distance? 010-8 In CRC, if the dataword is 5 bits and the codeword is 8 bits, how many Os need to be added to the dataword to make the dividend? What is the size of the remainder? What is the size of the divisor? Q10-10 In CRC, which of the following generators (divisors) guarantees the detection of an odd number of errors? a. 10111 b. 101101 c. 111 Q10-12 Assume we are sending data items of 16-bit length. If two data items are swapped during transmission, can the traditional checksum detect this error? Explain your answer. Chapter 11 Q11-2 Explain why flags are needed when we use variable-size frames. Q11-4 Compare and contrast byte-oriented and bit-oriented protocols. 011-6 In a byte-oriented protocol, should we first unstuff the extra bytes and then remove the flags or reverse the process? Q11-8 Compare and contrast flow control and error control. Q11-22 Compare and contrast HDLC with PPP