Scribd
Upload
9 views18 pages

End Semester Question Paper With Solution and Marking Scheme

This document outlines the structure and content of the end-semester examination for the Data Communication course, including various questions related to signal processing, error detection, network protocols, and queuing theory. The examination consists of five questions, each with multiple parts, requiring students to apply theoretical concepts and perform calculations. The document specifies the exam duration, maximum marks, and instructions for attempting the questions.

Uploaded by

longreanjali1
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
9 views18 pages

End Semester Question Paper With Solution and Marking Scheme

This document outlines the structure and content of the end-semester examination for the Data Communication course, including various questions related to signal processing, error detection, network protocols, and queuing theory. The examination consists of five questions, each with multiple parts, requiring students to apply theoretical concepts and perform calculations. The document specifies the exam duration, maximum marks, and instructions for attempting the questions.

Uploaded by

longreanjali1
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/ 18

Total no. of Pages…2. Roll no. ……………..

IVth Sem-B.Tech
END-SEMESTER EXAMINATION, MAY, 2022
Course Code- COECC12/ CAECC12/ CDECC12 Course Title- Data Communication
Time- 3 Hours Max. Marks- 40
Note: - Attempt any 2 (out of 3) parts in all the 5 questions. Missing data/ information (if any), may
be suitably assumed & mentioned in the answer.
1a A speech signal is varying from -5 to +5 volt which sampled at Nyquist rate. Each sample 4
is quantized and represented by 8 bits. Find the number of quantization levels required to
reduce the quantization noise by a factor of 4
1b Find out whether the signals s1(t), s2(t), and s3(t), shown in Figure.1. are forming 4
orthogonal set or not. Using the Gram-Schmidt orthogonalization procedure, find a set
of orthonormal basis functions to represent the three signals s1(t), s2(t), and s3(t) shown CO1
in Figure 1.
Figure 1

1c Coherent orthogonal binary FSK modulation is used to transmit two equi-probable 4


symbol waveforms 𝑆1 (𝑡) = 𝑎𝐶𝑜𝑠(2𝜋𝑓1 𝑡) and 𝑆2 (𝑡) = 𝑎𝐶𝑜𝑠(2𝜋𝑓2 𝑡) where, a = 4 mv.
𝑁
Assume an AWGN channel with two-sided noise power spectral density 2𝑜 =
0.5 × 10−12 𝑊/𝐻𝑧. Find the bit error rate for a data rate of 500 kbps. Use the following
data, if required.
Erfc(x) Value
√2 0.0455
2 0.0047
2√2 6.3342 × 10−5
4 1.5417 × 10−8
4√2 1.2442 × 10−15
2a Derive CRC code for the data 1010101100 using generator 10011. Also show the process
of syndrome computation at receiver assuming there are no errors. 4
CO2
2b Draw Manchester and Polar NRZ codes for sequence 101101. What are the advantages 4
of Manchester scheme over Polar NRZ ?
2c Explain ISO-OSI model and briefly state the role of each layer. 4
3a Consider sending voice from Host A to Host B over a packet-switched network (e.g., 4
Internet phone). Host A converts on-the-fly analog voice to a digital 64 kbps bit stream.
Host A then groups the bits into 48-byte packets. There is one link between host A and B;
its transmission rate is 1Mbps and its propagation delay is 2 msec. As soon as Host A
gathers a packet, it sends it to Host B. As soon as Host B receives an entire packet, it
coverts the packet's bits to an analog signal. How much time elapses from when a bit is
created (from the original analog signal at A) until a bit is decoded (as part of the analog CO3
signal at B)?
3b A 64-Kiloyte message is to be transmitted from source to destination as shown in Figure 4
2. The network limits packets to a maximum size of two kilobytes, and each packet has a
32-byte header. The transmission is assumed to be error free and Stop and Wait ARQ is
used in each transmission line. How long does it take to get the message from the source
to destination? Assume that the signal propagates at the speed of 2 × 105 km/second.
Assume that the ACK time and processing time are negligible.
Figure 2

3c Discuss HDLC frame format 4


4a Drive the routing table for the following networks using Dijkestra’s algorithm. Consider 4
‘S’ is originating node.

CO4

4b Derive the throughput in slotted ALOHA. Is it better than that of pure ALOHA? Explain. 4
4c Four stations A, B, C and D are using CSMA/CD protocol. Distance between A and B is
1000 meters, A and C is 2000 meters, A and D is 3000 meters. The stations are located
on a straight line and the data from A to D would pass through stations B and C during
transit. The signal propagates at a speed of 1x108 m/s and data rate Rb = 10 Mbps. Station
A starts transmitting at t1= 0 and station C starts transmitting at t2 = 15 micro-seconds.
Determine the number of bits transmitted by both the stations before collision is detected.
5a What do you understand by birth and death processes? Explain 4
5b In the M/M/1 queuing system, the arrival process is the Poison process with rate λ (mean 4
arrival rate) and the service time is exponentially distributed with parameter μ (mean
service time). Derive the expression for (a) Average number of customers in the system CO5
and (b) Average number of customers waiting in the queuing.

5c Customers arrive at a watch repair shop according to a Poisson process at a rate of 8 per 4
hour. The shop has one technician whose service time is an exponential random variable
and repairs watch at a rate of 9 per hour. Find the probability that the technician is not
free.

You might also like