01._June_2010 MCS-042.

pdf
02._Dec_2010 MCS-042.pdf
03._June_2011 MCS-042.pdf
05._June_2012 MCS-042.pdf
06._Dec_2012 MCS-042.pdf
07._June_2013 MCS-042.pdf
08._Dec_2013 MCS-042.pdf
09._June_2014 MCS-042.pdf
10._Dec_2014 MCS-042.pdf
11._June_2015 MCS-042.pdf
12._Dec_2015 MCS-042.pdf
13._June_2016 MCS-042.pdf
14._Dec_2016 MCS-042.pdf
15._June_2017 MCS-042.pdf
16._Dec_2017 MCS-042.pdf
17._June_2018 MCS-042.pdf
18._Dec_2018 MCS-042.pdf
19._June_2019 MCS-042.pdf
20._Dec_2019 MCS-042.pdf
21._June_2020 MCS-042.pdf
22._Dec_2020 MCS-42.pdf
23._June_2021 MCS-042.pdf
24._Dec_2021 MCS-042.pdf
25._June_2022 MCS-42.pdf
26._Dec_2022 MCS-42.pdf
No. of Printed Pages : 3 MCS-042

MCA (Revised)
(N) Term-End Examination
June, 2010

MCS-042 : DATA COMMUNICATION AND

COMPUTER NETWORKS

Time : 3 hours Maximum Marks : 100

Note : Question number / is compulsory. Attempt any three

questions from the rest.

1. (a) Explain different phases of Connection 6

Oriented Transmission.
Define cellular topology. Discuss 6
advantages and disadvantages of cellular
topology in wireless data transfer.
Discuss advantages and disadvantages of 5
-flooding routing protocols.
A network with bandwidth of 10 Mbps can 5
pass only an average of 12000 frames/min
with each frame carrying an average of
10000 bits. What is throughput of this
network ?
Illustrate ideal, achievable, =congested and 5
congested network characteristics using
appropriate diagram.

MCS-042 1 P.T.O.
 Derive the expression to establish the
relation between S and G in Pure Aloha ?
Explain and illustrate Sliding Window 8
Protocol.

2. How is network congestion controlled using 7

slow start in TCP ?
Describe how is MACAW an improvement 6
over MACA ?
(c) What is the purpose of PCM ? Explain 7
different components of PCM encoder.

3. Why a fragmentation is needed in IP 7

datagram ? How are fragmentation and
reassembly implemented in IP ?
What are features of tocken bucket traffic 6
shaper ?
(c) Compare Dijkstra and Bellman Ford 7
algorithms for finding the shortest path.

4. How is OSPF implemented in IP network. 7

Illustrate.
Compare FDM and TDM. 6
(c) With the help of a suitable diagram explain 7
Go Back N and compare it with selective
repeat.

MCS-042 2
5. (a) With the help of suitable diagram, explain 7
three way handshake mechanism.

Discuss different component of Network 7

File System protocol.

What are the benefits of using digital 6

certificate ?

MCS-042 3
 No. of Printed Pages : 3 MCS-042

MCA (Revised)
cV
op Term-End Examination
tr) June, 2011
C
MCS-042 : DATA COMMUNICATION AND
COMPUTER NETWORKS

Time : 3 hours Maximum Marks : 100

Note : Question number one is compulsory. Attempt any three

questions from the rest.

1. (a) If a binary signal is sent over 3 MHz and 4

whose signal to noise ratio is 30 dB, what is
the maximum achievable channel capacity ?
(b) Assume a data stream is made of "000000" 6
encode this stream using the following
encoding schemes (Do any three).
(i) Manchester
(ii) Differential Manchester
UNI polar
(iv) Polar NR Z-I
(v) RZ
(c) Construct the Hamming code for the bit 5
sequences 10011010.

MCS-042 1 P.T.O.
 (d) Consider the following network with the 10
indicated link cost. Use .Dijkstra's shortest
path algorithm to find the shortest path
from source node A to all other nodes.

(e) Explain the hidden station and exposed 5

station problems with illustration.
(f) How does TCP's congestion control 5
mechanism work ? Illustrate through an
example.
(g) Explain encryption and decryption process 5
in Triple DES.

2. (a) What is Infrared ? Describe its characteristics 5

and its two applications.
(b) Compare byte stuffing and bit stuffing. 3+2
Also, "Bit Stuff" the following data frame.
000111111100110001111111100
(c) What is count to infinity problem in distance 5
vector routing algorithm ?
(d) What happens if one of the stations is 5
unplugged in Bus topology and ring
topology ?

MCS-042 2
3. (a) How does token bucket traffic shaper work ? 5
Explain through a diagram.
(b) What are the reasons for having a minimum 5
length frame in ethernet ? Explain.
(c) What kinds of applications are run over 5
UDP ? Justify.
(d) What is the important aspect that establishes 5
trust in digital signature ?

4. (a) What are the design foals of SSL 3.0 ? 5

(b) Explain the following TCP/IP header fields 10
• Source port
• Urgent pointer
• Sequence Number
• Type of service
• Fragment offset
(c) What is basic idea behind CIDR (classless 5
interdomain routing) ? Explain through an
example.

5. (a) Explain the following concepts with respect 5

to multicasting :
• Group management
• Pruning
(b) What are the advantages of fragmentation 5
of frames is IEEE 802.11 ? Discuss.
(c) What are the problems of synchronous 5
TDM ? How does statistical TDM resolve
the problem ?
(d) What are the differences between client/ 5
server and peer to peer architecture ?
Discuss.

MCS-042 3
 No. of Printed Pages : 2 MCS-042

MCA (Revised)

