iirililrrfiiltilrtitil illll ilil tfi cs - 496
35
V Semester B.C.A. Degree Examination, March 2A23
(Y2K14) (cBcs) (F + R)
COMPUTEH SCIENCE
BCA - 501 : Data Communication and Networks
Time : 3 Hours Max. Marks : 100
lnstructian : Answer all Sections.
SECTION * A
l. Answer any ten questions. Each carries 2 marks. (10x2=20)
1) Define computer network.
2) What is topology ?
3) What is FTP ? Mention any two ftp commands.
4) What is nyquist signalling rate for a noiseless channel ?
5) Define single bit eri'or with an example.
6) What do you mean by checksum ?
7) Define PPP.
8) What is Piggy backing ?
g) Define polling.
10) Define Datagram.
1 1) Expand FDMA and CDMA.
12) What is a repeater ?
SECTION -B
il. Answer any five questions. Each carries 5 marks. (5x5=25)
13) Explain mesh topology.
14) Describe IEEE 802.11 frame structure.
15) Write a note on circuit switching.
P,T.O.
cs - 496 I|ililil lililtilllllll iilil ilfiffit
16) Explain the different transmission modes.
17) Explain SONET multiptexing in detail.
18) What is bridge ? Explain the various types of bridges.
19) Explain pulse code modulation.
20) Describe HDLC frame structure.
SECTION _ C
il1. Answer any three questions. Each carries fifteen rnarks. (3x15=45)
21) a) Explain OSI reference model with a neat diagram. I
b) Explain CRC method of error detection with example. 7
22) a) Explain twisted pair and fiber optic cable. 8
b) With a neat flow diagram explain STOP and WAIT AFIQ. 7
23) a) Describe ALOHA and slotted ALOHA. I
b) Describe sliding window protocol. 7
24) a) Explain (a) congestion control (b) Flow control. I
b) Describe FDDI frame structure in detail. 7
25) a) Explain structure of packet switch. I
b) Explain Leaky Bucket algorithm. 7
SECTION _ D
tv. Answer any one question. Each carries ten marks. (1x10=10)
26) Explain TCP/IP vtith a neat diagram.
27) What is routing ? Explain any two routing algorithms.
.':.: