Unformatted text preview: as far apart as possible? You can choose as many routers as you like. Problem 2 If you have a generator 4-bit: G = 1001 and a message: M(x) = 10101010, what is the value of R? What will a sender send over the wire? Problem 3 If a packet has the the bit pattern: 1010101010101011 and even parity is used. What is the value of the checksum eld when a 2-dimensional parity scheme is used? Your answer should be such that the minimum-length checksum eld is used. Problem 4 With CSMA/CD protocol, the adapter waits k 512 bit times after a collision, here K is drawn randomly. For K = 100, how long does the adapter wait until returning to Step 2 for a 10 Mbps Ethernet? For a 100 Mbps Ethernet? Page 1 of 1...
View Full Document
This note was uploaded on 04/28/2010 for the course CS 118 taught by Professor Chu during the Spring '08 term at UCLA.
- Spring '08