("N1 Term-End Examination

0
T-4 June, 2012

MCS-042 : DATA COMMUNICATION AND

COMPUTER NETWORKS

Time : 3 hours Maximum Marks : 100

Note : Question number one is compulsory. Attempt any three
questions from the rest.

1 (a) Obtain throughput for Aloha and slotted 10

Aloha Protocol and explain.
(b) What is the need of multiplexing ? Explain 5
FDM and TDM with the help of suitable
diagram.
(c) How does 802.11 deal with the problem of 10
noisy channel ? Explain.
(d) Define pipelining. Explain it in Go Back N 5
and Selective repeat with help of
appropriate diagram.
(e) Draw the Manchester and differentiate 5
Manchester encoding for the following
bitstream.
11110000
(f) Why 5 packet fragmentation needed in IP ?
Explain.

MCS-042 1 P.T.O.
2. (a) Explain the problems of hidden static in 10
exposed static in a wireless LAN with
illustration.
(b) Differentiate between subnet and classless 5
addressing.
(c) Explain the main objectives of the upward 5
multiplexing and explain how it relates to
the performance of a network.

3. (a) What is silly wisdom syndrome ? What is 7

Clark's solution for it ?
(b) Differentiate between optical fibre and
copper wire.
(c) Explain the operation of Diffie - Hellman 7
method through an example.

4. (a) Explain the operation of congestion control 7

algorithm in TCP.
(b) What is the reason for minimum frame 6
length in IEEE802-3 ?
(c) Define Digital Signature and explain its benefits. 7

5. (a) Explain the operation of Reverse path 5

forwarding algorithm. What is the purpose
of the algorithm ?
(b) What do you understand by traffic shaping ?
How is it implemented through leaky bucket
traffic shaper and token bucket traffic
shaper ? Show it through Illustrations. 5+5+5

MCS-042 2
 No. of Printed Pages : 3 MCS-042

MCA (Revised)
ir; Term-End Examination
-714
December, 2012
00
0 MCS-042 : DATA COMMUNICATION AND
COMPUTER NETWORKS

Time : 3 hours Maximum Marks : 100

Note : Question number 1 is compulsory. Attempt any three
questions from the rest.

1. (a) Differentiate between Parallel and Serial 5

Transmission.

(b) What is the essence of DNS (Domain Name 5

system) ? How does it map to IP address ?

(c) What is count to infinity problem in distance 6

vector routing protocol ? How does it
happen ? Explain with an example.

(d) Explain the need of bit stuffing in data link 4

protocols. Also give a example.

(e) What are the problems with 2-way 5

hardshake in a connection establishment
and connection termination ? How does
3-way hardshake resolve them ?

MCS-042 1 P.T.O.
 (f) An analog signal is limited to 4 kHz. It is 5
converted to PCM signal using 8 bits/
sample. When is to bit rate on the
transmission line ?
(g) Explain the following terms with respect to 10
TCP :
(i) Stream data transfer
(ii) Reliable service
(iii) Window size
(iv) Vrgar pointer
(v) check sh

2. (a) What is the purpose of the following : 5

IP datagram format fields;
(i) Fragmen offset
(ii) Time to live.
(b) Define multiplexing. Differentiate between 5
upward and downward multiplexing.
(c) Differentiate between leakey Bucket and 10
Token Bucket traffic shaper. Where are they
used ?
3. (a) Compare Virtual Circuit and Datagram 6
Subnet w.r.t. following :
(i) Router memory space and bandwidth
(ii) Setup time Vs address passing time
(iii) Table space required in router memory
(iv) Qos
(v) Vulnerability
(vi) Traffic Balance

MCS-042 2
 (b) Describe the benefits of Secure Socket Layer. 4

(c) How does ADSL enable high speed data 4

access through voice lines are so slow ?
(d) What is virtual circuit ? How does it differ
from circuit smoothing ?

4. (a) How does return to zero encoding mechanism 6

ensure synchronization irrespective of the
data that is transmitted ? What is its
disadvantage ?
(b) Illustrate frame format of Ethernet. 7
(c) Explain RSA public key algorithm with 7
example.

5. (a) Explain the different services of PGP (Pretty 5

Good Privacy).
(b) State Nagle's algorithm and explain how 10
does it reduce the wastage of bandwith.
(c) Differentiate between Radio 5
communication and Satellite
communication.

MCS-042 3
 No. of Printed Pages : 3 MCS-042

MCA (Revised)
Term-End Examination
June, 2013
1-r)
O MCS-042 : DATA COMMUNICATION AND
COMPUTER NETWORKS
Time : 3 hours Maximum Marks : 100
Note : Question number one is compulsory. Attempt any three
questions from the rest.

1. (a) Draw Ethernet frame format and explain 10

each field of the format.
(b) What are different class of IP address ? 5
Explain through examples.
(c) What is the maximum capacity of a noiseless 5
channel whose bandwidth is 200 kHz and
in which the valve of the data transmitted
may be indicated by one of 64 different
amplitudes ?
(d) Consider the following network with the 10
indicated link cost. Use Dijkstra's shortest
path algorithm to find the shortest path
from source to node A to all other nodes.

MCS-042 1 P.T.O.
 (e) Define Data rate and. Signal rate. Write the 5
expression to establish relation between
them.

(f) Derive the expression to establish relation 5

between S and G in pure Aloho.

2. (a) Describe major problems by which 7

transmission line suffer ?

(b) Explain the advantages of having small 7

fixed size cells in ATM.

(c) Differentiate between Congestion Control 6

and Flow Control.

3. (a) Define link state packet. Explain how link 10

state Routing operates ?

(b) Explain working of wireless LAN. 5

(c) Differentiate between Star and Tree 5
Topology.

4. (a) Explain IP address classes and list their 7

purpose.

(b) How MACA W is different from MAC A ? 6

(c) Describe Exterior Gateway Routing 7
protocol ?

MCS-042 2
5. (a) Draw TCP header format and discuss its 7
each field.
(b) Explain Dijkastra's algorithm for Shortest 7
Path Routing with the help of an example.
(c) Describe Asynchronous Communication 6
and write its advantages and
disadvantages.

MCS-042 3
No. of Printed Pages : 2 MCS-042

MCA (Revised)
Term-End Examination
December, 2013
MCS-042 : DATA COMMUNICATION AND
COMPUTER NETWORKS
Time : 3 hours Maximum Marks : 100
Note : Question number one is compulsory. Attempt any three
questions from the rest.

1. (a) Illustrate CSMA/CD Protocol. Also explain .10

Backoff algorithm.
(b) Explain the concept of bit stuffing through 5
an appropriate example.
(c) If a binary signal is sent over 30 MHz and 5
whose signal to noise ratio is 30dB, what is
the maximum achievable channel capacity.
(d) Explain encryption and decryption process 5
in Triple DES.
(e) Define Multiplexing. Explain TDM 5
(synchronous and statistical both) in detail
with the help of suitable diagram.
(f) Illustrate constellation diagram of 8 - PSK 5
and 8 QAM.
(g) Draw polar NRZ - L and NRZ - I encoding 5
for the following bit stream.
01001110
2. (a) Explain various steps in process of Analog 7
to Digital Modulation.
(b) Define CRC. Explain its purpose with 7
suitable example.
(c) Differentiate between Adaptive and Non 6
Adaptive Routing.

