Data Communication Tutorial

Practice Questions and Answers

Ques-1. Consider HDLC protocol with the value of 8 – bit control field as 01100100. Find the
following: [2+2+2+2 Marks]
(i) Type of frame?
(ii) Sequence number of sender?
(iii) Sequence number of receiver?
(iv) Till which frame number receiver has received frames successfully?
Ans-1.
(i) Since first bit of control field is zero thus it is information frame
(ii) Sequence number of sender is 2nd, 3rd and 4th bit of control field which is 110 thus Seq # is 6
(iii) Sequence number of receiver is last three bits i.e. 6th, 7th and 8th bit thus Seq # is 4
(iv) Till frame 3 receiver has successfully received since receiver seq # is 4
Note:- Refer HDLC Frame Format
Ques-2. Five channels (A, B, C, D and E) are multiplexed using synchronous Time Division
Multiplexing. Given that each channel send 100 bytes/sec and byte-interleaving technique is used,
draw one complete frame that travels on the link. Also compute the size of the frame in bits.
Sol- One Frame

BA BB BC BD BE

BA → byte of user A, BB → byte of user B, BC → byte of user C and BD → byte of user D

Since byte-interleaving is used thus 1 byte from each channel is taken, thus total 5 bytes will be there
in one frame thus 5 * 8 bits = 40 bits is the size of frame in bits.
Ques-3. In a CRC error-detecting scheme, the generator polynomial is P(X) = X4 + X3 + 1.
Assume the codeword received at the receiver is 001110010011010. Show, how the receiver would
find whether the received codeword is erroneous or not.
Sol- Codeword polynomial is C(X) = X12 + X11 + X10 + X7 + X4 + X3 + X
On dividing C(X) / P(X) remainder turns out to be Zero thus there is not error in received codeword.

Ques-4. The following table illustrates the operation of an FHSS system

Time (in
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
Sec)
Input Data 0 1 1 1 1 1 1 0 0 0 1 0 0 1 1 1
Frequency f1 f3 f23 f22 f8 f10 f1 f3
 PN
0001 0110 0011 0001
Sequence

(i) What is the number of FSK frequencies?

(ii) What is the total number of possible carrier frequencies?
(iii) Is this a slow or fast FHSS system?
(iv) What is the value of Tc and Ts?
(i) Sol- Since 2 bits/signal element thus M is 22 = 4
(ii) Since k = 4 thus total number of possible carrier frequencies are 24 = 16
(iii) Slow FHSS since Tc>Ts
(iv) Ts = Symbol time = time duration of 2 bits = 2 Seconds. Tc = 2 * Ts = 2 * 2 = 4 Seconds.

Ques- 5. A communication system uses CDMA technique and the chip sequence of four stations
A, B, C and D are as follow:

CA: -1 -1 -1 +1 +1 -1 +1 +1
CB: -1 -1 +1 -1 +1 +1 +1 -1
CC: -1 +1 -1 +1 +1 +1 -1 -1
CD: -1 +1 -1 -1 -1 -1 +1 -1

Given that receiver gets following combined signal: -1 +1 -3 +1 -1 -3 +1 +1,

(i) Find, which stations out of the four stations transmitted?
(ii) Also find, the bit sent by those stations that transmitted signal.
Sol-
For each station we multiply the received chip sequence with their own chip sequence:

A
B
C
D

The result is that stations A, B and D transmitted whereas C was silent

Out of the stations that transmitted, station A and D sent 1 bit whereas B sent a 0 bit. However C did
not sent any bit.
Ques-6. Consider an audio signal with spectral components in the range 300 to 3400 Hz. Assume
that a sampling rate of 8000 samples per second is used to generate a PCM signal.
(i) For SNR = 40 dB, what are the number of uniform quantization levels needed?
(ii) What data rate is required?
(iii) What is the bit duration?

Sol- (SNR)db = 6.02 n + 1.76 = 40 dB

n = (40 – 1.76)/6.02 = 6.35
Rounded off, n = 7 bits
This yields 27 = 128 quantization levels

Part (b)
 Data Rate = sampling rate * number of bits used to encode each sample
= 8000 samples/s × 7 bits/sample = 56000 bps or 56 Kbps
Part (c)
Bit duration = 1/(56 *103) = 17.85 Micro Seconds

