6.1 Suppose the information content of a packet is the bit pattern 1111 0011 1001 1100 and an even parity scheme is being used. What would the value of the field containing the parity bits be for the case of a two-dimensional parity scheme? Your answer should be such that a minimum-length checksum field is used.

6.2 Refer to the Cyclic Redundancy Check (CRC) codes discussed in the textbook and follow the conventions used in the textbook. Consider the 5-bit generator, G=10011, and suppose that D has the value 1010101011. What is the value of R? Show the process how you obtain the solution.

6.3 Consider two nodes A and B uses the slotted ALOHA protocol to contend for a channel. Suppose node pA and pB are A and Bs retransmission probabilities. Provide a formula for node As average throughput. What is the total efficiency of the protocol with these two nodes?

6.4 A disadvantage of the content of approach for LANs, such as CSMA/CD, is the capacity wasted due to multiple stations attempting to access the channel at the same time. Suppose that time is divided into discrete slots, with each of N stations attempting to transmit with probability p during each slot. What fraction of slots is wasted due to multiple simultaneous transmission attempts?

6.5 In CSMA/CD, after the 5th collision, what is the probability that a node chooses k=4? The result k=4 corresponds to a delay of how many seconds on a 10 Mbps Ethernet?

6.6 Why is an ARP query sent within a broadcast frame? Why is an ARP response sent within a frame with a specific destination MAC address?

6.7 Why the Ethernet is called a multiple access protocol? Why it is referred to as an unreliable and connectionless approach?