Assignment Set 1: Computer Networks

1. Consider the following table that shows an (n,k) block code:

(0 1 0)

(101010)

(1 1 0)

(110110)

(001)

(110001)

(1 0 1)

(101101)

(0 1 1)

(011011)

(1 1 1)

(000111)

a) What are n and k for this code?

b) Determine the Hamming distances for all of the Codewords in the table.
How many pairs of Codewords must be considered in this exercise? Can
you find a systematic way of performing this task?

c) What is the minimum Hamming distance?

d) How many errors can be detected by this coding scheme? How many
errors can be corrected with this coding scheme?
e) If I received the following Codeword: (100100) what Codeword and
corresponding Message do you think was sent originally? Explain the
reasoning for your answer. How many errors did you detect in this
codeword?
f) If I received the following Codeword: (101100) what Codeword and
corresponding Message do you think was sent originally? How does this
example differ from problem e) above?

2. If a binary signal is sent over a 3kHz bandwidth channel whose signal to noise ratio is
20dB, what is the maximum achievable data rate?
[Hint: Use Shannon's channel capacity theorem].
3. Ten signals, each requiring 4000 Hz, are multiplexed on to a single channel using FDM.
How much minimum bandwidth is required for the multiplexed channel? Assume that the
guard bands are 400 Hz wide.
4. The following data fragment occurs in the middle of a data stream for which the character
stuffing algorithm is used: A, B, ESC, C, ESC, FLAG, FLAG, D. Assume that FLAG is used
for framing and ESC is used to show that a particular FLAG is part of data not a framing
byte. What is the output after stuffing?
5. If the bit string 0111101111101111110 is subjected to bit stuffing, what is the output
string?

6. Can you think of any circumstances

preferable to error detection codes?

under which error correction

codes might be

7. One way of detecting errors is to transmit data as a block of n rows of k bits per row and
adding parity bits to each row and each column. Will this scheme detect all single errors?
Double errors? Triple errors?
8. Consider the delay of pure ALOHA versus slotted ALOHA at low load. Which one is less?
Explain your answer.
9. An IEEE 802.3 has only two ready stations. What is the probability that they will collide at
most three times before one succeeds?
(Ans.63/64)
10. A 3000 km long Tl trunk is used to transmit 64-byte frames using a Go-back-n protocol.
If the propagation speed is 6 seclkm, how many bits should the sequence number be? Tl
data rate is 1.544 Mbps.
11. Frames of 1000 bits are sent over a 1 Mbps satellite channel. Assume that the propagation
delay over a satellite channel is 270 ms. Acknowledgements are always piggybacked onto
data frames. The headers are very short. Three bit sequence numbers are used. What is the
maximum achievable channel utilisation for:
a) Stop-and-wait
b) Go-back-n
c) Selective repeat
12. Consider building a CSMAlCD network running at 1 Gbps over a lkm cable with no
repeaters. The signal speed (signal propagation time) in the cable is 200,000 km/sec. What is
the minimum frame size.