MCS-042 1 P.T.O.
3. (a) Describe Interior Gateway Routing Protocol. 7
(b) Explain structure of Optical Fiber and also 7
write its advantages and disadvantages.
(c) Discuss the process of Local Procedure Call 6
and Remote Procedure Call.

4. (a) Explain operation of Bridges in different 7

LAN environment ?
(b) Define broadcasting. Explain various 7
methods for broadcasting.
(c) Differentiate between Radio 6
Communication and Satellite
Communication.

5. (a) Explain RSA algorithm with the help of an 7

example.
(b) Describe Framing. Explain different 7
methods of framing.
(c) Describe Isochronous Communication and 6
Write its advantages and disadvantages.

MCS-042 2
 No. of Printed Pages : 3 MCS-042
MCA (Revised)
Term-End Examination
"71.4 June, 2014
MCS-042 : DATA COMMUNICATION AND
COMPUTER NETWORKS
Time : 3 hours Maximum Marks : 100
Note : Question number 1 is compulsory. Attempt any three
questions from the rest.

1. (a) Sketch the Manchester, Differential 6

Manchester, NRZ-L and NRZ-I for the
following bit stream :
01001110001
(b) Explain token bucket algorithm. Discuss its 8
advantages and limitations with leaky
bucket algorithm.
(c) List out the functions provided by 6
presentation, session and transport layers
of OSI model.
(d) Explain the fundamental operation of stop 4
and wait protocol in Data Link Layer.
(e) Compare point to point channels with
broadcast channels along with suitable
examples.
(f) Explain the Diffie - Hellman method for key 7
exchange using an example.
(g) Explain Simplex, Half - duplex and Full 3
duplex mode of communication.

MCS-042 1 P.T.O.
2. (a) Draw the format of IP Header and explain 10
the significance of each field.
(b) Explain the following using an example for 10
each :
(i) Sliding window protocol using
Selective Repeat.
Sliding window protocol using
Go Back N.

3. (a) Discuss the functions and services of sub 10

layers of ATM adaptation layers (AAL).
(b) Consider the following network with the 10
indicated link cost. Use Dijkstra's shortest
path algorithm to compute the shortest
paths from A to C and F.

4. (a) How information of complete path from 10

source to destination instead of delay
(number of hops), helps in solving count -
to - infinity problem of distance vector
routing ? Explain with an example.

MCS-042 2
 (b) Find CRC for Data polynomial x4 + x2 + x +1 5
with generator polynomial x3 +1.
(c) Explain the working of CSMA/CD. 5

5. Write short notes on the following : 20

(a) RSA algorithm
(b) Hamming Code
(c) Optical Fiber
(d) Pure ALOHA

MCS-042 3
 No. of Printed Pages : 3 MCS-042
MCA (Revised)
FIFF:in4 Term-End Examination
December, 2014

MCS-042 : DATA COMMUNICATION AND

COMPUTER NETWORKS
Time : 3 hours Maximum Marks : 100
Note : Question number 1 is compulsory. Attempt any
three questions from the rest.

1. (a) To send 3 bits data at a time, at a bit rate

of 3 Mbps, if the carrier frequency is
10 MHz, find the number of levels, the
baud rate and the bandwidth. 5
(b) A pure ALOHA network transmits 200 bits
frames on a shared channel of 200 Kbps.
What is the requirement to make this
frame collision free ? 5
(c) Data link protocol almost always puts CRC
in trailer rather than in a header. Why ? 5
(d) Explain token bucket algorithm and
compare its performance against the leaky
bucket algorithm. 10
(e) What is Silly Window Syndrome ? How is
this problem solved in TCP ? 5
(f) Discuss how the message is transmitted in
telephone networks. Compare and contrast
circuit switching, packet switching and
message switching. 10
MCS-042 1 P.T.O.
2. (a) Consider the following network with the
indicated link cost. Using Bellman-Ford
Algorithm, find the shortest path from
source node A to all nodes. 10

(b) What is piggybacking ? Explain

piggybacking process and where it is used,
with an example and an appropriate
diagram. 10

3. (a) Differentiate between 'Client/Server' and