Ques-7. Suppose that a synchronous serial data transmission is clocked by two clocks (one at the
sender and one at the receiver) that each have a drift of 1 minute in one year. How long a sequence
of bits can be sent before possible clock drift could cause a problem? Assume that a bit waveform
will be good if it is sampled within 60% of its center and that the sender and receiver are
resynchronized at the beginning of each frame. Note that the transmission rate is not a factor, as
both the bit period and the absolute timing error decrease proportionately at higher transmission
rates.

Sol- In worst case conditions, the two clocks will drift in opposite directions. The
resultant accuracy is 2 minutes in 1 year or:
2/(60 * 24 * 365) = 0.0000038
The allowable error is 0.6
Therefore, number of bits is 0.6/0.0000038 = 15789.47 bits
Ques-8. If the packet size is 1 KB and propagation time is 15 msec, the channel capacity is 109 b/sec,
then find the transmission time and utilization of sender in stop and wait protocol.
Sol- Given-
• Packet size = 1 KB
• Propagation time (Tp) = 15 msec
• Channel capacity = Bandwidth (here) = 109 b/sec
NOTE-
• Generally, channel capacity is the total number of bits which a channel can hold. So, its unit is bits.
• But here, channel capacity is actually given as bandwidth because its unit is b/sec.

Calculating Transmission Delay-

Transmission delay (Tt)

= Packet size / Bandwidth
= 1 KB / 109 bits per sec
= 210 bits / 109 bits per sec
= 1.024 μsec

Calculating Value Of ‘a’-

a = Tp / Tt
a = 15 msec / 1.024 μsec
a = 15000 μsec / 1.024 μsec
a = 14648.46

Calculating Sender Utilization-

Sender Utilization or Efficiency (η)

= 1 / 1+2a
= 1 / (1 + 2 x 1468.46)
= 1 / 29297.92
= 0.0000341
= 0.00341 %
Ques- 8. Why Scrambling techniques are used? Explain following techniques in detail and draw
respective waveform for the given data sequences:
(i) B8ZS, for Data = 100000000
(ii) HDB3, for Data = 1100001000000000

Sol-

1. B8ZS(Bipolar with 8-zero substitution) – [1.5 Marks for explanation and 1.5 Marks
for Waveform]
This technique is similar to Bipolar AMI except when eight consecutive zero-level voltages
are encountered they are replaced by the sequence,”000VB0VB”.
Note –
• V(Violation), is a non-zero voltage which means signal have same polarity as the
previous non-zero voltage. Thus it is violation of general AMI technique.
• B(Bipolar), also non-zero voltage level which is in accordance with the AMI rule (i.e.,
opposite polarity from the previous non-zero voltage).
Example: Data = 100000000

Note – Both figures (left and right one) are correct, depending upon last non-zero voltage
signal of previous data sequence (i.e., sequence before current data sequence “100000000”).

2. HDB3 (High-density bipolar3-zero) – [1.5 Marks for explanation and 1.5 Marks for
Waveform]
In this technique four consecutive zero-level voltages are replaced with a sequence “000V” or
“B00V”.
Rules for using these sequences:
 • If the number of nonzero pulses after the last substitution is odd, the substitution pattern
will be “000V”, this helps maintaining total number of nonzero pulses even.
• If the number of nonzero pulses after the last substitution is even, the substitution
pattern will be “B00V”. Hence even number of nonzero pulses is maintained again.
Example: Data = 1100001000000000

Explanation – After representing first two 1’s of data we encounter four consecutive
zeros.Since our last substitutions were two 1’s(thus number of non-zero pulses is even).So,
we substitute four zeros with “B00V”.
Note – Zero non-zero pulses are also even.

Ques-9. In Go back 4, if every 6th packet that is being transmitted is lost and if total
number of packets to be sent is 10, then how many transmissions will be required?
Ans- Refer Tutorial-4.
Ques-10. Consider a network connecting two systems located 8000 km apart. The bandwidth of
the network is 500 x 106 bits per second. The propagation speed of the media is 4 x 106 meters
per second. It is needed to design a Go back N sliding window protocol for this network. The
average packet size is 107 bits. The network is to be used to its full capacity.
Ans- Refer tutorial-4.