SPPU-TE-COMP-CONTENT – KSKA Git
Total No. of Questions : 4] SEAT No. :
8
-23
P8558 [Total No. of Pages : 1
Oct-22/TE/Insem-528
tic
sta
T.E. (Computer Engineering)
:13
COMPUTER NETWORKS AND SECURITY
1
:36
(2019 Pattern)(Semester-I) (310244)
0/2 309
10
Time : 1 Hour] [Max. Marks : 30
2
Instructions to the candidates:
01
02
1) Neat Diagram must be drawn wherever necessary.
GP
2) Figures to the right indicates full marks.
7/1
3) Assume Suitable data if necessary.
CE
4) Answer Q1 or Q2, Q3 or Q4.
80
8
23
.23
ic-
Q1) a) Explain LAN, MAN, WAN. [6]
16
tat
8.2
b) What are design issues of layers? Explain it. [5]
3s
c) Explain [4]
.24
6:1
91
i) Router
49
0:3
ii) Switch
30
21
01
02
OR
0/2
GP
Q2) a) Explain Client Server and Peer to Peer Network. [6]
7/1
b) Draw Manchester and differential Manchester code for the bit sequence:
CE
80
8
23
0100110 [5]
.23
ic-
c) Explain Star and Bus topologies. [4]
16
tat
8.2
3s
Q3) a) Give brief about design issues in DLL. [6]
.24
6:1
b) Differentiate between Pure and Slotted ALOHA [5]
91
49
0:3
c) Explain PPP. [4]
30
21
OR
01
02
0/2
.23 GP
Q4) a) Sender Sends code 1001101 justify receiver using Hamming code. [6]
7/1
b) Explain IEEE 802.3 frame format. [5]
E
80
C
c) Explain Stop and Wait Protocol. [4]
16
8.2
eeee
.24
[Oct-22/TE/InSem]-504
49