problem 1: Compare checksums and CRCs as a means of detecting errors. Describe the tradeoffs between checksums and CRCs.
problem 2: find out the CRC for a given message (M) and a generator polynomial (P). M is 0111101 and P is 1011.
problem 3: Illustrate an error which can’t be detected with a checksum.
problem 4: An Ethernet frame has 8 bytes of 10101010b in the preamble. What is the main purpose of this preamble?
problem 5: What is the Local Area Network (LAN)? Be specific.
problem 6: What are the various types of media used in LANs?
problem 7: What is the key benefit of a physically direct-wired LAN? Describe how a star-wired LAN remedies these drawbacks.
problem 8: find out the minimum possible frame size for a CSMA/CD protocol given the given parameters.
Maximum medium span is 5000 meters (signal propagation is 5 nanoseconds per meter) and the data rate is 100-Mbps.
problem 9: find out the utilization (U) for a token ring LAN where all stations have frames queued to send given the following parameters. The ring length is 5000 meters (signal propagation is 5 nanoseconds per meter), number of stations is 25, mean frame length is 100 bytes, and the data rate is 100-Mbps. Would early token release increase the utilization? If yes, by how much?
problem 10: Give the forwarding and learning algorithm for the transparent bridging (TB). How are entries eliminated from tables?