`Peer to Peer' architecture. 5
(b) What is digital signature ? What are the
benefits of using digital signature ? 5
(c) Enlist the features provided by SSL 3.0. 5
(d) Draw constellation pattern for 4-QAM. 5

4. (a) Discuss the process of link state routing.

Explain how it overcomes the problem of
count-to-infinity for distance vector routing. 10
(b) Draw TCP Header format. Explain the use
of TCP header fields. 10

MCS-042 2
5. Write short notes on the following : 4x5=20
(a) DES
(b) FDDI
(c) IEEE 802.3
(d) LAN, MAN and WAN

MCS-042 3 10,000
No. of Printed Pages : 2 I MCS 042 -

MCA (Revised)
Term-End Examination
June. 2015 IT6117
MCS-042 : DATA COMMUNICATION AND
COMPUTER NETWORKS

Time : 3 hours Maximum Marks : 100

Note : Question number 1 is compulsory. Attempt any
three questions from the rest.

1. (a) Consider the following network with the

indicated link cost. Use Dijkstra's shortest
path algorithm to compute the shortest
path from the source node A to the
destination node D. 10

(b) In a Slotted Aloha system, it is observed

that the channel is empty for 10% of the
time. What is its throughput ? 10
(c) Explain the Diffie-Hellman method for key
exchange, through an example. 10
MCS-042 1 P.T.O.
 (d) Explain why Sliding Window protocol is
useful in satellite links. 5
(e) In ISO-OSI reference model, what are the
functions of transport layer ? 5

2. (a) Explain the frame format in Ethernet

protocol. Why is minimum frame length
specified in this protocol ? 10
(b) Compare byte stuffing and bit stuffing.
Consider the following data frame. Bit stuff
it so that the data does not contain the flag
0111 1110. 10
0001111110100110001111111100
3. (a) Explain the slow-start procedure in TCP.
How is threshold set in this ? 10
(b) How is hidden station problem solved in
wireless networks ? What is the use of NAV
in IEEE 802.11 protocol ? 10
4. (a) Explain the operation of Reverse path
forwarding algorithm. What is the purpose
of the algorithm ? 10
(b) Explain RSA public key algorithm with an
example. 10
5. (a) Draw TCP header format and discuss the
use of different flags. 10
(b) Find CRC for data polynomial
x4 + x2 + x + 1 with generator polynomial
x3 + 1. 10

MCS-042 2 8,000
No. of Printed Pages : 2 I MCS-042
MCA (Revised)
Term-End Examination
December, 2015

MCS-042 : DATA COMMUNICATION AND

COMPUTER NETWORKS
Time : 3 hours Maximum Marks : 100
Note : Question no. 1 is compulsory. Attempt any three
questions from the rest.

1. (a) Consider the following network with the

indicated link cost. Use Dijkstra's shortest
path algorithm to compute the shortest
path from source node 1 to the network
node 5. 10

(b) Explain the RSA algorithm using an

example. 10
(c) What are the functions of Data Link
Layer ? How is error correction carried out
at this layer ? 10
MCS-042 1 P.T.O.
 (d) Illustrate congestion detection and
congestion avoidance phases in TCP. 5
(e) Why are RTS and CTS used in IEEE
802.11 protocol ? 5

2. (a) What is the purpose of PCM ? Explain the

different components of PCM encoder. How
are quantization levels chosen in PCM ? 10

(b) Why is sliding window protocol useful in

satellite links ? Illustrate GO-BACK-N and
SELECTIVE REPEAT protocols. 10

3. (a) How does token bucket traffic shaper

work ? Explain with the help of a diagram. 10
(b) Discuss the addressing classes in IP. Why
is subnet masking used in IP addressing ? 10

4. (a) Derive an expression for throughput in

Slotted Aloha. Why is this system
unstable ? 10
(b) What is Nagle's algorithm ? How does it
reduce the wastage of bandwidth ? 10

5. (a) Why is fragmentation used in IP ?

Illustrate OSPF. 10
(b) How is connection established in TCP ?
Illustrate multiplexing in TCP. 10

MCS-042 2 10,000
 No. of Printed Pages : 3
I MCS-042 I
MCA (Revised)
Term-End Examination
e) June, 2016
..111=1 -.4

MCS-042 : DATA COMMUNICATION AND

COMPUTER NETWORKS
Time : 3 hours Maximum Marks : 100
Note : Question no. 1 is compulsory. Attempt any three
questions from the rest.

1. (a) A system has an n-layer protocol hierarchy.

Application generates messages of length
M bytes. At each of the layers, an h-byte
header is added. What fraction of the
network bandwidth is filled with headers ? 10
(b) Draw Manchester and Differential
Manchester encoding for the following bit
stream : 5
01001100
(c) How do connection oriented services run
over connectionless services in TCP/IP
reference model ?
(d) Find the CRC for the data polynomial
x4 + x2 + x + 1, where the generator
polynomial is x3 + 1. 5
(e) Explain the concept of piggybacking in
detail. 3

MCS-042 1 P.T.O.
 (f) Why should the leaky bucket algorithm
allow just one packet per tick, independent
of the size of the packet ? 7

(g) What is cryptography ? Explain symmetric

key cryptography in detail.

2. (a) Explain various modes of data

transmission in detail.
(b) How does slotted Aloha improve the
performance of a system over pure Aloha ?
Also derive the expression for throughput
computation. 9

(c) What is the difference between congestion

control and flow control ? 5

. (a) Explain DES algorithm. 10

(b) What is a digital signature ? What are the
benefits of using digital signatures ? 5
(c) How is flow control at transport layer
different from flow control at data link
layer ? 5

4. (a) Explain the functioning of sliding window

protocol in detail. 10
(b) Explain the concept of frequency division
multiplexing in detail. 5
(c) What are the features of a transparent
bridge ? 5

MCS-042 2
5. (a) What do you mean by window management
in case of TCP protocol ? How is TCP
window management used for congestion
control ? 10

(b) Compare virtual circuit and datagram

subnet. 5

(c) Differentiate between SSL and TLS. 5

MCS-042 3 7,500
No. of Printed Pages : 3
mcs- 0421
MCA (Revised)
Term-End Examination
0027_ December, 2016

MCS-042 : DATA COMMUNICATION AND

COMPUTER NETWORKS

Time : 3 hours Maximum Marks : 100

Note : Question no. 1 is compulsory. Attempt any three

questions from the rest.

1. (a) Explain various types of analog-to-analog

modulation techniques with suitable
examples. 10

(b) If a binary signal is sent over a 5-kHz

channel whose signal to noise ratio is
20 dB, what is the maximum achievable
data rate ? 5

(c) Differentiate between stream ciphers and

block ciphers with the help of examples.

(d) Draw unipolar encoding and RZ encoding

for the following bit stream :
01001100

MCS-042 1 P.T.O.
 (e) What is sliding window protocol ? How is
the size of window decided ? 10

(f) Consider a signal where the amplitude

varies from + 6.4 V to — 6.4 V. If we want
to quantise it into 64 levels, what would be
the quantised value corresponding to the
signals of — 3.6 V and + 0.88 V. 5

2. (a) Explain Rijndael cipher in detail. 10

(b) Explain CFB (Cipher Feedback) and OFB
(Output Feedback) in detail. 10

3. (a) Explain the concept of selective repeat

ARQ. 7
(b) Describe link state routing protocol. 7

(c) Describe the concept of Remote Procedure

Call (RPC) in detail. 6

4. (a) What is Binary Exponential Back-off

algorithm ? How is it used in CSMA/CD ? 10
(b) State the problems found in distance vector
routing. 5
(c) What is the difference between frequency
division multiplexing and time division
multiplexing ? 5

MCS-042 2
5. (a) Explain the working of MACAW protocol. 7

(b) Explain how Radio communication differs

from Satellite communication. 6

(c) What do you mean by Quality of Service ? 7

MCS-042 3 7,500
 No. of Printed Pages : 3 MCS-042

MCA (Revised)

Term-End Examination

0 June, 2017

MCS-042: DATA COMMUNICATION AND

COMPUTER NETWORKS

Time : 3 hours Maximum Marks : 100

Note : Question no. 1 is compulsory. Attempt any three

questions from the rest.

1. (a) Discuss and illustrate flow control

mechanisms in Data Link Layer and .

Transport Layer. 10

(b) Explain the various steps in conversion of

an analog signal to a digital signal. What is
the basis of choice of number of
quantization levels ? 10

(c) Why is CSMA/CD used in Wireless LAN ?

What can be the problem if CSMA/CD is
used in the above ? 10

MCS-042 1 P.T.O.
 (d) Explain the functionality of the upper four
layers of the OSI model. 5

(e) Determine the maximum bit rate for a

channel having bandwidth equal
1600 Hz, if S/N ratio is 0 dB. 5

2. (a) What are the limitations of circuit

switching ? How are these overcome in
packet switching ? 10

(b) Why are pipeline protocols used in data

link layer ? Illustrate Go back N with the
help of an example. 10

3. (a) Explain CRC error detection method. Find

whether there are errors in the received
codeword 1100100101011, when the
polynomial is 10101 ? 10

(b) In a slotted system, the average load is

increased from 1 packet per packet time to
1.5 packets per packet time. What is the
percentage change in the throughput ? 10

MCS-042 2
 (a) How does Link State Routing differ from
Distance Vector Routing ? Give the
different steps in implementing Distance
Vector Routing protocol. 10

(b) In a classful addressing, draw a block

diagram to show the address space division
into various classes. A router outside the
organization receives a packet with
destination address 190.240.7.91. Describe
how it finds the network address to route
the packet. 10

5. (a) Explain Nagle's algorithm. What is its

significance ? Give a scenario where this
algorithm is not applicable. 10

(b) Explain the various steps in implementing

DES using an appropriate diagram. Why is
triple DES used ? 10

MCS-042 3 4,500
No. of Printed Pages : 3 I MCS-042
MCA (Revised)
Term-End Examination
December, 2017
f:3S.41:3

MCS-042 : DATA COMMUNICATION AND

COMPUTER NETWORKS

Time : 3 hours Maximum Marks : 100

Note : Question no. 1 is compulsory. Attempt any three

questions from the rest.

1. (a) How are headers and trailers attached when

the data flows from the top layer to the
bottom layer in the OSI reference model ? 10

(b) What are the situations when UDP is

preferred over TCP ? 5

(c) What are the various steps in the

Bellman-Ford algorithm ? 10

(d)What are the limitations of MACA ? How

are these limitations overcome in MACAW ?
Explain. 10
MCS-042 1 P.T.O.
 (e) Convert the IP address whose hexadecimal
representation is C22F15B2 to a dotted
decimal notation.

2. (a) What are the various topologies used in

LAN implementation ? Illustrate. "Token
rings are better than Ethernet from the
delay point of view." Justify or refute the
above. 10

(b) A channel has a bit rate of 4 kbps and

propagation delay of 20 msec. For what
range of frame sizes does Stop and Wait
give an efficiency of at least 50 percent ? 10

3. (a) What is 3-way handshake protocol in

transport layer ? How does it handle lost
acknowledgements and delayed
acknowledgements ? Illustrate and discuss. 10

(b) How is congestion controlled in TCP using

the Slow Start algorithm ? Clearly show
the window adjustment. 10

MCS-042 2
4. (a) Explain the count to infinity problem in
implementing the Bellman-Ford algorithm.
How is the above problem overcome in
link-state routing problem ? 10

(b) Describe Leaky Bucket and Token Bucket

traffic shaper algorithms. 10

5. (a) Explain RSA algorithm with the help of

suitable example. 10

(b) What is the Kerberos authentication

mechanism ? How is it implemented ?

MCS-042 3 6,500
No. of Printed Pages : 2 I MCS-042
MCA (Revised)
Term-End Examination
June, 2018

MCS-042 : DATA COMMUNICATION AND

COMPUTER NETWORKS

Time : 3 hours Maximum Marks : 100

Note : Question no. 1 is compulsory. Attempt any three

questions from the rest.

1. (a) Explain the DES algorithm with the help of

a suitable example. 10
(b) What is the need of,hierarchical routing ?
Explain it with an example. 10
(c) Explain Leaky Bucket and Token Bucket
traffic shaping mechanisms and compare
them. 10
(d) A high quality audio signal is limited to
10 kHz. It is to be transmitted using a 7-bit
code. Calculate the required bit rate which
needs to be supported by the channel. 5
(e) Enlist any two core protocols of Internet
layer in TCP/IP reference model. Describe
the functionality of these two protocols. 5
MCS-042 1 P.T.O.
2. (a) Explain the concepts of Local Procedure
Call (LPC) and Remote Procedure Call
(RPC) using suitable examples and
diagrams. Why is RPC useful in
programming ? 10
(b) State the need of broadcast routing.
Discuss various broadcast routing
procedures. Give an example of multicast
routing. 10

3. (a) A system uses Slotted ALOHA protocol. In

an observation interval, the channel is busy
for 90% of the time. Calculate the system
throughput. 10
(b) Explain connection establishment and
connection termination processes in TCP
using three-way handshaking mechanism. 10

4. (a) Why is Stop-and-Wait protocol inefficient

for satellite links ? How is this inefficiency
overcome in Sliding Window protocol ?
Explain. 10
(b) Explain the collision occurrences in
Ethernet. How is backoff algorithm
implemented in Ethernet ? 10

5. (a) Illustrate Count-to-Infinity problem. How

can it be resolved ? 10
(b) Explain the functionalities of SSL. Discuss
the merits of SSL. 10

MCS-042 2 7,000
No. of Printed Pages : 3 I MCS-042 I
MCA (Revised)
Term-End Examination

CiCiCrtaZ, December, 2018

MCS-042 : DATA COMMUNICATION AND

COMPUTER NETWORKS

Time : 3 hours Maximum Marks : 100

Note : Question no. 1 is compulsory. Attempt any three

questions from the rest.

1. (a) State Nagle's algorithm and explain how

does it reduce the wastage of bandwidth. 5
(b) Consider the following network. Apply
Dijkstra's algorithm to compute the
shortest path from A to all the network
nodes. Show all the intermediate
calculations. What are the drawbacks of
this algorithm ? 10

15

MCS-042 P.T.O.
 (c) Draw NRZ-I and Manchester encoding for
0100110 bit stream. 5

(d) Obtain expression for throughput in

ALOHA and Slotted ALOHA. How does the
Slotted ALOHA improve the performance
over Pure ALOHA ? 10

(e) Differentiate between Leaky bucket and

Token bucket. 5
(f) Find the CRC for data polynomial
x4 + x2 + x + 1 where generator polynomial
is x3 + 1. 5

2. (a) Explain DES algorithm with an example. 10

(b) Differentiate between synchronous,

asynchronous and isochronous
transmission. 6

(c) What is the reason for a minimum frame

length in IEEE 802.11 ? 4

3. (a) Explain the purpose of the following fields

of the TCP header format : 10
(i) Urgent pointer
Syn
(iii) Window
(iv) RST

MCS-042 2
 (b) Explain the concept of Sliding Window
protocol with the help of a diagram. Also
explain how does Sliding Window protocol
Go-Back-N increase the utilization of
bandwidth compared to Stop and Wait
protocol.

(c) Differentiate between Symmetric key

cryptography and Asymmetric key
cryptography.

. (a) Explain hidden station and exposed station

problems in wireless LAN protocols with
the help of examples.

(b) Why is packet fragmentation needed in

IP ? 5

(c) Discuss ethernet frame format (802.3). 10

5. (a) Explain Diffie-Hellman algorithm with the

help of an example. 10

(b) Discuss the features of Twisted pair cable,

Baseband co-axial cable, Broadband
co-axial cable and Optical fiber. 10

MCS-042 3 6,500
 100022

No. of Printed Pages : 4 MCS-042

M. C. A. (Revised)
Term-End Examination
June, 2019
MCS-042 : DATA COMMUNICATION AND
COMPUTER NETWORKS
Time : 3 Hours Maximum Marks : 100
Note : Question No. 1 is compulsory. Answer any
three questions from the rest.

1. (a) How does 802.11 deal with the problem of

a noisy channel ? Explain with an example.
10
(b) Discuss the two advantages of QAM over
FM and AM. 5
(c) Describe Class A, Class B, Class C, Class D
and Class E IP addresses. 5
(d) What is count-to infinity problem ? Explain
through an example. 5
(e) Differentiate between stream ciphers and
block ciphers with the help of examples. 5

(A-6) P. T. O.
 [2] MCS-042

(f) Consider a signal where the amplitude

varies between + 3.2 V to — 3.2 V. If we
want to quantize it into 64 levels, what
would be the quantized value
corresponding to signals of 3.6 V and
+ 0.88 V? 5

(g) Draw RZ and Differential Manchester

encoding for the following bit stream : 5
01001100.

2. (a) How does TCP's congestion control

algorithm work ? Explain with the help of
an illustration. 10
(b) Explain Selective Repeat ARQ through an
illustration. 5
(c) What is silly window syndrome ? What is
Clark's solution for it ? 5

3. (a) List various types of cryptographic

techniques. Explain RSA algorithm with
the help of an example. 5

(b) Why CSMA/CD cannot be used in wireless

LAN environment ? Discuss. 5
(c) How is MACAW differ from MACA ? 5

(A-6)
 31 MCS-042

(d) Differentiate between the following : 5

.(i) Circuit switching and Packet
switching

(ii) 2-way handshake and 3-way

handshake methods

4. (a) Discuss the following IPM header fields : 10

(i) Time to live

(ii) Type of service

OW Fragment offset

(iv) Header checksum

(b) How is BGP different from other distance

vector routing protocols ? 5
(c) What is QoS ? Discuss QoS requirements
for e-mail application. 5

5. (a) Why is bit stuffing advantageous over

character stuffing ? 5

Write bit sequence after bit stuffing the

data stream :

110001111111100001111100.

(A4) P. T. 0.
 [4] MCS-042

(b) What are the difficulties in building a

bridge between various 802 LANs ? 5

(c) What is a digital signature ? What

are the benefits of using digital
signatures ? 5

(d) Explain persistent and non-

persistent CSMA protocols using suitable
diagrams. 5

MCS-042 5,500

(A4)
 426894

No. of Printed Pages : 4 MCS-042

MASTERS IN COMPUTER
APPLICATIONS {MCA)
Term-End Examination
December, 2019
MC9 042 : DATA COMMUNICATIONS AND
-

COMPUTER NETWORKS

Time : 3 Hours Maximum Marks : 100

Note : Question No. 1 is compulsory. Attempt any

three questions from the rest.

1. (a) Find CRC for data polynomial

x5 + x4 + x2 + x + 1 with a generator
polynomial x3 + x + 1. 6

(b) Sketch the Manchester and RZ encoding

schemes for the following bit stream : 5
111000110111.
(c) What is count to Infinity problem in
distance vector routing algorithm ? Explain
it with the help of an example. 6
 [2 MCS-042

(d) Derive the throughput expression for pure

ALOHA. Also show the vulnerable time of
this protocol. 7

(e) Discuss and show the process of connection

establishment and termination in TCP.
How does it handle delayed arrival of SYN
and ACK packets ? 10

(f) How does encryption and decryption take

place in RSA ? Explain. 6

2. (a) Construct the Hamming Code for the bit

sequence 10011101. 6

(b) Define Shannon's theorem if a binary

signal is sent over 3 MHz channel with
signal to noise ratio of 30 dB. What is the
maximum achievable channel capacity ? 7

(c) What is the purpose of a digital signature ?

Explain the process of generating it. 7

3. (a) Why ethernet frame has both

the minimum and maximum length
restriction ? Explain. 6
 [ 3 3 MCS-042

(b) How is silly window syndrome created by

the receiver ? What is the proposed
solution ? Discuss. 7

(c) How does PCM work ? Explain with the

help of a diagram. 7

4. (a) For what purpose Leaky Bucket algorithm

is used ? Explain the algorithm. 7

(b) Explain the hidden station and exposed

station problems in wireless LAN ?,Why is
CSMA/CD protocol not suitable for wireless
LAN ? 8

(c) Illustrate and compare circuit switching

and packet switching techniques. 5

5. (a) Explain the purpose of the following TCP

header fields : 10

(i) SYN flag

(ii) FIN flag

(iii) Window size

(iv) Urgent pointer

(v) Sequence number

 [4] MCS-042

(b) Consider the following network with the

indicated link cost. Use Bellman-Ford
algorithm to find the shortest path from
source node A to all the other nodes in the
network : 10

10

MCS-042 5,500
No. of Printed Pages : 4 MCS-042
MASTER OF COMPUTER
APPLICATIONS (MCA) (REVISED)
Term-End Examination
June, 2020
MCS-042 : DATA COMMUNICATION AND
COMPUTER NETWORKS

Time : 3 Hours Maximum Marks : 100

Note :(i) Question No. 1 is compulsory.

(ii) Attempt any three questions from the

rest.

1. (a) What is CSMA/CD ? What is the need of

back-off in CSMA/CD ? Explain back-off
algorithm with the help of an example. 10
(b) What is multiplexing ? How are the frames
synchronized in synchronous TDM ? 5
(c) What are the main issues • in routing ?
Illustrate good and bad routing using a
plot. 5

P. T. O.
 [2] MCS-042

(d) Find the maximum achievable channel

capacity of a binary signal which is sent

over a 3 kHz and whose signal to noise

ratio is 20 dB. 5

(e) Explain congestion detection and

congestion avoidance phases in slow start

algorithm in TCP. 10

(f) What is Pulse Code Modulation (PCM) ?

Explain how quantization levels are chosen
in PCM. 5

2. (a) What are the advantages of multistage

switching over a singh-stage circuit

switching ? Explain the role of time-slot-

interchange (TSI) in time-division

switching. 10

(b) Explain how Negal's algorithm improves

the efficiency of TCP/IP network, with the
help of an example. 10
 I 31 MCS-042

(It) Why is stop-and-wait ARQ inefficient ?

*ow does this inefficiency overcome in Go-
Back-N ARQ ? Compare Go-Back-N with
Selective Repeat ARQ. 10

(b) What is pure ALOHA protocol ? Explain

how is throughput of a system computed.
Also explain the relationship plot between
throughput and load. 10

4. (a) What is Hidden Station problem in

wireless networks ? How is it overcome
using RTS, CTS packets ? Illustrate using
a diagram. 10

(b) What is symmetric key cryptography ?

Explain block ciphers and stream ciphers
with the help of suitable diagrams. 10

5. (a) What is count to infinity problem in IP

networks ? How is this problem overcome
by the exterior gateway routing protocol ?

10

P. T. O.
 [4) MCS-042

(b) Consider the following network with the

indicated link cost. Use Dijkstra's shortest

path algorithm to compute the shortest

path from source node A to the network

node F : 10

4' 63 0
MCS-042
No. of Printed Pages : 3 MCS-042

MCA (Revised)
Term-End Examination
February, 2021

MCS-042 : DATA COMMUNICATION AND

COMPUTER NETWORKS

Time : 3 hours Maximum Marks : 100

Note : Question no. 1 is compulsory. Attempt any three

questions from the rest.

1. (a) Compare OSI and TCP/IP reference models

for data networks. 5
(b) What is Domain Name System (DNS) ?
Explain how it maps to IP Address. 5
(c) Differentiate between stream ciphers and
block ciphers with the help of an example. 5
(d) Draw Unipolar and Manchester encoding
for the following bit stream : 5
10110011
(e) The frame 1101011011 is transmitted
using the generator polynomial
4
G(x) = x + x + 1. Compute the checksum
and the transmitted frame. 10

MCS-042 1 P.T.O.
 (f) Explain the need of traffic policing.
Conceptually explain the role of leaky
bucket algorithm in traffic policing. 5
(g) Convert the IP address whose hexadecimal
representation is B24E23A2. 5

2. (a) What is RPC ? Explain its operation with

the help of a diagram. 10
(b) Explain TCP three-way handshake
mechanism of connection establishment.
Show (i) normal operation, (ii) delayed
arrival of SYN packet, and (iii) delayed
SYN and ACK packets. 10

3. (a) Consider the following network with the

indicated link cost. Using Bellman-Ford
Algorithm, find the shortest path from
source node A to all other nodes : 10

(b) Draw constellation pattern for 4-QAM. 5

(c) What is Virtual Circuit ? How is it
different from datagram ? Explain. 5

MCS-042 2
4. (a) What are IP Address classes ? Explain with
the help of examples. 5
(b) What is Asynchronous communication ?
Explain its advantages and disadvantages. 5

(c) Why is UDP needed at transport layer ?

Show UDP segment structure. 5

(d) List the multiplexing mechanisms at the

transport layer and also briefly explain
how they are different from each other. 5

5. (a) What is a Digital Certificate ? Explain how

it is created. 5
(b) What is Ethernet Frame Format ? What is
the size of the following fields in Ethernet
Frame Format : 5
(i) Source Address
(ii) Destination Address
(iii) Data

(c) What is Token Bucket Traffic Shaper ?

Explain the features of the above. 5

(d) Explain Circuit switching and Packet

switching using diagrams. 5

MCS-042 3 P.T.O.
 [2] MCS-042

(c) Define Forward Error Correction (FEC).

No. of Printed Pages : 4 MCS-042
Explain ‘Hamming Code’ with the help of

MASTER OF COMPUTER an example. 5

APPLICATIONS (MCA) (REVISED) (d) Describe, how parity check method is used

Term-End Examination for error detection using an example. 5

June, 2021 (e) Explain the flow control mechanisms used

MCS-042 : DATA COMMUNICATION AND in Data-Link Layer and in Transport

COMPUTER NETWORKS Layer. 10

Time : 3 Hours Maximum Marks : 100

(f) Which layer in TCP/IP model is mainly

Note : (i) Question No. 1 is compulsory. responsible for congestion control ? How is

it different from flow control ? 5

(ii) Attempt any three questions from the

rest. (g) Define User Datagram Protocol (UDP).

1. (a) What is delay in data transmission ? Draw the UDP header format and explain

Differentiate between transmission delay the use of any two fields in this header. 5

and propagation delay. 5

2. (a) What is Remote Procedure Call (RPC) ?
(b) What is multiplexing ? Explain any two
Explain the working of RPC with the help
advantages of frequency division
of a diagram. 10
multiplexing with the help of a diagram. 5
P. T. O.
 [3] MCS-042 [4] MCS-042

(b) Explain, what should be the minimum (c) Explain ring topology with the help of a

sampling interval needed for diagram. Also write its advantages. 5

reconstructing a signal where the highest

5. (a) What is TCP/IP reference model ? Briefly
frequency is 2 kHz ? 5
explain different layes of TCP/IP reference
(c) Draw RZ encoding for the following bit model. Also, list any two differences
stream : 5 between TCP/IP and OSI models. 10

101001110 (b) What is Quality of Service (QoS) ? Briefly

explain different QoS parameters to be

3. (a) What is WAN ? Explain characteristics of
considered for online (live) video streaming
WAN. Also compare WAN with LAN. 10
service. 10
(b) Explain three-way handshake mechanism

of TCP connection establishment with

suitable diagrams. 10

4. (a) Explain, how Go-BACK-N ARQ work, with

the help of a diagram. 10

(b) What is synchronous communication ?

Give examples of synchronous

communications. Also, write its

advantages. 5 MCS-042 4,700

P. T. O.
 [2] MCS-042

No. of Printed Pages : 4 MCS-042

MASTER OF COMPUTER

APPLICATIONS (MCA)

Term-End Examination
(b) Compare bit stuffing and byte stuffing. Bit
December, 2021 stuff the following data frame : 6

MCS-042 : DATA COMMUNICATION AND 001111000111111100011

COMPUTER NETWORKS
(c) What are the important aspects that
Time : 3 Hours Maximum Marks : 100 establish trust in digital signature ?

Explain. 5
Note : (i) Question No. 1 is compulsory.

(ii) Attempt any three questions from the (d) What happens if one of the stations is

rest. unplugged in bus topology and ring

topology ? 6
1. (a) Consider the following network with the

indicated link cost. Use Dijkstra’s shortest (e) How does token bucket traffic shaper work ?
path algorithm to find the shortest path Explain with the help of a diagram. 8
from the source node A to all other nodes :
(f) Explain the terms piggybacking and
10
pipelining. 5

P. T. O.
 [3] MCS-042 [4] MCS-042

2. (a) What is Congestion ? What are the three (d) Explain the format of an Ethernet frame. 5

phases in TCP’s congestion control 5. (a) Explain the purpose of the following IP and
mechanism ? Explain with the help of a TCP header fields : 10
diagram. How does the size of a congestion
(i) Fragment offset
window increase in the first phase ? 10 (ii) Time to live
(iii) Service type
(b) What is random access protocol ? Derive
(iv) Type of service
throughput expressions for pure ALOHA
(v) Window size
and slotted ALOHA. Also plot throughput
(b) Show the constellation diagram of QPSK. 5
vs. load graphs for both the protocols. 10
(c) Show a TCP connection termination
3. (a) Explain Diffie-Hellman algorithm with the sequence. 5
help of an example. 10

(b) How does BGP work ? How does it solve

the count-to-infinity problem ? 10

4. (a) Explain the binary exponential back off

algorithm. 5

(b) Explain upward and downward

multiplexing. 5

(c) Describe Nyquist’s theorem with the help

of an example. 5 MCS-042

P. T. O.
No. of Printed Pages : 3 MCS-042

MCA (Revised)
Term-End Examination
June, 2022

MCS-042 : DATA COMMUNICATION AND

COMPUTER NETWORKS

Time : 3 hours Maximum Marks : 100

Note : Question no. 1 is compulsory. Answer any
three questions from the rest.

1. (a) What is digital certificate ? Explain any two

uses of digital certificate. 5

(b) Draw UDP header and explain its fields. 5

(c) What is Client/Server architecture of

computer network ? How is it advantageous
compared to peer-to-peer architecture of
computer network ? 5

(d) Define ARP. Differenciate between ARP

and RARP. 5

(e) Explain the following in context of data

communication : 5
(i) Bandwidth
(ii) Frequency

MCS-042 1 P.T.O.
 (f) Explain the need of congestion control.
Explain any two congestion control schemes. 10
(g) Explain any five types of topologies used in
LAN. 5

2. (a) Explain the use of Bellman-Ford algorithm

for routing, with the help of its application
in public switch network. 12
(b) Explain circuit switching with the help of a
diagram. Differentiate between space
division and time division switchings. 8

3. (a) Explain the concept of piggybacking with

the help of a diagram. 5
(b) What is the use of cryptography ? Briefly
explain the differences between public key
and private key cryptography. 5
(c) Explain the use of STOP and WAIT
Automatic Repeat Request (ARQ) method,
with the help of a suitable diagram. 10

4. (a) Explain, why 802.11 does not use CSMA/CD

protocol. 5
(b) Briefly explain Pretty Good Privacy (PGP)
approach for electronic mail security. 5
(c) Briefly explain ARPANET. 5
(d) Briefly explain the features of transparent
bridge. 5

MCS-042 2
5. (a) What is CSMA/CD ? Explain the working of
CSMA/CD with the help of a diagram. 10

(b) Explain TCP/IP reference model in detail.

Also list its advantages and drawbacks in
comparison to OSI reference model. 10

MCS-042 3 P.T.O.
No. of Printed Pages : 3 MCS-042

MCA (Revised)
Term-End Examination
December, 2022

MCS-042 : DATA COMMUNICATION AND

COMPUTER NETWORKS

Time : 3 hours Maximum Marks : 100

Note : Question no. 1 is compulsory. Attempt any
three questions from the rest.

1. (a) What are the different classes of IP

address ? Explain through examples. 5

(b) Differentiate between stream ciphers and

block ciphers, with the help of an example
for each. 5

(c) Compare Unipolar Encoding and

RZ Encoding. Draw Unipolar Encoding and
RZ Encoding for the bitstream 01001100. 5

(d) What do you mean by multiplexing ?

Briefly discuss Frequency Division and
Time Division Multiplexing. 5

(e) Define Data rate and Signal rate. Write the

expression to establish relation between
them. 5
MCS-042 1 P.T.O.
 (f) What is Sliding Window Protocol ? Why is it
useful in satellite links ? 5
(g) Sketch the Manchester and Differential
Manchester for the bitstream
01001110001. 5
(h) What is CRC ? Find CRC for data
polynomial x4 + x2 + x + 1 with generation
polynomial x3 + 1. 5

2. (a) Discuss and illustrate flow control

mechanism in the following : 10
(i) Data link layer
(ii) Transport layer

(b) Explain the steps involved in conversion of

an analog signal to a digital signal. What is
the basis of choice of number of
Quantization level ? 10

3. (a) Compare Circuit Switching and Packet

Switching. What are the limitations of
Circuit Switching ? How does Packet
Switching overcome the limitations of
Circuit Switching ? 10
(b) Why are pipeline protocols used in data
link layer ? Illustrate Go-back-N, with the
help of an example 10

MCS-042 2
4. (a) Briefly discuss DES. Explain the steps to
implement DES, by using appropriate
diagram. Why is triple DES used ? 10

(b) Explain Nagle’s algorithm. What is the

significance of Nagle’s algorithm ? Give a
scenario where this algorithm is not
applicable. 10

5. (a) How does Link State Routing differ from

Distance Vector Routing ? Write steps to
implement Distance Vector Routing
protocol. 10

(b) What is Binary Exponential Back-off

algorithm ? Explain how it is used in
CSMA/CD. 10

MCS-042 3 P.T.O.