0% found this document useful (0 votes)
18 views2 pages

Tutorial 7 Qns

Uploaded by

zhangyiheng0810
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
18 views2 pages

Tutorial 7 Qns

Uploaded by

zhangyiheng0810
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

National University of Singapore

School of Computing

CS2105 Tutorial 7 Question paper

1. [KR, Chapter 6, R2] If all the links in the Internet were to provide reliable delivery service,
would the TCP reliable delivery service be redundant? Why or why not?

2. [KR, Chapter 6, P5/P6] Consider a 4-bit generator 𝐺𝐺 with value 1001, what is the CRC
checksum 𝑅𝑅 if data 𝐷𝐷 has the following value?
a) 11000111010

b) 01101010101

c) 11111010101

d) 10001100001

3. Consider the following two-dimensional parity matrix.


𝟎𝟎 𝟏𝟏 𝟎𝟎 𝟏𝟏
𝟏𝟏 𝟎𝟎 𝟏𝟏 𝟎𝟎
𝟎𝟎 𝟏𝟏 𝟎𝟎 𝟏𝟏
𝟏𝟏 𝟎𝟎 𝟏𝟏 𝟎𝟎
a) Give an example of a 1-bit error that can be detected and corrected.

b) Give an example of a 2-bits error that can be detected but cannot be corrected.

c) Give an example of a 4-bits error that cannot be detected.

Page 1 of 2
4. There are many nodes in a shared medium network and most nodes are likely to
transmit frequently. Which of the following multiple access protocol(s) is (are) suitable?
(1) TDMA; (2) CSMA; (3) Token passing.

5. Nodes 𝐴𝐴 and 𝐵𝐵 are accessing a shared medium using CSMA/CD, with propagation delay
of 245 bit times between them (i.e., propagation delay equals to the amount of time to
transmit 245 bits). Minimum frame size is 64 bytes. Suppose node 𝐴𝐴 begins transmitting
a frame at 𝑡𝑡 = 0 bit time. Before 𝐴𝐴 finishes, node 𝐵𝐵 begins transmitting a frame.
Assume no other nodes are active.
Write down your answers to the following 2 questions in the unit of bit time (time taken
to transmit one bit).
a) When is the latest time, by which 𝐵𝐵 can begin its transmission?
b) Suppose 𝐵𝐵 begin its transmission at the time computed in a), can 𝐴𝐴 detects that 𝐵𝐵
has transmitted before it finishes transmission?

Page 2 of 2

You might also like