PYQs Computer Networks
PYQs Computer Networks
..... . .
(Ple ase wri te you r Ex am Ro
E N D TE R M EX AM IN AT IO N
SIX TH SEM EST ER B .TE CH /M. TE CH MA Y-J UN E 20 14
ng
er Co de: EC -30 4 Su bje ct: Co mp ute r Ne two rki
pap H, Ma xim um Ma rks : 60
3 ou rs
T{me: pu lso ry.
pt an y fiv e qu est ion s inc lud ing Q. no .1 wh ich is com
Note: At tem ch Un it.
. Se lec t on e qu est ion fro m ea
hno log y use d LA Ns?
Ql (a} What_ IS the tr~ sm iss ion tec l det erm ine d?
th rat e of a cha nne
(b) Ho w I~ e m~ mu m dat a g and byt e stu ffin g in fra min g?
Wh at ~s th e dif~ ere nce bet we en bit stu ffin
(c) y is it use d?
(d) Wh at Is tun nel ing ? Wh
ing ?
(e) Wh at is me ant by pig gyb ack
(f) Wh at are the typ es of cab
les use d in Eth ern et?
ma t of 802 .11 ?
(g) Wh at is the dat a fra me for rou ter s.
di_f fe~ enc e bet we en the fun ctio nin g of sw itch es and
(~) Ex pl~ n the nic atio n and
IS the prm c1p le dif fer enc e bet we en con nec tio nle ss com mu
(1)What atio n?
con nec tio n ori ent ed com mu nic (10 x2= 20)
ion _of UDP.
(j) De scr ibe bri efly the ope rat
Un it-I it
ons of eac h lay er in the OS I ref ere nce mo del . Ho w is
Q2 Ex pla in the fun cti (10 )
P/I P ref ere nce mo del ?
dif fer ent fro m TC
OR ibe eac h of
are the com mo nly use d gui ded tra nsm iss ion me dia ? De scr (6)
Q3 (a) Wh at
the m bri efly . sin gle cha nne l
sig nal s eac h req uir ing 400 0 Hz are mu ltip lex ed on to a ltip lex ed
(b) Ten the mu
um ban dw idt h is req uir ed for
usi ng FD M. Ho w mu ch ma xim Hz wid e. (4)
l? As sum e tha t the gua rd ban ds are 400
cha nne
Un it-I I
ion . Da ta lin k pro toc ols
(a) Ex pla in pol yno mia l cod e (CRC} for err or det ect (6)
Q4 rat her tha n in a hea der . Wh y?
alw ays pu t the CR C in a tra iler nd ard CR C me tho d
A bit str eam 110 101 101 1 is tra nsm itte d usi ng ~e sta
(b) tor pol yno mia l is ·
des cri be in the tex t. Th e gen era
G(x) = x4 + x + 1 (4)
act ual bit str ing tra nsm itte d.
Sh ow the
OR (6)
ng Go Ba ck N.
(a) Wr ite the alg ori thm for slid ing win dow pro toc ol usi sta tio n B usi ng
Q5 s to
Sta tio n A nee ds to sen d a me ssa ge con sis tin g of 9 pac ket teg y. All
(b) tro l stra
e 3) and go bac k - n err or con
a slid ing win dow (W ind ow siz ava ilab le for tra nsm iss ion . If eve ry 5t11
are rea dy and imm edi ate ly
pac ket s the n
tra nsm its get s los t (bu t no t ack fro m B eve r get s los t)
pac ket tha t A g the me ssa ge
s tha t A wil l tra nsm it for sen din
wh at is the nu mb er of pac ket (4)
to B? Un it-I ll
(3)
Wh at is cla ss- ful l add res sin g? (4)
Q6 (a)
tin gui sh bet we en sub net tin g and sup ern ett ing . pan y
(b) Dis the n com
pan y is gra nte d the site add res s 181 .56 .0. 0 (cl ass B), (3)
(c) A com
sub net s.
nee ds 100 sub net s. De sig n the
OR (5)
is the rou tin g tab le cre ate d and up dat ed in OS PF . (5)
Q7 (a) Ho w are its dra wb ack s?
ce vec tor rou tin g? Wh at
(b) Wh at is dis tan
Un it-I V (5)
at is sill y win dow syn dro me ? Ho w can it be rec tifi ed? (5)
Q8 (a) Wh P?
ges tio n con tro l don e in TC
(b) Ho w is con
OR (5)
9 in bri efly FT P and TF TP an d dif fer ent iate bet we en the m. (5)
0 (a) Ex pla
nag ed usi ng DN S?
(b) Ho w can nam es be ma
***********
t your E x a m
R
E
o ll No.)
XAM Exam Roll No ·.....................
:~ ERCY CHA NC E TION
11Pe ,u
i,.1 INA
R B STE
SIXTH SEME JULY-2013 =r~k-:&
Subject•~H r Ne;:tw=o :-E-=- c-- - -
~ BBA(H)30
8 • omp
n
u
o
t
_e
log ies (B a t::::;;,e;o'Ce
'tPer Tech
Maximum Marks :7. 5
/ . 3 1 / 0urs Q pulso
e q u e s ti o n s includin g _ .n o .I which is com
1rrie • Attemp t a ny fi v .
t1ote:
~
c o n n e c ti o n 0
.
n d c o n n e c ti onless services ·
nce b e tw e e n a
d .thnented
.J l (a) Differe n a p ro to c o l a ss o c ia te WI each
Mentio. . .
· is io n m u lt i le . · m with figures.
y div Exp la
(b) What 1s fr e q u e n c
t-to -p ? t xmg?
n s d o e s poin g . om protocol perform?
(c) What fu n c ti o encod in
a n c h e s te r (3x5=15J
(d) E x p la in M P and U D P.
(e) Differenc
e between TC (7}
o d el a n d IP X packet.
re fe re n c e· m (BJ
~ e ll n e tw a re
~n n o ies.
Q2 ((ba)) EExplla m v a ri o u s LAN topolog and
xp
it iv es . Defme service
ice prim service prim
itives
a ri o u s c la ss e s of serv ip . E x p la in
uss v (7)
Q3 (a) D is c d is c u s s th e ir relationsh
pro~ocol a n
d ges a n d
~ x a m p le . D is c u ss their advanta e st for
takin~ a n re n t ty p e s
of LANs. know which
LAN is b
p la m d if fe o rg an iz at io n ~
(b) E ~ e s. How d o e s a n
d is a d v a n ta g
(7)
~ (8 )
tellites. ls.
p la in g e o sy n c h ro n o u s sa multiple access protoco
Q4 (a) E x in v a ri o u s c a rr ie r se n se (7 )
(b) E x p la rk in g dev ices.
e tw o plain.
u s n e tw o rk ing a n d intem name their types a n d ex
x p la in v a ri o m? Broadly (8)
QS (a) EW h a t is a ro u ti n g algorith ng. ·
(b) c e vector rou
ti
d is ta n e common
Ex p la in
s? D is cu ss . What is th (7)
a rd
th e v a ri o u s EDI st a n d J?iscuss. How is
(a) W h a t a re tu re of EDI st a n d a rd s? In tr ~ e t a n d Extrfil";et? ss. List
Q6 c
logical st ru onic Comm~rce. What 1s physical m a rk e ts ? Disc u
ctr from lace over
(b) Define Ele m a rk e t place different s of electronic market. p
c tr o n ic dvantage (8)
1 : a d v a n ta g e s a n d disa
~
e ts . (5x3=15)
p h y si c a l m a rk ow in g:-
e e of the foll
h o rt n o te s.· o n a n y th r
•
Q7 W n te s a n d its,\eaders.
( ) MIME Mobile ~ho(G ne ~ystem ly)
d v a n c e d ded on
(:} A n media m mmerce.
T a n sn tl ss io m e t with respect to E-co
n te
~~} B :n e fi ts o fl
o/J /41~
[-2 -]
er a
(a) What are some of the factors that determ ine wheth
Q2 (5)
comm unicat ion system is a LAN, MAN or WAN?
comm unicat ion
(b) Define the term connec tion-o riented as used in data
(5)
and relate it to TCP. of
(c) What are the benefi ts of using layere d protoc ols? Discus s some
(2.5)
them.
OR
how
(a) What is a peer-to -peer proces s? What are heade s and trailer s and
Q2 (5.5)
do they get added and remov ed?
light along optica l chann els with
(b) Discu s the modes for propag ating
(3)
proper diagra ms.
by netwo rk topolo gy? Discu ss the proble ms and
(c) What do you mean
(4)
benefi ts of any three topolo gies.
p.T.0.
.....
Ro ll No.) o . ......... .......
E xa n tR o l! N
AMINATION
M
" r if f I (
JI H / _\ Q
T ER M E X
END t M~tsrmtR
~
T
SMAY-2010 8 · £CH
- -~ s~,x~T!!H..~ uter Networks
~ :;:--;;;4:; -- c e comp
c ode : IT 3 0 ·
n~
- ;
-=d;~;~~;; ~~;~ :;~ :;:6~0 ;
!
..:-'~> !
=
"..
~"~~~~s~u.ib:; ;.,jiemc:~= ; Maxim
·t-A~-ct~-v.-=;a= um Mark s
7
;if!. . 3 Hours ~ ~~ ;~
~N::~o;;~te-_.~i-~ mpt any
A tt e -:!!~
= =
!' e q u e s tion
~~
t~
5-
3~
0:.
~4 ~~~~~
=- ~~
=~= · fi v s.
{I~
r,P8;,o~· - -
_--
-
ic a l li n k n k la y e r. (6)
s of phys d a ta li
~ p la in fe a tu re tr a t A R la y e r a n d RP. (6)
(a) E
m p le to il lu s P and R A
e x a e
)1
G iv e a n (6)
(b) t h .
.
ll o w in g ro u ti n g n 1 q u es .
e fo
E x p la ,n th c to r ro u ti n g ec I
J2 (a) n c e v e I
(i) D is ta
te ro u ti n g
(ii) L in k s ta (4)
fo u r c .
re v e n ti o n policies · )
ongee tfron
ny 5 p on. (2
(b) M e n ti o n a . ra m
.
ro u te r configurati
. a ers u s e d ,n
(C) Me n t ron vanous p . <4>
Q3. (a) C o m p a re
IP V 4 a n
o c o
d
n
IP
g e
V
s
B
ti ~ n c o n tr o l a lg o
ri th m s
~ fo r tr affic shapin
g A n!~
ny tw
b u c k e t sch
e m e cell
(b) E x p la in a a to k e n e n is g o o d for ~n
o r k use s to k te?'
(c) ~~ A T_M n e ~ cket
pu~ into b u s o f data. W h a t is m
e v e ry 5 µ sec. Each m sustainable data ra
a x im u
w h tn rs y te i~~
c o n ta in s 48 b
ch (6)
a n s p o ': la y e r: c k e t fo rm ats . )
tr a (3
a tu re s o f respective
p
Q4 . (a) E x p la in fe DP. G iv e th e rr
p u te r n e tw o rk s .
(b) T C ~ a n d U ance issues in c o m
C o m ~ a re s ix pe rf o rm L 1 to A A L
S of ATM
(c) M e n ti o n a n y ture s o f A A (~>
. G iv e v arious fea
elds t transport
T M A A L fi lishment a
05. (a) E x p la in A cti o n e s ta b ~
packet. f s te p s fo r conne (3 )
n o
) E x p la in s e q u e s ti o
(b
~~~ w in d o w sy
ndrome . (4)
x p la in s il ly
(c ) E o ls . (6 )
s o f d a ta link protoc w o rk in g . )
u s a tt ri b u te rking a n d
its (2
(a ) G iv e v a ri o n e n ts o f internetwo
06 . mpo s.
(b ) E x p la in c o u s ro u ti n g operation (6)
p la in v a ri o
(c) E x rotocols:-
g a p p li c a ti o n la y e r p
e fo ll o w in
(a) E x p la in th
07 .
(i) D N S arious
N M P P a n d mention v
(ii) S M T (4)
n ic m a il u s e d in S
tr o
rk in g e le c exchange
E x p la in th e w o o n ic m a il . s e n ta ti o n layer (2)
(b) ts o f e le c tr p re
componen ti o n la y er a n d
a
w a p p li c
E x p la in h o (4)
(c) n. firewalls.
in fo rm a ti o ous ty _ p e ~ o f (6)
w a ll s . M enti_on var~ ll c a t, o n s .
s o f fire th e ir app
) E x p la in feature g fi lt e ri n g a n d g iv e
QB . (a e fo ll o w in
(b) E x p la in th g
(2)
o n fi lt e ri n .
a ti
(i) A p p li c ng
.
l p n v a te n e
tw o rk .
k e t fi lt e ri o f v ir tu a
(ii) P a c a tt ri b u te s
E x p la in v a ri o u s
(c)
(Please >c•rire 1·011 £.
. r \:an, Roll .'Vo.)
UNIT-I
Q.2 (a) Discuss ISO - OSI reference model in detail. (7}
(b) What is the relationship between data rate and bandwidth? Explain in brief. (3)
Q.3 (a) Illustrate the difference between guided media and unguided media. (3)
(b) A typical channel has 300 Hz bandwidth and signal to noise ratio of 3 db.
Assuming white thermal noise, determine the capacity of the channel.(3)
(c) What are impairments in wireless communication? Describe those. (4)
UNIT- II
(5)
Q .4 (a) Discuss different design issues of data link layer.
(5)
(b) Explain the use of hamming code to correct burst errors.
(5)
Q.5 (a) Describe one B_it slidin_g window protocol. (5)
( b) Discuss HDLC in detail.
UNIT-Ill
t of slotted ALOHA is twice that of pure ALOHA. . . (6)
Q .6 (a) Show that throughp~ . tial back off algorithm in case of colhs1on.(4)
(b) Explain the use of Binary exponen
. (7)
Q.7 (a) Discuss high spe~d LAN~ in de~a~y the following : (3)
(b) Mention the functions pe .~rm~
i) Repeater ii) Switch 111) bridge
.UN.IT-IV . . (4)
. within a v~rtual c1rcu1t subnet. ? (6)
(a) Explain the concept o~ ro~t~;w does roqter learn about its neighbors .
Q .8
(b) What is link state routing· . . (4)
·on congestion prevention pohc1es. (6)
t'1 ? Also men t1
(a) what is conges ~~~rnet work protocols. ·
Q .9
(b) Write a note on n