Cs 610 OBJSUb File

Question No: 1 ( M - 1 ) .
In Point-to-Point topology there are two topologies.

Star and Tree
Tree and Ring
Star and Ring
Star and Tree
None of the given

1) STAR topology

2) TREE topology
------ Progra sends a essage to a reote !oputer and reports
whether the !oputer responds.
Ping
Traceroute
I!"
Non of the given
"ing progra# tests reach a$ility. It sends datagra# fro# % to A& that echoes
$ac' to %. it uses I!" echo re(uest and echo reply #essages.
Question No: " ( M - 1 ) .
------ has no way to deterine the !ause o# the pro$le.
I!"
Ping
Trace route
Non of the given
"ing has no way to deter#ine the cause of the pro$le#. Tracing A Route
Networ' ad#inistrators use another tool& trace route.
Question No: % ( M - 1 ) .
The ter----- ------- re#ers to the general !on!ept o# a sall $lo!& o#
data
Pa!&et
)ra#e
*ata
None of the given
"ac'et is a generic ter# that refers to s#all $loc' of data. "ac'et have
different for#at. Each hardware uses different pac'et for#at.
Question No: ' ( M - 1 ) .
---------- s!hee( whi!h is designed to help dete!t transissions
errors( send one e)tra $it o# in#oration with ea!h !hara!ter

Parity
hec'su#s
R
None of given
A parity sche#e& which is designed to help detect trans#ission errors& sends
one e+tra hit of infor#ation with each character. Although it allows receiver
to deter#ine if a single $it has $een changed parity can not detect
trans#ission errors that change an even nu#$er of $its.
Question No: * ( M - 1 ) .
+o!al Tal& is a +,N te!hnology that eploys -------------
-us topology
Ring topology
Star topology
None of the given
,-A, TA,./
Apple invented the ,AN technology that uses $us topology. Its interface is
included with all !acintosh co#puters.
Question No: . ( M - 1 ) .
Most +,Ns that eploy ring topology use an a!!ess e!hanis
&nown as-------
S!A0*
S!A0A
T/01N P,SSIN2
None of the given
!ost ,ANs that e#ploy ring technology use an access #echanis# 'nown
as token passing . A to'en ring operates as a single& shared #ediu#. 1hen a
co#puter wants to send data& it #ust wait until it o$tains the to'en& when it
is in control of the ring
www.vu2s.net0
http/00groups.google.co#0group0vu3s
1thernet uses a ------ $it stati! addressing s!hee in whi!h ea!h
de4i!e is assigned a uni5ue address $y the anu#a!turer.
45
%3
62
7
Ethernet uses a 578$it static addressing sche#e
7orally naed 8888888888 in#orally &nown as the thi!& wire
1thernet or Thi!& net.
19 %ase 2
19 -ase '
19 %ase T
None of the given
Thick Ethernet, officially known as 10 Base 5, is the oldest form of Ethernet. It was
originally developed in the late 190!s "y #igital E$%ipment &orporation, IB', and (ero),
and "ecame an international standard *IEEE +0,.-. in 19+-.
Taken from http://www.maznets.com/tech/10base-5.htm
7orally naed 8888888888 in#orally &nown as the twisted pair
1thernet or TP 1thernet.
19 %ase 2
19 %ase :
19 -ase T
None of the given
twisted pair ethernet
)or#ally called 19 %ase ;T
Also twisted pair Ethernet or si#ply T" Ethernet
www.vu2s.net0
The a)iu si:e o# an 1thernet segent is88888888888

2:9 #eters
'99 eters
<99 #eters
None of the given
-ne Ethernet ca$le is so#eti#es called a seg#ent. This seg#ent is li#ited
to :99 #eters in length. The #ini#u# separation $etween connections is 6
#eters. ="> 2<)
, -ridge !an 88888888
)ilter a fra#e
)orward a fra#e
E+tend a ,AN
;o all the a$o4e
A $ridge is a hardware device also used to connect two ,AN seg#ents to
e+tend a ,AN. It listens to all traffic and recogni2es fra#e for#at. It also
forwards only correct co#plete fra#es and discards the collided and error
fra#es.

The #ost i#portant tas' a $ridge perfor#s is fra#e filtering.
Question No: 1" ( M - 1 ) .
8888888 !oputes shortest paths in a graph $y using weights on
edges as a easure o# distan!e.
?reedy algorith#
*istance vector algorith#
;i<&sta=s algorith
Non of the given
*i@'stras algorith# co#putes shortest paths in a graph $y using weights on
edg as a #easure of distance. A path with the fewest nu#$er of edges #ay
not $e the path with least weight. ="> 1<6 e8$oo's)

Question No: 1% ( M - 1 ) .
8888888888is used #or !opressed audio and 4ideo where the data
rate depends on the le4el o# !opression that !an $e a!hie4ed.
onstant %it Rate =%R) service
>aria$le -it ?ate (>-?) ser4i!e
Availa$le %it Rate =A%R) service
None of the given

AARIA%,E %IT RATE =A%R)/

It is used for co#pressed audio and video where the data rate depends on
the level of co#pression that can $e achieved.
www.vu2s.net0
Question No: 1' ( M - 1 ) .
-asi! +,N te!hnologies su!h as 1thernet( To&en ?ing( and 7;;I use
a 88888.

@onne!tionless ser4i!e paradig
onnection8oriented service paradig#
%oth onnectionless and onnection8oriented service paradig#
None of the given
%asic ,AN technologies such as 1thernet( To&en ?ing( and 7;;I use
a connectionless service paradig#. Although a co#puter needs to wait for
access to a shared #ediu# $efore sending a pac'et
=2h&vu2s&nov19)
Question No: 1* ( M - 1 ) .
The produ!t o# delay and throughput easures the 88888 o# data
that !an $e present on the networ&.
Area
>olue
,ength
None of the given
*E,AB TCR-D"DT "R-*DT/

It is co#puted as delay ti#e #ultiplied $y effective throughput. It #easures

a#ount of data that can $e present in the networ' ="> 79)
Question No: 1. ( M - 1 ) .
, networ& with throughput T and delay ; has a total o# 88888888 $it
in transit at any tie.
T 0 *
T ) ;
T E *
None of the given
A networ' with throughput T and delay * has a total of T + * $its in transit
at
any ti#e. =e8$oo's)
/ne repeater 8888888( two repeaters 88888888 the a)iu !a$le
length liitation.
dou$les( triple
s(uare roots& cude roots
and& triple
dou$les& cancel
-ne repeater dou$les& two repeaters triple the #a+i#u# ca$le length
li#itation. ="> 5F)
, networ& uses a ------ i# all !oputers atta!h to a !entral point
Star Topology
Ring Topology
%us Topology
None of the given
STAR T-"-,-?B/
In this topology& all co#puters are attached to a central point& which is
so#eti#es called the GCu$H ="> 2:)
@oputers atta!hed to an ethernet use ------ in whi!h a !oputer
waits #or the other to $e idle $e#ore transitting a #rae.

@SM,A@;
S!A0A
T-.EN "ASSIN?
None of the given
All co#puters attached to the Ethernet use S!A0* to co8ordinate their
activities. A co#puter wishing to trans#it chec's for electrical activity on the
ca$le& infor#ally called a carrier . If there is no carrier& the co#puter can
trans#it. If a carrier is present& the co#puter waits for the sender to finish
$efore proceeding.
In broacast topo!o"# there are two cate"ories$$$$.
%&'())I'(*+&,I-
+IN. '-/-)-.0
1oth a 2 b
None o3 the abo4e
'he term 66..re3ers to the "enera! concept o3 a sma!! b!oc7 o3 ata
/ac7et
8rame
,ata
None o3 the "i4en
'he term -------- is use to enote the e3inition o3 a pac7et use with a speci3ic t#pe o3 networ7.
/ac7et
8rame
,ata
None o3 the "i4en
Question No: : ( M - 1 ) .
;+; can etect more errors than a simp!e chec7sum66
'rue
8a!se

'he (thernet stanar speci3ies that 3rames are sent usin" the --------Manchestor

Question No: < ( M - 1 ) .
Most )&Ns that emp!o# rin" topo!o"# use an access mechanism 7nown as-------
;%M&/;,
;%M&/;&
'-=(N /&%%IN.
None o3 the "i4en
Question No: > ( M - 1 ) .
&n ------------metho? the networ7 harware esi"ners speci3# how t#pe in3ormation is inc!ue
in the 3rame an the 4a!ue use to ienti3# 4arious 3rame t#pes.
(@p!icit 3rame t#pe
Iea! 3rame t#pe
Imp!icit 3rame t#pe
None o3 the "i4en
Question No: A ( M - 1 ) .
I((( ));/%N&/ heaer is --------? which is use to speci3# the t#pe o3 ata.
A octets
A b#tes
A bits
None o3 the "i4en
Question No: B ( M - 1 ) .
8orma!!# name $$$$$$$$$$ in3orma!!# 7nown as the thic7 wire (thernet or 'hic7 net.
10 1ase 5
10 1ase 5
10 1ase '
None o3 the "i4en 4uzs.net
Most NI;s contain $$$$$$$$$$$$$$$ circuitr# that a!!ows the NI; to operate inepenent o3 the
;/C.

& bri"es 3unction in the $$$$$$$$$ !a#ers(s).
/h#sica!(M&;)
,ata )in7
Networ7
/h#sica! (M&;) an ,ata!in7
& 1ri"e 3orwars or 3i!ters a 3rame b# comparin" the in3ormation in its aress tab!e to the
3rameDs$$$$$$$$$$
)a#er 5 source aress
%ource noeDs ph#sica! aress
)a#er 5 estination aress
'he ne@t hop to which a pac7et is sent epens on!# on
/ac7etDs estination
/ac7etDs ori"ina! source
/ath the pac7et has ta7en
Non o3 the "i4en
Question No: 1: ( M - 1 ) .
$$$$$$$$$$is use 3or compresse auio an 4ieo where the ata rate epens on the !e4e!
o3 compression that can be achie4e.

;onstant 1it +ate (;1+) ser4ice
Eariab!e 1it +ate (E1+) ser4ice
&4ai!ab!e 1it +ate (&1+) ser4ice
None o3 the "i4en
&'M assi"ns each E; a $$$$$$$$$$$$$ ienti3ier that is i4ie two parts to prouce a
hierarch#.
51-bit
55-bit
59-bit
5: bit

Question No: 1< ( M - 1 ) .
&'M was esi"ne 3or $$$$$$$$ an use a$$$$$$$$$

Question No: 1> ( M - 1 ) .
'he prouct o3 e!a# an throu"hput measures the $$$$$ o3 ata that can be present on the
networ7.

&rea
Eo!ume
)en"th
None o3 the "i4en
Question No: 1A ( M - 1 ) .
& t#pica! port on an &'M switch operates at $$$$$$$$$$ or hi"her.
-;-5 spee (155Mbps)
-;-9 spee (100Mbps)
-;-9 spee (155Mbps)
-;-9 spee (155.bps)
Question No: 1B ( M - 1 ) .
&- inter3ace ---- pro4ies mechanism that automatica!!# assi"ns a ph#sica! aress to a
station when the station 3irst boots.
1# size there are..............c!assi3ications o3 networ7s.
5
9
:
1
51.Fhat is the i33erence between the ph#sica! an !o"ica! topo!o"iesG(5)
%tatic routin":
%tatic routin" is not rea!!# a routin" protoco!. %tatic routin" is simp!# the process o3 manua!!#
enterin" routes into a e4iceHs routin" tab!e 4ia a con3i"uration 3i!e that is !oae when
the routin" e4ice starts up
,#namic +outin" :
,#namic routin" protoco!s are supporte b# so3tware app!ications runnin" on the routin" e4ice
(the router) which #namica!!# !earn networ7 estinations an how to "et to them an a!so
a4ertise those estinations to other routers. 'his a4ertisement 3unction a!!ows a!! the routers
to !earn about a!! the estination networ7sthat e@ist an how to those networ7s. It is more
rebust.
%tatic routin" a!!ows routin" tab!es in speci3ic routers to be set up in a static manner so networ7
routes 3or pac7ets are set. I3 a router on the route "oes own the estination ma# become
unreachab!e. ,#namic routin" a!!ows routin" tab!es in routers to chan"e as the possib!e routes
chan"e.
55. ,e3ine static an #namic routin".(5)
59. Fhat is meant b# 1ri"es %'&+'C/ an %'(&,0 %tateG(9)
5:. Iow can %witche Eirtua! Networ7 be estab!isheG(9)
55. Fhat is the concept o3 pac7et switchesG(5)
/ac7et-switches escribes the t#pe o3 networ7 in which re!ati4e!# sma!! units o3 ata
ca!!e pac7ets are route throu"h a networ7 base on the estination aress containe within
each pac7et. 1rea7in" communication own into pac7ets a!!ows the same ata path to be
share amon" man# users in the networ7. -ne common c!ass o3 contemporar# pac7et switches
are the bri"e an networ7 hub? which interconnect mu!tip!e networ7 se"ments at the ata !in7
!a#er. &nother is the router? a e4ice which operates at the internetwor7 !a#er? an connects
issimi!ar 7ins o3 networ7s? such as seria! !ines an !oca! area networ7s.
5<. Frite a note on Fei"ht .raph.(5)
'he concept o3 a wei"hte "raph is e@treme!# use3u!. 'he wei"hts can be thou"ht o3? 3or
e@amp!e? as the cost o3 senin" a messa"e own a particu!ar arc. (Not necessari!# a monetar#
cost but some combination o3 time an istance 3or e@amp!e). Fei"hte "raphs can be use to
3ormu!ate the shortest path prob!em 3or routin" pac7ets.
No error etection scheme is per3ect because transmission errors can a33ect the
aitiona! in3ormation as we!! as the ata.
True
8a!se
aitiona! in3ormation as we!! as the ata. & c#c!ic!# reununc# chce7? which is s!i"ht!#
more i33icu!t to computer can etect more errors then a /arit# or ;hec7 sum
mechnasim.

------ /ro"ram sens a messa"e to a remote computer an reports whether the
computer respons.
Ping
'raceroute
I;M/
Non o3 the "i4en

---------- was especia!!# concerne about the !ac7 o3 hi"h powere computers.
ARPA
I(((
(I&
Non o3 the "i4en
'he C% ,epartment o3 ,e3ense &4ance +esearch /roJects &"enc# (&+/&) was
especia!!# concerne about the !ac7 o3 hi"h-powere computers. M an# o3 the &+/&
research proJects neee access to the !atest eKuipment

'he term -------- is use to enote the e3inition o3 a pac7et use with a speci3ic t#pe o3
networ7.
/ac7et
Frame
,ata
None o3 the "i4en
'o he!p istin"uish between the "enera! iea o3 pac7et transmission an the speci3ic
e3inition o3 pac7ets 3or a "i4en harware techno!o"#? we use the term 3rame to enote
the e3inition o3 a pac7et use with a speci3ic t#pe o3 networ7. 'hus one mi"ht re3er the
ma@imum amount o3 ata a 3rame can ho! or the orer in which bits o3 a 3rame are sent
across a networ7.

;omputer networ7s are o3ten ca!!e -------------- because the# use pac7et techno!o"#.
(thernet
%witch networ7s
/ac7et networ7s
None o3 the "i4en
www.4uzs.net/
http://"roups."oo"!e.com/"roup/4uLs

Question No: ( M - 1 ) .
-------------- ha4e a4anta"es arisen 3rom the size an ease o3 computation.
;+;
/arit#
;hec7sums
None o3 "i4en

Question No: ! ( M - 1 ) .
Most )&Ns that emp!o# rin" topo!o"# use an access mechanism 7nown as-------
;%M&/;,
;%M&/;&
T"#$N PA%%&N'
None o3 the "i4en
Most )&Ns that emp!o# rin" techno!o"# use an access mechanism 7nown as token
passing. & to7en rin" operates as a sin"!e? share meium. Fhen a computer wants to
sen ata? it must wait unti! it obtains the to7en? when it is in contro! o3 the rin"

Question No: ( ( M - 1 ) .
I((( ));/%N&/ heaer is --------? which is use to speci3# the t#pe o3 ata.
( o)tets
A b#tes
A bits
None o3 the "i4en

www.vu2s.net0

Question No: * ( M - 1 ) .
8orma!!# name $$$$$$$$$$ in3orma!!# 7nown as the twiste pair (thernet or '/
(thernet.
10 1ase 5
10 1ase 5
1+ ,ase T
None o3 the "i4en

twiste pair ethernet
8orma!!# ca!!e 10 1ase M'
&!so twiste pair (thernet or simp!# '/ (thernet

Question No: 1+ ( M - 1 ) .
&n inter3ace 3or twiste pair (thernet must ha4e an $$$$$$$$$$$$ connector ? an
must "enerate si"na!s accorin" to the$$$$$$$$$$$$$ speci3ication.
R--45. 1+ ,ase T
+N-:5? 10 1ase 5
1N;? 10 1ase 5
1N;? 10 1ase '
an inter3ace 3or twiste pair (thernet must ha4e an +N-:5 connector? an must "enerate
si"na!s accorin" to the 101ase' speci3ication. (/O <A9 (-boo7s)

& bri"es 3unction in the $$$$$$$$$ !a#ers(s).
/h#sica! (M&;)
,ata !in7
Networ7
/h#sica! (M&;) an ,ata !in7
http://hi"here.mc"raw-hi!!.com/sites/00>5B<>>55/stuent$4iew0/chapter$9$Kuiz.htm!
& 1ri"e can $$$$$$$$
8i!ter a 3rame
8orwar a 3rame
(@ten a )&N
/o a00 t1e a2o3e
& bri"e is a harware e4ice a!so use to connect two )&N se"ments to e@ten a )&N.
It !istens to a!! tra33ic an reco"nizes 3rame 3ormat. It a!so 3orwars on!# correct comp!ete
3rames an iscars the co!!ie an error 3rames.
'he most important tas7 a bri"e per3orms is 3rame 3i!terin".
www.4uzs.net/

& 1ri"e 3orwars or 3i!ters a 3rame b# comparin" the in3ormation in its aress tab!e to
the 3rameDs$$$$$$$$$$
)a#er 5 source aress
%ource noeDs ph#sica! aress
4a5er 2 6estination a66ress

$$$$$$$$ computes shortest paths in a "raph b# usin" wei"hts on e"es as a measure
o3 istance.
.ree# a!"orithm
,istance 4ector a!"orithm
/i78sta9s a0gorit1m
Non o3 the "i4en
,iJ7stras a!"orithm computes shortest paths in a "raph b# usin" wei"hts on e" as a
measure o3 istance. & path with the 3ewest number o3 e"es ma# not be the path with
!east wei"ht. (/O 1>9 e-boo7s)

$$$$$$$$$$$ is use 3or auio an 4ieo? since these ha4e pree3ine ma@imum ata
rates
Eariab!e 1it +ate (E1+) ser4ice
None o3 the "i4en
CONSTANT BIT RATE (CBR):
&t is use6 :or au6io an6 3i6eo. sin)e t1ese 1a3e ;re6e:ine6 ma<imum 6ata rates.
("mer =1au61r5
>>>.3u?s.net@
1tt;:@@grou;s.goog0e.)om@grou;@3uAs

Cn!i7e 8rame +e!a# an &'M? %M,% (%witche mu!ti-me"abit ,ata ser4ice)
o33ers$$$$$$$ .
=onne)tion0ess ser3i)e ;ara6igm
;onnection oriente ser4ice parai"m
1oth ;onnection!ess an ;onnection-oriente ser4ice parai"m
None o3 the "i4en
%witche Mu!ti me"abit ,ata %er4ice (%M,%) is a!so a 'e!co ser4ice. It is a connection
!ess ser4ice.
8+&M( +()&0:
It is use 3or 'e!co ser4ice 3or e!i4erin" b!oc7s o3 ata. It is connection base
%er4ice &'M uses the concept o3 connection-oriente networ7in"

Question No: 1! ( M - 1 ) .
& networ7 with throu"hput ' an e!a# , has a tota! o3 $$$$$$$$ bit in transit at an#
time.
' / ,
T < /
' P ,
None o3 the "i4en
& networ7 with throu"hput ' an e!a# , has a tota! o3 ' @ , bits in transit at
an# time. (e-boo7s)
Question No: 1( ( M - 1 ) .
&'M is esi"ne to wor7 on$$$$$$$$$$$.
'wiste /air
;oa@ia!
+aio 8reKuenc#
Fi2er
&'M is esi"ne to wor7 on 3iber (but can be use with twiste pair). (/O >5)
www.4uzs.net/

Question No: 1* ( M - 1 ) .
;omputers attache to an ethernet use ------ in which a computer waits 3or the ether to
be i!e be3ore transmittin" a 3rame.
=%MA@=/
;%M&/;&
'-=(N /&%%IN.
None o3 the "i4en
&!! computers attache to the (thernet use ;%M&/;, to co-orinate their acti4ities. &
computer wishin" to transmit chec7s 3or e!ectrica! acti4it# on the cab!e? in3orma!!# ca!!e
a carrier. I3 there is no carrier? the computer can transmit. I3 a carrier is present? the
computer waits 3or the sener to 3inish be3ore proceein"

Question No: 2+ ( M - 1 ) .
8,,I can transmits ata at a rate o3 ----------
1++ mi00ion 2its ;er se)on6
10 mi!!ion bits per secon
None o3 the "i4en
F//&: 8iber istribute ata interconnect (8,,I) is another rin" techno!o"#. Its most
important 3eatures are: It uses 3iber optics between stations an transmits ata at
100Mbps.

BBBBBBBB 1as a 7itter ?ero
None o3 the "i4en
Eirtua! /ri4ate Networ7
&so)1ronous Net>or8
&s#nchronous Networ7

Cn0i8e Frame Re0a5 an6 ATM. %M/% (%>it)1e6 mu0ti-mega2it /ata ser3i)e)
o::ersBBBBBBB.
=onne)tion0ess ser3i)e ;ara6igm
;onnection oriente ser4ice parai"m
1oth ;onnection!ess an ;onnection-oriente ser4ice parai"m
None o3 the "i4en

ATM assigns ea)1 D= a BBBBBBBBBBBBB i6enti:ier t1at is 6i3i6e6 t>o ;arts to
;ro6u)e a 1ierar)15.
51-bit
55-bit
59-bit
24-2i t
'he E; is ienti3ie b# a 5:-bit 4a!ue 3orme 3rom the E/I or Eirtua! /ath Inicator (A-
bit)?

Most EAN s5stems in)0u6e a me)1anism t1at )an 2e use6 to e0iminate t1e
)ommon )ase o: 6u;0i)ation routing is )a00e6BBBBBBBBBBB
Iierarcha! aress
/e:au0t route %hortest path
None o3 the "i4en

T1e ne<t 1o; to >1i)1 a ;a)8et is sent 6e;en6s on05 on
Pa)8et9s 6estination
/ac7etDs ori"ina! source
/ath the pac7et has ta7en
Non o3 the "i4en

An inter:a)e :or t>iste6 ;air $t1ernet must 1a3e a BBBBBBBBBBBB )onne)tor. an6
must generate signa0s a))or6ing to t1eBBBBBBBBBBBBB s;e)i:i)ation.
R--45. 1+ ,ase T
+N-:5? 10 1ase 5
1N;? 10 1ase 5
1N;? 10 1ase '
(zh?4uzs?no410)

E1en an a;;0i)ationBBBBBBBBBBB 6ata. it ma8es a )o;5 o: t1e 6ata a3ai0a20e to a00
ot1er )om;uters on t1e net>or8.
,roa6)asting
Mu!ticastin"
Cnicastin"
None o3 the "i4en
Fhen an app!ication broacasts ata? it ma7es a cop# o3 the ata a4ai!ab!eto a!! other
computers on the networ7. 1roacast has man# uses. 8or e@amp!e? suppose a
computer nees to 3in one o3 the printers on the networ7

A BBBBBBBBBBBB ;ro3i6e a me)1anism t1at a )ustomer )an use to set a ;15si)a0
a66ress.
%tatic aressin" scheme
=on:igura20e a66ressing s)1eme
,#namic aressin" scheme
None o3 the "i4en
-ne o3 the a4anta"es o3 a con3i"urab!e aressin" scheme becomes apparent when
networ7 inter3ace harware 3ai!s an must be rep!ace: un!i7e harware that uses a
static assi"nment? a con3i"urab!e inter3ace can be rep!ace

8,,I can transmits ata at a rate o3 $$$$$$$$$$$$$$$$$$$
1++ mi00ion 2its ;er se)on6
None o3 the "i4en
F//&: 8iber istribute ata interconnect (8,,I) is another rin" techno!o"#. Its most
important 3eatures are:
It uses 3iber optics between stations an transmits ata at 100Mbps.
It uses pair o3 3ibers to 3orm two concentric rin"s.

=om;uters atta)1e6 to an et1er use ------ in >1i)1 a )om;uter >aits :or t1e et1er
to 2e i60e 2e:ore transmitting a :rame.
=%MA@=/
;%M&/;&
'-=(N /&%%IN.
None o3 the "i4en

BBBBBBBBBBBBBBBB 1as a63antages arisen :rom t1e si?e an6 ease o: )om;utation.
;+;
/arit#
=1e)8sums
None o3 "i4en
'he chie3 a4anta"es arise 3rom the size an ease o3 computation. Most networ7s that
emp!o# a chec7sum techniKue use a ><-bit or N5-bit chec7sum? an compute a sin"!e
chec7sum 3or an entire pac7et.

T1e term BBBBBBBBBBB is use6 to 6enote t1e 6e:inition o: a ;a)8et use6 >it1 a
s;e)i:i) t5;e o: net>or8.
/ac7et
Frame
,ata
None o3 the "i4en
'o he!p istin"uish between the "enera! iea o3 pac7et transmission an the speci3ic
e3inition o3 pac7ets 3or a "i4en harware techno!o"#? we use the term 3rame to enote
the e3inition o3 a pac7et use with a speci3ic t#pe o3 networ7

BBBBBBBBBBBBBB 1as no >a5 to 6etermine t1e )ause o: t1e ;ro20em.
Ping
'race route
I;M/
Non o3 the "i4en
/in" has no wa# to etermine the cause o3 the prob!em. &nother reason wh# pin" ma#
3ai! to "enerate a response is !ess subt!e: some companies con3i"ure their site to reJect
pin" pac7ets.

BBBBBBBBBBBBB Program sen6s a message to a remote )om;uter an6 re;orts
>1et1er t1e )om;uter res;on6s.
Ping
'race route
I;M/
Non o3 the "i4en

&n BBBBBBBBBBBB. net>or8 o))u;ies t1e sma00er area 0i8e a room a :0oor or a
2ui06ing.
4AN
F&N
M&N
None o3 the "i4en

aitiona! in3ormation as we!! as the ata.

Question No: 1> ( M - 5 ) 8ormat is not c!ear e4en I tr# to o with cnt!P& an then chan"e 3ormat with 15/'imes new roman or arie!. 1ut 3ai!

Question No: 1A ( M - 5 )

Question No: 1B ( M - 9 )

Question No: 2+ ( M - 5 )
Fhich t#pe o3 in3ormation is obtaine 3rom networ7 sni33er an in which moe Networ7
sni33er operatesG

%o0ution:
& networ7 ana!#zer a!so ca!!e networ7 monitor or a networ7 sni33er is use to e@amine
the per3ormance o3 or ebu" a networ7. It can report statistics such as capacit#
uti!ization? istribution o3 3rame size? co!!ision rate or to7en circu!ation time
Most insta!!ations sti!! use ,IQ (thernet encoin" in which there is no ));/%N&/ heaer
in the 3rame. & networ7 ana!#zer can te!! 3rom the 4a!ues in the t#pe 3ie! (sma!! 4a!ues
are !en"ths? which mean an ));/%N&/ heaer is !ocate in the 3irst octets o3 the ata
areaR !ar"e 4a!ues are t#pes? which mean no ));/%N&/ heaer is inc!ue).

'he operation o3 networ7 ana!#zer is a computer with a networ7 inter3ace that recei4es
a!! 3rames? which is ca!!e promiscuous moe. %o man# es7top computers ha4e
inter3ace that can be con3i"ure 3or promiscuous moe. Fhen combine with so3tware
computer can e@amine an# 3rame on )&N. In this wa# the communication across )&N is
"uarantee to be pri4ate. ;omputer recei4es an isp!a#s 3rames on the )&N.
Networ7 ana!#zer can be con3i"ure to 3i!ter an process 3rames. It can count 3rames o3
speci3ic t#pe o3 size. It isp!a#s on!# 3rames 3rom or to speci3ic computers.

Question No: 21 ( M - 1+ )
'hic7 (thernet? 'hin (thernet an 'wiste pair (thernet.

%o0ution:-

T1i)8 $t1ernet:
'hic7 (thernet? o33icia!!# 7nown as 10 1ase-5? is the o!est 3orm o3 (thernet.
-ne 3orm o3 cab!in" supporte b# (thernet is !ow-!oss 50 -hm coa@ia! cab!e as shown
in the 3i"ure be!ow. 'his t#pe o3 cab!e is 0.5S iameter (usua!!# supp!ie with a #e!!ow
outer /E; coatin") an rather in3!e@ib!e. It has become 7nown in the communications
inustr# as S'hic7 (thernetS. 'he o33icia! name 3or this cab!e is 10 1aseban5 (1015)?
inicatin" that it is speci3ie 3or baseban communications at 10 Mbps o4er istances
up to 500m.

T1in $t1ernet:

'hin (thernet? o33icia!!# ca!!e 10 1ase-5? is a !ess e@pensi4e 4ersion o3 10 1ase-5
('hic7 (thernet) techno!o"ies. It uses a !i"hter an thinner coa@ia! cab!e an ispenses
with the e@terna! transcei4ers use with 10 1ase-5.

10 1ase-5 uses an +.-5A&/C coa@ia! cab!e an is wire in a bus topo!o"#. (ach e4ice
on the networ7 is connecte to the bus throu"h a 1N; S'S aapter? an each en o3 the
bus must ha4e a 50 -hm terminator attache. (ach noe on the bus must be a
minimum o3 0.5 meters (1.5 3eet) apart? an the o4era!! !en"th o3 the bus must be !ess
than 1A5 meters (<0< 3eet).

T>iste6 Pair $t1ernet:

'wiste /air (thernet (10base')? sometime a!so ca!!e SC'/S 3rom SCnshie!e 'wiste
/airS? is base on usin" a cab!e simi!ar to phone-wirin". 'he cab!e is connecte 4ia +N-
:5 connectors to the networ7 car insta!!e in the /;.

A t5;i)a0 ;ort on an ATM s>it)1 o;erates at BBBBBBBBBB or 1ig1er.

-;-5 spee (155Mbps)
-;-9 spee (100Mbps)
"=-3 s;ee6 (155M2;s)
-;-9 spee (155.bps)
& t#pica! port on an &'M switch operates at -;-9 spee (155 Mbps) or hi"her? with the
!ar"est an most e@pensi4e switches han!in" much hi"her capacities

T1e ;ro6u)t o: 6e0a5 an6 t1roug1;ut measures t1e BBBBB o: 6ata t1at )an 2e
;resent on t1e net>or8.

&rea
Do0ume
)en"th
None o3 the "i4en
'o summarize: 'he prouct o3 e!a# an throu"hput measures the 4o!ume o3 ata that
can be present on the networ7. & networ7 with throu"hput ' an e!a# , can ha4e a
tota! o3'T, bits in transit at an# time
BBBBBBBBBBis use6 :or )om;resse6 au6io an6 3i6eo >1ere t1e 6ata rate 6e;en6s
on t1e 0e3e0 o: )om;ression t1at )an 2e a)1ie3e6.

Daria20e ,it Rate (D,R) ser3i)e
None o3 the "i4en

E&+I&1)( 1I' +&'( (E1+):
It is use 3or compresse auio an 4ieo where the ata rate epens on the !e4e!
o3 compression that can be achie4e.

E1i)1 o: t1e :o00o>ing is a )onne)ting 6e3i)eF

1ri"e
+epeater
Iub
A00 t1e gi3en

A 2ri6ges :un)tion in t1e BBBBBBBBB 0a5ers(s).

/h#sica! (M&;)
,ata !in7
Networ7

P15si)a0 (MA=) an6 /ata 0in8
http://highered.mcgraw-hill.com/sites/0072967722/student_view0/chapter_3_quiz.html
&$$$ 44=@%NAP 1ea6er is --------. >1i)1 is use6 to s;e)i:5 t1e t5;e o: 6ata.
( o)tets

A b#tes
A bits
None o3 the "i4en
Q /ac7et '#pe (/')? the 3i4e 4a!ues o3 which were !iste pre4ious!#? in 'ab!e >-5. 'he
I((( A05. !Q /ac7et 1o# )en"th (/1)) 3o!!ows the /ac7et '#pe. 1ecause
the ));/%N&/ heaer is ei"ht octets !on"? an the I((( A05
T1e t1ir6 :ie06 o: t1e 1ea6er )onsists o: ------ 2it $t1ernet :rame t5;e.

:A
95
1
A
(zh?4uzs?no410)

An ------------met1o6. t1e net>or8 1ar6>are 6esigners s;e)i:5 1o> t5;e
in:ormation is in)0u6e6 in t1e :rame an6 t1e 3a0ue use to i6enti:5 3arious :rame
t5;es.
$<;0i)it :rame t5;e
Iea! 3rame t#pe
Imp!icit 3rame t#pe
None o3 the "i4en
(Q/)I;I' 8+&M( '0/(:
In this t#pe the ienti3#in" 4a!ue is inc!ue with 3rame escribes t#pes o3 inc!ue ata.

4o)a0 Ta08 is a 4AN te)1no0og5 t1at em;0o5s BBBBBBBBBBBBB

%tar topo!o"#
,us to;o0og5
+in" topo!o"#
None o3 the "i4en
&!most a!to"ether networ7 techno!o"ies use i33erent wirin" schemes. e.".? !oca! ta!7
uses hubs
(ph#sica! star) to simu!ate a bus topo!o"#.
T1e Fast $t1ernet 1ar6>are o;erates at a rate o: BBBBBBBBBBBBBBB
10 Mbps
1++ M2;s
1000 Mbps
None o3 the "i4en
'he (thernet spee was ori"ina!!# 9Mbps? an the current stanar is 10Mbps
the 3ast (thernet operates at 100Mbps. 'here are a!so "i"abits (thernet a4ai!ab!e now

BBBBBBBBBBBs)1eme. >1i)1 is 6esigne6 to 1e0; 6ete)t transmissions errors. sen6
one e<tra 2it o: in:ormation >it1 ea)1 )1ara)ter
Parit5
;hec7sums
;+;
None o3 "i4en www.4uzs.net

=om;uter net>or8s are o:ten )a00e6 -------------- 2e)ause t1e5 use ;a)8et
te)1no0og5.
(thernet
%witch networ7s
Pa)8et net>or8s
None o3 the "i4en
=om;uter net>or8s are o:ten )a00e6 pac7et networ7s or pac7et switchin" networ7s
because the# use pac7et techno!o"#

$$$$$$$$$$$$$/ro"ram sens a messa"e to a remote computer an reports whether
the computer respons.

Ping
'race route
I;M/
Non o3 the "i4en
'he pin" pro"ram sens a messa"e to a remote computer an reports whether the
computer responsR the traceroute pro"ram ienti3ies intermeiate computers a!on" a
path to a remote estination. /in" an traceroute so3tware is inc!ue in
In $$$$$$$$$$$$$$ networ7 occupies !ar"er areas !i7e cities 2 countries.
)&N
EAN
M&N
None o3 the "i4en

&n -------------. net>or8 o))u;ies t1e sma00er area 0i8e a room a :0oor or a 2ui06ing.
4AN
F&N
M&N
None o3 the "i4en

&n Point-to-Point to;o0og5 t1ere are t>o to;o0ogies.
Tree an6 Ring
%tar an +in"
%tar an 'ree
None o3 the "i4en

/-IN'-'--/-IN':
In /oint-to-/oint topo!o"# there are two topo!o"ies.
1) %'&+ topo!o"#
5) '+(( topo!o"#

>>>.3u?s.net
1tt;:@@>>>.3u?s.net
Question No: 1! ( M - 2 )
Question No: 1( ( M - 2 )
Question No: 1* ( M - 3 )
Fh# 10-base ' wirin" scheme is ca!!e star shape bus wirin" scheme.
Question No: 2+ ( M - 5 )
Fhat are the main 3actors ue to which mechanism o3 error etections schemes
i33erG
Question No: 21 ( M - 1+ )
Iow much ata can be present on an ori"ina! (thernet se"ment at one timeG 'o 3in
out? compute the e!a#-throu"hput prouct. 'he ori"ina! (thernet operate at 10 me"a
bits per secon? an a se"ment was !imite to 500 meters. &ssume the si"na!s
propa"ate own the cab!e at << percent o3 the spee o3 !i"ht.
>>>.3u?s.net
2. Star Textile has huge network of systems and switches. A task is given to IT Officer that if some link goes the
entire network works smoothly. Which routing method will be use
Answer!" #istributed routing method is better for this $ur$ose because #istributed routing relies on each node
to com$ute its own routing table and build the re%uired connections with its neighbors. Ideally& the network
o$eration& status& and architecture of each node is trans$arent. #istributed routing is more flexible than
centrali'ed routing because each node handles its own routing. The result is often im$roved system
$erformance.
mainay ghalati say distributed routing key (agah distributed to$ology likh dia hai dua karain examiner ankhain
band karkay $a$er check karay.

Qno.15 Suppose an organization wants voice communication in a network by using ATM technology. Eplain
how ATM eliminates the varying !elays associate! with variable size !ata packets.
Answer"#
Organi'ation wants voice communication introduced AT) to meet several goals. It $rovides universal service
for all subscribers and su$$ort for all users for voice& video and data. It has a single unified infrastructure *no
se$arate +A,s and WA,s-. It gives guaranteed service when it is a$$ro$riate and su$$ort for low cost devices.
$%TTE&"
.itter is the term used for variance in transmission delays. .itter is significance for voice& video and data. In
+A,s& (itter can occur when a $acket is delayed because the network is busy.
'A()ET S%*ES"
+arge $ackets result in fewer overheads because a smaller fraction of the $acket is used for header information.
O$timum networks use /k0 $ackets or larger. +arge $ackets can1t easily be used for voice for exam$le 2"bit
sam$les *at 324usec $er sam$le- would re%uire half a second to fill a /k0 $acket. 5cho cancellation can only be
used with low transmission delays.
To$ of 6orm
7e$ly
0ottom of 6orm
)essage
8ermalink 7e$ly by ).Tari% )alik on #ecember 3/& 2932 at 2!29$m
)era cs:39 ka 8a$er acha ho gaya mostly $a$er mc% $ast main say thay aur ; %uestion bhi aur yah sab moa'
wali file say mc% aur sub(ective kay ; %uestion aye that.
"""""" 8rogram sends a message to a remote com$uter and re$orts whether the com$uter res$onds.
8ing *<om$uter ,etworks and Internets& $age=-
Traceroute
I<)8
,on of the given
"""""""""" was es$ecially concerned about the lack of high $owered com$uters.
A78A *<om$uter ,etworks and Internets& $age4-
I555
5IA
,on of the given
<om$uter networks are often called """""""""""""" because they use $acket technology.
5thernet
Switch networks
8acket networks *<om$uter ,etworks and Internets& $age >;-
,one of the given
?nlike 6rame 7elay and AT)& S)#S *Switched multi"megabit #ata service- offers@@@@@@@ .
<onnectionless service $aradigm *<om$uter ,etworks and Internets& $age332-
<onnection oriented service $aradigm
0oth <onnectionless and <onnection"oriented service $aradigm
,one of the given
AT) is designed to work on@@@@@@@@@@@.
Twisted 8air
<oaxial
7adio 6re%uency
6iber *<om$uter ,etworks and Internets& $age >2-
+ocal Talk is a +A, technology that em$loys """""""""""""
0us to$ology *8age ;9-
7ing to$ology
Star to$ology
,one of the given
The $roduct of delay and through$ut measures the @@@@@ of data that can be $resent on the network.
Area
Aolume *8age 29-
+ength
,one of the given
One re$eater @@@@@@@& two re$eaters @@@@@@@@ the maximum cable length limitation.
doubles& tri$le *8age /=-
s%uare roots& cude roots
and& tri$le
doubles& cancel
A network uses a """""" if all com$uters attach to a central $oint
Star To$ology *8age 24-
7ing To$ology
0us To$ology
,one of the given
In """""""""& network occu$ies larger areas like cities B countries.
+A,
WA, *8age /-
)A,
,one of the given
@@@@@@@@ has a (itter 'ero
,one of the given
Airtual 8rivate ,etwork
Isochronous ,etwork
Asynchronous ,etwork
A """""""""" $rovide a mechanism that a customer can use to set a $hysical address.
Static addressing scheme
<onfigurable addressing scheme *8age ;/-
#ynamic addressing scheme
,one of the given
To$ of 6orm
7e$ly
0ottom of 6orm
)essage
We say that 0ridges is a intelligent device ....Cive reasons
Write down the ty$e of network $erformance
What ty$e of switching techni%ue is used in WA,
Su$$ose you are a ,etwork 5ngineer in IS8& $roviding different technologies services like one of these may be
cell based network& as ,etwork 5ngineer you must know that which term is used to refer DinformationE related
to the network but not refers to the DinformationE that only uses the network& give name of this term and
reserved values.
There are two sites office A B 0& both are using A8,. If a user of another network wants to send some $acket to
A& then what will be the behavior of network A Fow data is $rotected in A8, environment Cive ; reasons*94
marks-
Su$$ose& There are two sites office A B 0 6ar away from each other& Which technolgy is used&+A, or WA,& give
/ reasons
To$ of 6orm
7e$ly
0ottom of 6orm
)essage
my to#ay 8a$5r
All )c%s from )oa' file and
"""""" has no way to determine the cause of the $roblem.
I<)8
8ing *<om$uter ,etworks and Internets& $age 33-
Trace route
,on of the given
Guestion ,o! 2 * )arks! 3 - " 8lease choose one
"""""" 8rogram sends a message to a remote com$uter and re$orts whether the
com$uter res$onds.
@ 8ing *8"33-
@ Trace route
@ I<)8
@ ,on of the given
)ost +A,s that em$loy ring to$ology use an access mechanism known as"""""""
<S)AH<#
<S)AH<A
TOI5, 8ASSI,C *<om$uter ,etworks and Internets& $age=4-
,one of the given
6ormally named @@@@@@@@@@ informally known as the twisted $air 5thernet or T8 5thernet.
39 0ase 2
39 0ase 4
39 0ase T *8age /;-
,one of the given
An interface for twisted $air 5thernet must have an @@@@@@@@@@@@ connector & and must generate signals
according to the@@@@@@@@@@@@@ s$ecification.
7."/4& 39 0ase T *<om$uter ,etworks and Internets& $age 32:-
7."/4& 39 0ase 4
0,<& 39 0ase 2
0,<& 39 0ase T
A 0ridge can @@@@@@@@
6ilter a frame
6orward a frame
5xtend a +A,
#o all the above
AT) used in """"""" and have
WA, <onnectionless service $aradigm
+A, <onnection oriented service $aradigm
0oth +A, and WA, <onnection"oriented service $aradigm
0oth +A, and WA, <onnectionless service $aradigm *<om$uter ,etworks and Internets& $age332-
A network with through$ut T and delay # has a total of @@@@@@@@ bit in transit at any time.
T H #
T x # *<om$uter ,etworks and Internets& $age29;-
T J #
,one of the given
+ocal Talk is a +A, technology that em$loys """""""""""""
0us to$ology *8age ;9-
7ing to$ology
Star to$ology
,one of the given
One re$eater @@@@@@@& two re$eaters @@@@@@@@ the maximum cable length limitation.
doubles& tri$le *8age /=-
s%uare roots& cude roots
and& tri$le
doubles& cancel
A network uses a """""" if all com$uters attach to a central $oint
Star To$ology *8age 24-
7ing To$ology
0us To$ology
,one of the given
In """""""""& network occu$ies larger areas like cities B countries.
+A,
WA, *8age /-
)A,
,one of the given
AT) assigns each A< a @@@@@@@@@@@@@ identifier that is divided two $arts to $roduce a hierarchy.
23"bit
22"bit
2;"bit
2/"bit *8age :>-
Static addressing scheme A """""""""" $rovide a mechanism that a customer can use to set a $hysical address.
<onfigurable addressing scheme *8age ;/-
#ynamic addressing scheme
,one of the given
7emaining 4 )<G1s r new

7ead more! <S:39 Today1s $a$er sub(ective " Airtual ?niversity of
8akistan htt$!HHvustudents.ning.comHgrou$Hcs:39com$uternetworkHforumHto$icsHcs:39"today"s"$a$er"
sub(ectiveKix''2mAt(/T+y
7ead more at htt$!HHvustudents.ning.comHgrou$Hcs:39com$uternetworkHforumHto$icsHcs:39"today"s"$a$er"
sub(ectiveKAd)F+0'7Iex3IOc2.==
Gno.3 in +A, of 2 $cs& at low cost which wire scheme you will use. Cive reasons
Answer!"
7easons!"
L Twisted $air 5thernet is the chea$est wiring that makes it so $o$ular.
L To allow changing the wiring without changing the interface hardware& ,I<s su$$ort
L )ulti$le wiring schemes are not limited to 5thernet technology.
L hubs *$hysically a star to$ology- to simulate a logical ring network.
L The distance between devices
L The amount of em"noise
756!! Fandouts 8age ,o. /4&/>

Gno.2 how many bits contains in A<I B A8I
Answer!"
L Airtual <hannel Indicator *3:"bits-
L Airtual 8ath Indicator *2" bit-&
756!! Fandouts 8age ,o. :>

Gno.; we have a bridge network that has two segments. is that $ossible to transfer data simultaneously through
segments
?nlike a re$eater& a bridge uses two ,I<s to connect two segments. It listens to all traffic and recogni'es frame format. It
also forwards only correct com$lete frames and discards the collided and error frames. A ty$ical bridge has two ,I<s& a
<8? a memory and a 7O). It only runs the code stored in its 7O). A network bridge can be used to segment one
network into two& thereby reducing the number of devices com$eting for transmission $rivileges.
+or eample,
if network A has 29 devices& there is the likelihood that two or more of them will attem$t to transmit data at the same
time and cause a collision. If a network bridge is added& it can s$lit network A into networks A and 0 of 39 devices each.
756!! Fandouts 8age ,o. 49

Gno.; is there any technology that use -A. an! /A. both topologies. i0 yes then write its
.ame
Star Topology, all com$uters are attached to a central $oint& which is sometimes called the Fub
&ing Topology network the com$uters are connected to each other in closed loo$. In this network first com$uter $asses
data to the second and then second $asses data to third and so on&
&E+"" 1an!outs 'age .o. 25

Qno.3 why packet switch check the hea!er 0rame be0ore 0orwar!ing the packet
Answer"#
#ata delivery from one com$uter to another is accom$lished through store and forward technology. In this technology
$acket switch stores incoming $acket and also forwards that $acket to another switch or com$uter. 6or this $ur$ose
$acket switch has internal memory into which it can hold $acket if outgoing connection is busy. 8ackets for each
connection held on %ueue.

Qno.5 /hy the !esigner o0 ATM technology select cells not packets5 6ive 0ive reasons
Answer"#
&eason"
3. AT) multi$lexed these 4;"byte cells instead of $ackets which reduced worst"case cell contention (itter by a
factor of almost ;9& reducing the need for echo cancellers.
2. 7eduction of (itter *and also end"to"end round"tri$ delays-
;. 6ull"length 3499 byte *32999"bit- data $acket would take >>./2 to transmit.
/. The design of AT) aimed for a low"(itter network interface
4. AT) broke u$ all $ackets& data& and voice streams into /2"byte chunks& adding a 4"byte routing header to each
one so that they could be reassembled later
http"77en.wikipe!ia.org7wiki7Asynchronous8Trans0er8Mo!e

Qno.4 %0 two 0ar away situate! o00ices are to connect with will be appropriate -A. etension or /A.. 6ive 0our
reasons to support you answer
3. If two buildings are located far from each other& a bridge& a $air of fiber modems and an o$tical fiber can be
used to connect two +A,s
2. +A, segments that need to be interconnected but are slightly far away& $oint to $oint wireless solutions are
available
;. They are generally ke$t over a tower so that line of sight is reali'ed between the locations& for best
$erformance.
/. These outdoor access $oints are configured to o$erate in the $oint"to"$oint or $oint"to"multi$oint modes and
one such access $oint along with antennaHtower is re%uired in each de$artmentHbuilding which needs to be
interconnected.
4. In certain areas& metro 5thernet might be available where the service $rovider has the infrastructure to connect
two locations of a same branch located in different $laces at s$eeds of 39H399 )b$s using his $ublic network
infrastructure

http"77www.ecitingip.com74597what#are#the#various#ways#to#eten!#a...
Qno.: writes three bene0its o0 routing i0 source a!!ress is not inclu!e! in the hea!er
Answer"#
0enefit
It allows fast and efficient routing.
8acket switch need not hove com$lete information about all destinations in s$ite it (ust has next The network can
continue to function even if to$ology changes without notifying entire network
&E+"" 1an!outs 'age .o. 5;

Qno.; 1ow many metho!s are available to span a network over longer !istances5 $ust write their names. <2 Marks=
Answer"#
3. +5AS5# S57IA+ +I,5 <O,,5<TIO,!
2. +5AS5# SAT5++IT5 <FA,,5+!

Qno.> which two i!enti0ier in ATM are use! to make ?irtual (ircuit5 <2 Marks-
Answer"#
A<I *Airtual <hannel Indicator-
A8I *Airtual 8ath Indicator-
&E+"" 1an!outs 'age .o. 4:

Qno.1@ conceptual Auestion about ?irtual private .etwork.<marks 9=
Answer"#
Airtual 8rivate ,etwork *A8,- combines the features of both $rivate and $ublic networks. It is limited to single
organi'ation and uses $ublic network for connectivity. These connections are sometimes called tunnels and connect
sites. 5ach site sees tunnel as $oint"to"$oint link. There is no access for other users of $ublic networks.
&E+"" 1an!outs 'age .o. :5

Qno.11 Bescribe the proce!ures in steps o0 Telephone calling, A connection oriente! service <Marks5=
Answer"
The connection"oriented service $aradigm for networking is similar to the manner in which tele$hones are used. This is
given as follows!

A caller dials a number of the destination. The tele$hone at the destination signals the arrival of a connection re%uest. If
the called $erson does not answerM the caller gives u$ after waiting for a timeout. If the called $erson does answer& then
the connection is established as binary connection identifier is given to each of the two $arties to enable identification of
the connection.
&E+"" 1an!outs 'age .o. 4:

Qno.12 Bescribe two maCor components o0 thick Ethernet <2=
Answer"#
3. ,etwork interface card *,I<-
2. Analog electronic device

Qno.19 Suppose in a computer network o0 a chemical company, each packet is trans0erre! with eAual amount o0 time
between systems. (onsi!er this scenario what will be the Citter5<2=
Answer"#
The amount of delay that a network introduces is called (itter. A network with 'ero (itter takes exactly the same amount
of time to transfer each $acket. A network with high (itter takes much longer to deliver some $ackets than others
&E+"" 1an!outs 'age .o. ;@

Qno.13 Suppose in university campus, bri!ges are use! in its local are network. Eplain all steps, how bri!ge buil! up
a!!ress list table o0 all attache! computers. <9=
Answer!"
?niversity cam$us im$lement bridges to attached the com$uters& bridges as a frame arrives to it& extracts a source
address from its header and automatically adds it in the list for that segment. In this way a bridge builds u$ address lists.
&E+"" 1an!outs 'age .o. 5@

Qno.15 Suppose an organization wants voice communication in a network by using ATM technology. Eplain how ATM
eliminates the varying !elays associate! with variable size !ata packets.
Answer"#
Organi'ation wants voice communication introduced AT) to meet several goals. It $rovides universal service for all
subscribers and su$$ort for all users for voice& video and data. It has a single unified infrastructure *no se$arate +A,s and
WA,s-. It gives guaranteed service when it is a$$ro$riate and su$$ort for low cost devices.
$%TTE&"
.itter is the term used for variance in transmission delays. .itter is significance for voice& video and data. In +A,s& (itter
can occur when a $acket is delayed because the network is busy.
'A()ET S%*ES"
+arge $ackets result in fewer overheads because a smaller fraction of the $acket is used for header information.
O$timum networks use /k0 $ackets or larger. +arge $ackets canNt easily be used for voice for exam$le 2"bit sam$les *at
324usec $er sam$le- would re%uire half a second to fill a /k0 $acket. 5cho cancellation can only be used with low
transmission delays.

Qno.14 /hile !esigning the ATM technology why !esigner o0 ATM chosen cells over packets which being use! wi!ely5
6ive 0ive reasons to support your answers.<5=
&eason"
3. AT) multi$lexed these 4;"byte cells instead of $ackets which reduced worst"case cell contention (itter by a
factor of almost ;9& reducing the need for echo cancellers.
2. 7eduction of (itter *and also end"to"end round"tri$ delays-
;. 6ull"length 3499 byte *32999"bit- data $acket would take >>./2 to transmit.
/. The design of AT) aimed for a low"(itter network interface
4. AT) broke u$ all $ackets& data& and voice streams into /2"byte chunks& adding a 4"byte routing header to each
one so that they could be reassembled later
http"77en.wikipe!ia.org7wiki7Asynchronous8Trans0er8Mo!e

Qno.1: Suppose star organization using repeater in its network. %0 0rames comes 0rom another network then will the
repeater be capable o0 !istinguish between 0rames 0rom two !i00erent networks5 Support your answer with a reason
also writes !own three !rawbacks, this organization may 0ace !ue to use o0 repeater.

Answer!"
Brawbacks
3. 7e$eaters $rovide no method for isolating traffic generated on one cable segment from traffic generated by
the other cable segment
2. When network uses a re$eater to connect cable segment A to segment 0 whether or not there is a station in
segment 0 that is the destination of the signal
;. 5thernet standard s$ecifies that any two stations cannot be se$arated by more than four re$eaters.
/. 7e$eaters do not recogni'e frame formatsM they (ust am$lify and retransmit the electrical signal. If a collision or
error occurs in one segment& re$eaters am$lify and retransmit also the error onto the other segments.
&E+"" 1an!outs 'age .o. 5@
Question D 1

/hat is the !i00erence between -A. an! /A.5
Answer
+ocal area network *+A,-
+A, is small in si'e covers the area within a room& building or cities.
Wide area network *WA,-
WA, is large in si'e and covers the area cities& countries and continents.

Question D 2

Be0ine the term $itter.
Answer

The term .itter is used for variance in transmission delays. .itter is significance for voice& video and data. .itter can occur
when a $acket is delayed because the network is busy.
Question D 9
6ive a comparison o0 the 0ollowing5

Thick Ethernet wiring scheme an! Thin Ethernet wiring scheme.

Answer

This uses thick coax cable. A?I cable or transceiver or dro$ cable connects from ,I< to transceiver. A?I cable carries
digital signal from ,I< to transceiver. The transceiver generates analog signal on coax cable. The wires in A?I carry digital
signals $ower and other control signals. Thick 5thernet also re%uires terminators to avoid signal reflectance.

Thin 5thernet uses thin coax cable that is chea$er and easier to install than thick 5thernet coax. In thin 5thernet wiring
scheme transceiver electronics are built into ,I< and ,I< connect directly to network medium. <oax cable use connector
on ,I<. <oax runs directly to back of each connected com$uter by T"connector. The T"connector directly attaches to ,I<.
Question D 3

1ow can Switche! ?irtual .etwork be establishe!5
Answer

)ost networks offer dynamic connections that last for a relatively short time. AT) can dynamically establish a switched
virtual circuit SA< that allows it as long as necessary and then terminate it. The com$uter sends a connection re%uest to
the switch to which it is attached. Software in the switch finds a $ath to the destination and sends with the connection
re%uest. 5ach $air of switches in the $ath communicates to choose a A8IHA<I for their tables. Once the connection is
established a message is given back to the originating com$uter to indicate the SA< is ready.

Question D 5
Bescribe permanent virtual circuits <'?(=.

Answer

AT) can $rovide the virtual circuits that look like traditional leased digital circuits. The $ermanent virtual circuits 8A<
works as long as the customer $ays the $eriodic fee for its use. The forwarding table enter configured the terms used by
Telco 8rovisioning re%uires two ste$s.

To determine a com$lete $ath.

To choose a$$ro$riate A8IHA<I for each ste$ in the $ath and configures each ad(acent $air of switches.

Question D 4
/hat are !e0ault routes !raw the table.
Answer www.vustudents.ning.com

7outing table entries can colla$se with a default route. If destination doesnNt have in ex$licit routing table entry and then
it use a default route. It is shown in the below table.

Table

#estination ,ext ho$#estination
,ext
ho$ #estination
,ext
ho$ #estination
,ext
ho$
3 " 2 " 3 ;&3 2 /&2
O 3&; / 2&/ 2 ;&2 / "
O 2&; ; " O /&;
/ ;&/
,ode 3 ,ode 2 ,ode ; ,ode /

Question D :

/hat is the !i00erence between the physical an! logical topologies5
Answer

5very +A, has a to$ology& or the way that the devices on a network are arranged and how they communicate with each
other.
'1ES%(- TF'F-F6E"
The way that the workstations are connected to the network through the actual cables that transmit data "" the $hysical
structure of the network "" is called the $hysical to$ology. %t !epen!s on the wiring scheme.
-F6%(A- TF'F-F6E"
The logical to$ology& in contrast& is the way that the signals act on the network media& or the way that the data $asses
through the network from one device to the next without regard to the $hysical interconnection of the devices. We can
say that it is !e0ine! by the speci0ic network technology.

Question D ;
Be0ine ?ector#Bistance Algorithm.
Answer

8acket switches wait for next u$date message and they iterate through entries in message. If entry has shortest $ath to
destination& insert source as next ho$ to destination and record distance as distance from next ho$ to destination $lus
distance from this switch to next ho$.

Question D >
/hat is the concept o0 store an! 0orwar! technology5
Answer

STF&E A.B +F&/A&B"
#ata delivery from one com$uter to another is accom$lished through store and forward technology. In this technology
$acket switch stores incoming $acket and also forwards that $acket to another switch or com$uter. 6or this $ur$ose
$acket switch has internal memory into which it can hold $acket if outgoing connection is busy. 8ackets for each
connection held on %ueue.

Question D 1@

1ow can Switche! ?irtual .etwork be establishe!5
Answer
www.vustudents.ning.com

S/%T(1EB ?%&TGA- (%&(G%TS"

)ost networks offer dynamic connections& which last for a relatively short time.
To handle this& AT) can dynamically establish a switched virtual circuit *SA<-& allow it last as long as necessary and then
terminate it.
The terminology comes from the TelcoNs where switching system normally refers to all switching.

ESTAH-%S1%.6 A. S?("

The com$uter sends a connection re%uest to the switch to which it is attached.
Software in the switch finds a network $ath to the destination and sends along the connection re%uest.
5ach $air of switches in the $ath communicates to choose a A8IHA<I for their tables. Once the connection is established
by the destination& a message is sent back to the originating com$uter to indicate the SA< is ready.
If any switch or the destination com$uter does not agree to setting u$ the A<& an error message is sent back and the SA<
is not established

Question D 11

1ow can a bri!ge know whether to 0orwar! 0rames5
Answer

The bridge builds a list of )A< addresses on either side of the bridge. Therefore& it knows which $ackets should be
forwarded to the other side and which should not. )ost bridges are self"learning bridges. As soon as a frame arrives to a
bridge& it extracts a source address from its header and automatically adds it in the list for that segment. In this way a
bridge builds u$ address lists.
In the exam$le of a $acket that uses a )A< address not in its table it can err on the side of caution by forwarding the
$acket.

Question D 12

(ompare connection oriente! an! connectionless Service.
Answer

(onnection#Friente! vs. (onnectionless Service
This characteristic s$ecifies whether conversations take $lace in a more or less structured manner. When using
a connection#oriente! $rotocol& you incur the overhead of setting u$ a virtual circuit *a defined communications $ath-
between the sender and receiver& which is maintained until the sender and receiver have com$leted their entire
conversation.
When the conversation is com$leted& you incur the overhead of tearing down the virtual circuit. <onnection"oriented
$rotocols $rovide guaranteed delivery of messages in the order in which they were sent.
<ontrast this with (onnectionless service& which does not re%uire establishing a session and a virtual circuit. This can be
found in the network layer or trans$ort layer& de$ending on the $rotocol. Pou can think of a connectionless $rotocol as
being akin to mailing a $ost card. Pou send it and ho$e that the receiver gets it. <ommon features of a connectionless
service are!
8ackets do not need to arrive in a s$ecific order
7eassembly of any $acket broken into fragments during transmission must be in $ro$er order
,o time is used in creating a session
,o Acknowledgement is re%uired.
The largest connectionless network in use today is the Internet

Question D 19
/hich type o0 in0ormation is obtaine! 0rom network sni00er an! in which mo!e .etwork sni00er operates5

Answer"
A network analy'er also called network monitor or a network sniffer is used to examine the $erformance of or debug a
network. It can re$ort statistics such as ca$acity utili'ation& distribution of frame si'e& collision rate or token circulation
time
'ost installations still %se #I( Ethernet encoding in which
there is no //&01234 header in the frame. 3 network
analy5er can tell from the val%es in the type field *small
val%es are lengths, which mean an //&01234 header is
located in the first octets of the data area6 large val%es are
types, which mean no //&01234 header is incl%ded..

The o$eration of network analy'er is a com$uter with a network interface that receives all frames& which is called
$romiscuous mode. So many deskto$ com$uters have interface that can be configured for $romiscuous mode. When
combined with software com$uter can examine any frame on +A,. In this way the communication across +A, is
guaranteed to be $rivate. <om$uter receives and dis$lays frames on the +A,.
,etwork analy'er can be configured to filter and $rocess frames. It can count frames of s$ecific ty$e of si'e. It dis$lays
only frames from or to s$ecific com$uters.

Question D 13

Bi00erentiate b7w Thin Ethernet, Thick Ethernet an! Twiste! 'air Ethernet5

Answer

Thick Ethernet"
Thick 5thernet& officially known as 39 0ase"4& is the oldest form of 5thernet.
One form of cabling su$$orted by 5thernet is low"loss 49 Ohm coaxial cable as shown in the figure below. This ty$e of
cable is 9.4Q diameter *usually su$$lied with a yellow outer 8A< coating- and rather inflexible. It has become known in
the communications industry as QThick 5thernetQ. The official name for this cable is 39 0aseband4 *3904-& indicating that
it is s$ecified for baseband communications at 39 )b$s over distances u$ to 499m.

Thin Ethernet"

Thin 5thernet& officially called 39 0ase"2& is a less ex$ensive version of 39 0ase"4 *Thick 5thernet- technologies. It uses a
lighter and thinner coaxial cable and dis$enses with the external transceivers used with 39 0ase"4.

39 0ase"2 uses an 7C"42AH? coaxial cable and is wired in a bus to$ology. 5ach device on the network is connected to the
bus through a 0,< QTQ ada$ter& and each end of the bus must have a 49 Ohm terminator attached. 5ach node on the bus
must be a minimum of 9.4 meters *3.4 feet- a$art& and the overall length of the bus must be less than 324 meters *:9:
feet-.

Twiste! 'air Ethernet"

Twisted 8air 5thernet *39baseT-& sometime also called Q?T8Q from Q?nshielded Twisted 8airQ& is based on using a cable
similar to $hone"wiring. The cable is connected via 7."/4 connectors to the network card installed in the 8<.

Question D 15
-%ST SFME (1A&A(TE&%ST%(S F+ A (-%E.T5

Answer

The characteristics of a client are ex$lained below!
Q<lient is an arbitrary a$$lication $rogram.
QIt becomes client tem$orarily.
QIt can also $erform other com$utations.
QIt is invoked directly by the user.
QIt runs locally on the userNs com$uter.
QIt actively initiates contact with a server.
QIt contacts one server at a time.

Question D 14
Eplain T(' Segment +ormat5
Answerwww.vustudents.ning.com

T<8 uses single format for all messages. T<8 uses the term segment to refer to a message. 5ach message sent from T<8
on one machine to T<8 on another machine uses this format including data and acknowledgement.

Question D 1:
/hat is %'v4 A!!ress .otation5
Answer

322"bit addresses unwidely in dotted decimalM re%uires 3: numbers!
394.229.3;:.399.244.244.244.244.9.9.32.322.3/9.39.244.244
:=#<! 22:/! 6666! 6666! 9!3229!2<9A! 6666
Rero"com$ression S series of 'eroes indicated by two colons
669<! 9!9!9!9!9!9!03
669<!!03
I8v: address with =: leading 'eros is inter$reted to hold an I8v/ address

Question D 1;

1ow much !ata can present on original Ethernet segment at one time5 To 0in! out compute the !elay#throughput
pro!uct. The original Ethernet operate at 1@ mega bits per secon!, an! a segment was limite! to 5@@ meters. Assume
the signals propagate !own the cable at 44 percent o0 the spee! o0 light5
Answer

S$eed of light T 2== >=2 /42 m H s

0andwidthT39
#elay T :: $ercent of s$eed of light T3=>2:;922 mHs

0andwidth #elay $roductT 2/>;22>>>499

Question D 1>

Eplain these terms
Star topology, &ing topology, +rame5

Answer

+&AME"
A frame or hardware frame denotes a $acket of a s$ecific format on a s$ecific hardware technology
&%.6 TF'F-F6E

In this to$ology of network the com$uters are connected to each other in closed loo$.

STA& TF'F-F6E

In this to$ology& all com$uters are attached to a central $oint& which is sometimes called the Fub

Question D 2@
Eplain the term bri!ge an! its 0unctions

Answer
A bridge kee$s a list for each segment that consists of $hysical addresses of the com$uter attached to that segment. In
this way a bridge knows on which segment a destination com$uter is attached.
)ost bridges are self learning bridges. As soon as a frame arrives to a bridge& it extracts a source address from its header
and automatically adds it in the list for that segment. In this way a bridge builds u$ address lists.
A bridge is a hardware device also used to connect two +A, segments to extend a +A,.
67A)5 6I+T57I,C
The most im$ortant task a bridge $erforms is frame filtering. If both the source and destination are on the same
segment& it does not forward the frame to the other segment. A frame is forwarded to the other segment& if it is
destined to that segment.


Question D 21
Eplain .%( an! (omputer 'rocessing5
Answer

.%( A.B ('G '&(ESS%.6"
,I< contains sufficient hardware to $rocess data inde$endent of system <8?. In which some ,I<s contain se$arate
micro$rocessor. In addition to this it also include analog circuitry interface to system bus& buffering and $rocessing

Question D 22
/hat is 'arity (hecking5 Eplain
Answer

8arity checking
To detect the error there are different schemes for which $arity checking is also common used& in $arity checking& $arity
refers to the number of bits set to 3 in the data item. A $arity bit is an extra bit transmitted with data item chose to give
the resulting bit even or odd $arity

Question D 29
/hat !o you know about BCikstraIs algorithm5
Answer

BCikstraIs algorithm
#(ikstraNs algorithm can accommodate weights on edges in gra$h. The shortest $ath is then the $ath with lowest total
weight.

Question D 23
/hat are the uses o0 &epeater5
Answer

7e$eater is a networking device
A re$eater is used to increase the signal strength. It am$lifies the weakening signal received from one segment and then
retransmits onto another segment
'c$7s of cs810 In one 'ega file
9%estion 2o: 1 * 'arks: 1 . ; 4lease choose one

A
---------- relies on the hardware manufacturer to assign a unique physical address to each network
interface.
< 1tatic addressing scheme
< Configurable addressing scheme
< Dynamic addressing scheme
< None of the given
9%estion 2o: , * 'arks: 1 . ; 4lease choose one

An
interface for thin Ethernet must have an connector ! and must generate signals according
to the specification.
< =>;?5, 10 Base T
< "#-$%! &' (ase %
< (NC! &' (ase )
< (NC! &' (ase *
9%estion 2o: - * 'arks: 1 . ; 4lease choose one

A
system with redundant bridges might have a problem with in the system.
< /oop
< +ilters
< ,panning *rees
< All given choices
9%estion 2o: ? * 'arks: 1 . ; 4lease choose one
A (ridge can
< +ilter a frame
< +orward a frame
< E-tend a .AN
< #o all the a"ove
is used for typical data applications /where the data rate may be unknown and bursty0 and
allows use of whatever bandwidth is available at a given time.
< Constant (it "ate /C("0 service
< 1ariable (it "ate /1("0 service
< 3vaila"le Bit =ate *3B=. service
< None of the given

3*2
assigns each 1C a identifier that is divided two parts to produce a hierarchy.
< )&-bit
< ))-bit
< )3-bit
< ,?;"it
9%estion 2o: * 'arks: 1 . ; 4lease choose one

of *C4564 layering model! corresponds to basic network hardware.

< 4hysical /ayer
< Network 6nterface .ayer
< 6nternet .ayer
< *ransport .ayer
9%estion 2o: + * 'arks: 1 . ; 4lease choose one
places the boundary between the second and third octets
< &lass 3
< Class (
< Class C
< Class D

7D4 and *C4 are both layer protocols
< 4hysical
< Data link
< Network
< Transport

Conn
ection-oriented service! 4oint-to-point! Complete reliability! +ull-duple- communication! ,tream
interface! "eliable connection startup and 8raceful connection shutdown are the services provided
by
< 64
< None of the given
< T&4
< 7D4
protocols of *C4564 layering model specify how to ensure reliable transfer.
< 4hysical .ayer
< 6nternet .ayer
< Transport /ayer
9%estion 2o: 1, * 'arks: 1 . ; 4lease choose one

identifies which application program on receiving computer should receive the data
< .ogical address
< ,ource port
< #estination 4ort
< None of the given
9%estion 2o: 1- * 'arks: 1 . ; 4lease choose one
identifies the application program that sent the data.
< Destination 4ort
< 1o%rce port
< .ogical address
< None of the given
9%estion 2o: 1? * 'arks: 1 . ; 4lease choose one

9hic
h of the following are interior routing protocols:
< =I4
< ;,4+
< (84
< "64 and ;,4+

*he
(order 8ateway 4rotocol /(840 uses for all communication
< 7D4
< T&4
< (oth 7D4 and *C4
< None of the given
measures distance in network hops! where each network between the source and destination
counts as single hop.
< (84
< ;,4+
< =I4
< None of the given

;,4+
is based on--------
< Distance vector routing
< /ink state ro%ting
< 4ath vector routing
< Distance vector routing and .ink state routing
9%estion 2o: 1+ * 'arks: 1 . ; 4lease choose one

performs local multicast and uses 64-in-64 encapsulation to send multicast datagrams from one site
on the 6nternet to another.
< #istance @ector '%lticast =o%ting 4rotocol *#@'=4.
< Core (ased *rees /C(*0
< 4rotocol 6ndependent 2ulticast Sparse Mode (PIM-SM)
< 4rotocol 6ndependent 2ulticast Dense Mode (PIM-DM)
*he length of time required to send a variable length packet is variable and does not require a complicated
interrupt scheme to detect completion of transmission.
< *rue
< Aalse
9%estion 2o: ,0 * 'arks: 1 . ; 4lease choose one

NE<
* =EADE" field in the base header defines type of header and it appears at end of fi-ed-si>e base header.
< Tr%e
< +alse

Altho
ugh message e-change can be used to bind addresses! sending a request for each binding is hopelessly
inefficient.
< Tr%e
< +alse
9%estion 2o: ,, * 'arks: 1 . ; 4lease choose one
Address mask defines how many bits of address are in suffi-:
< *rue
< Aalse
9%estion 2o: ,- * 'arks: 1 . ; 4lease choose one
A computer attached to a given network can only communicate with other computers attached to the same
network. 6s this a problem with multiple networks:
< Tr%e
< +alse
9%estion 2o: ,? * 'arks: 1 . ; 4lease choose one

6n the
&?@'s large organi>ations began to acquire multiple networks. Each network in the organi>ation formed
island. Employees needed to choose a computer appropriate for each task. ,o they needed multiple
screens! keyboards and computers.
< +alse
< Tr%e

*he
term self-identifying is used for Classful 64 addresses because the class of the address can be computed
from the address.
< itself
< prefi-
< suffi-
< mask

6n
which method of Address "esolution 4rotocol the protocol address independent of hardware address
9ere A*A stands for *able lookup! ACA for Closed-form Computation and ADA for Data E-change:
< *! C
< D
< C
< T, #

6n
which method of Address "esolution 4rotocol the protocol address is determined by hardware address:
< *
< D
< &
< *! C
9%estion 2o: ,+ * 'arks: 1 . ; 4lease choose one

"eco
nstruction of original datagram is called reassembly.
< Tr%e
< +alse

A
computer needs a complete stack of protocols to run either a client or a server.
< Tr%e
< +alse
9%estion 2o: -0 * 'arks: 1 . ; 4lease choose one

*C4
uses mechanism to control the flow of data.
< door
< window
< acknowledgment
< retransmission
9%estion 2o:-1 *'arks: 1. ; 4lease choose one
representation of links that connect nodes is called as physical topology.
B geometrical
B logical
B physical
9%estion 2o: -, * 'arks: 1 . ; 4lease choose one
*he internet model consists of layers.
B three
B two
B five
B seven
9%estion 2o: -- * 'arks: 1 . ; 4lease choose one
Encryption and encoding are the same terms.
*rue
B +alse
9%estion 2o: -? * 'arks: 1 . ; 4lease choose one
he amplitude of a digital signal depends upon the to represent a bit.
B phase
B voltage
B wavelength
*he inversion of the level at & bit is called as
BN"C-.
B N"C-6
B "C
2odulation of an analog signal can be accomplished through changing the of the
carrier signal.
B amplitude
B frequency
B phase
B all of the given
6f +CC regulations are followed! the carrier frequencies of adDacent A2 radio stations are
apart.
B % E=>
B &' E=>
B )'' E=>
B %3' E=>
9%estion 2o: -+ * 'arks: 1 . ; 4lease choose one
Category % 7*4 cable is used for data transmission of upto.
B &'' 2bps
B )'' 2bps
B )%' 2bps
B $'' 2bps
*he "8 number gives us information about .
B *wisted pairs
B Coa-ial cables
B ;ptical fibers
B all of the given
9%estion 2o: ?0 * 'arks: 1 . ; 4lease choose one
*he inner core of an optical fiber is in composition.
B 8lass plastic
B Copper
B (imetallic
B .iquid
All of popular +iber optic connectors are shaped.
B Conical
B (arrel
B Circular
B "ectangular
9%estion 2o: ?, * 'arks: 1 . ; 4lease choose one
*he 1.+ and .+ bands use propagation for communications.
B 8round
B ,ky
B .ine of sight
B ,pace
9%estion 2o: ?- * 'arks: 1 . ; 4lease choose one
2ultiple-ing is the set of techniques that allows simultaneous *< of multiple signals across
data link
B ,ingle
B 2ulti
B ,ingle and 2ulti
B none of the given
9%estion 2o: ?? * 'arks: 1 . ; 4lease choose one
A portion of the path that carries *< b5w a given pair of devices is known as .
B Node
B (ridge
B Channel
B 8ateway
9hich error detection method involves polynomials:
B Checksum
B *wo-dimensional parity check
B C"C
B ,imple parity check
6f the A,C66 character 8 is sent and the character D is received! what type of error is this:
B ,ingle-bit
B 2ultiple-bit
B (urst
B "ecoverable
9hich error detection method involves the use of parity bits:
B ,imple parity check F two dimensional parity check
B C"C
9%estion 2o: ?+ * 'arks: 1 . ; 4lease choose one
9hich error detection method can detect a single-bit error:
B C"C
B All of the given
*he =amming code is a method of
B Error detection
B Error correction
B Error ecapsulation
B Error detection F Error encapsulation
9%etion 2o: 50 * 'arks: 1 . ; 4lease choose one
,liding window requires that data frames be transmitted
B ,equentially
B +requently
B ,ynchronously
B Asynchronously
6n selective-reDect A"G! only the specific damaged or lost frame is.
B "etransmitted
B +orwarded
B ,elected
B "eDected
9hich of the following sublyer! resolves the contention for the shared media
B 2AC
B ..C
B4hysical
*he 4D7 has no flag fields! no C"C! and no station address
B *"7E
B +A.,E
6EEE divides the base band category into standards.
B %
B $
B 3
B H
.ike &' (ase %! &' (ase ) is a topology .AN
B "ing
B 2esh
B ,tar
B (us
Check sum method is used for layers.
B 4hysical
B Application
B *ransport
B Datalink
"epeater works on layer.
B Data .ink
B 4hysical
B Network
B Application
*runks are transmission media such as that handle the telephone to the nearest end
office.
B ,atellite links
B *wisted-pair F +iber-optic
B *wisted-pair
B +iber-optic
9hich of the following uses a series of filters to decompose multiple-ed signal into
its constituent signals.
27<
B DE27<
B ,witch
B (ridge
6n +ast Ethernet! data rate can be increased by collisions.
B 6ncreasing
B Decreasing
B Eeeping Constant
B None of the given
Computer networks are often called -------------- because they use packet technology.
< Ethernet
< ,witch networks
< 4acket networks
< 2one of the given
A network uses a ------arranges for computers to be connected in a closed loop.
< ,tar *opology
< =ing Topology
< (us *opology
< None of the given
6n a ring topology each computer is connected to other thorough a ring
An ------------method! the network hardware designers specify how type information is included in the
frame and the value use to identify various frame types.
< E)plicit frame type
< 6deal frame type
< 6mplicit frame type
< None of the given
E<4.6C6* +"A2E *I4EJ
6n this type the identifying value is included with frame describes types of
included data.
An interface for thin Ethernet must have an connector ! and must generate signals
according to the specification.
< =>;?5, 10 Base T *reference not availa"le.
< "#-$%! &' (ase %
< (NC! &' (ase )
< (NC! &' (ase *
A (ridge forwards or filters a frame by comparing the information in its address table to the
frameKs
< .ayer ) source address
< ,ource nodeKs physical address
< /ayer , destination address
< .ayer 3 destination address
2ost 9AN systems include a mechanism that can be used to eliminate the common case of duplication
routing is called
< =ierarchal address
< #efa%lt ro%te
< ,hortest path
< None of the given
2ost 9AN systems include a mechanism that can be used to eliminate the common case of duplication
routing is called Default route. *he mechanism allows a single entry in a forwarding table to replace a
long list of entries that have the same ne-t hope value
of *C4564 layering model! corresponds to basic network hardware.
< 4hysical /ayer
< 6nternet .ayer
< *ransport .ayer
.AIE" &J
Corresponds to basic network hardware layer in ;,6
4rotocols of *C4564 layering model specify how to ensure reliable transfer.
< 4hysical .ayer
< 6nternet .ayer
< *ransport .ayer
*he 6nternet layer in the *C4564 reference model is responsible for transferring data between the source
and destination computers
is called an end-to-end protocol because it provide a connection directly from an application on
one computer to an application on a remote computer.
< 64
< B#4
< *C4
< None of the given
7D4 has the following characteristics.
6t is an end-to-end protocol. 6t provides application-to-application communication.
uses distance vector approach to define routing
< (84
< ;,4+
< =I4
< None of the given
#I1T32&E;@E&TC= =CBTI2D:
L 6t is very simple to implement.
L 4acket switch updates its own routing table first.
L 6t is used in "64.
is ideal in a situation where the group is small and all members are attached to contiguous
.ocal Area Networks.
< Alood;and ;4r%ne
< Configuration-and -*unneling
< Core-(ased Discovery
< None of the give''HE
A/CC#;32#;4=B2E:
+lood-and-prune is ideal in a situation where the group is small and all members
Are attached to contiguous .ocal Area Networks.
"outer that decrements **. to sends 6C24 time e-ceeded message! with routerKs address as source
address
< 3
< )
< &
< 0
"outer that decrements **. to ' sends 6C24 time e-ceeded message! with routerKs
address as source address
4rotocol addresses are abstractions provided by .
< =ardware
< 1oftware
< ;perating system
< 6nternet
4";*;C;. ADD"E,,E, AND 4ACEE* DE.61E"IJ
4rotocol addresses are abstractions provided by software
Although message e-change can be used to bind addresses! sending a request for each binding is
hopelessly inefficient.
< Tr%e
< +alse
CA,=6N8 A"4 "E,4;N,E,J
Although message e-change can be used to bind addresses! sending a request for
each binding is hopelessly inefficient
A"4 is almost always used to bind a -bit 64 address to a -bit Ethernet address.
< -,, ?+
< )$! 3)
< 3)! H$
< 3)! &)M
A"4 is almost always used to bind a 3)-bit 64 address to a $M-bit Ethernet address
6n the &?@'s large organi>ations began to acquire multiple networks. Each network in the organi>ation
formed island. Employees needed to choose a computer appropriate for each task. ,o they needed
multiple screens! keyboards and computers.
< +alse
< Tr%e
6n the &?@'s large organi>ations began to acquire multiple networks. Each
Network in the organi>ation formed island. Employees needed to choose a
computer appropriate for each task. ,o they needed multiple screens! keyboards
And computers.
9%estion 2o: * 'arks: 1 . ; 4lease choose one
6n which method of Address "esolution 4rotocol the protocol address is determined by hardware address:
Aeat%res

Types of
=esol%tion
7se full with any hardware *
Address change affects all hosts *
4rotocol address is determined by
hardware address
C
< *
< D
< &
< *! C

*he general form of an 64 datagram is with a header followed by data. *he header contains information
that controls where and how the datagram is to be sent.
< Tr%e
< +alse
=eader contains all information needed to deliver datagram to the destination
Computer. 6t containsJ
L Destination address
L ,ource address
L 6dentifier
L ;ther delivery information
*o save traffic! an E84 does not summari>e routing information from the autonomous system before
passing it to another autonomous system.
< *rue
< +alse
A6t provides routing among autonomous systems /E840.
9%estion 2o: +0 * 'arks: 1 . ; 4lease choose one
9hich of the following is a correct representation of the 64vH:
< 105.,,0.1-8.100.,55.,55.,55.,55.0.0.1+.1,+.1?0.10.,55.,55
< &'%.))'.&3H.&''.)%%.)%%.)%%.)%H.'.'.&M.&)M.&$'.&'.)%%.)%%
< &'%.))'.&3H.&''.)%%.)%%.)%%.)%%.'.'.&M.&)M.&$'.&'.)%%.)%%.)%H
< &'%.))'.&3H.&''.)%%.)%%.)%%.)%%.'.'.&M.&)M.&$'.&'.)%%
&)M-bit addresses unwieldy in dotted decimalN requires &H numbersJ
&'%.))'.&3H.&''.)%%.)%%.)%%.)%%.'.'.&M.&)M.&$'.&'.)%%.)%%
*he number of connections needed for N computer in direct point to point communication is equal toJ
< *2
,
E2.0,
< N/N- &0
< N
)
< None of the given
Aor Fn7 comp%ters connections in direct point to point comm%nication G *nH, En.0,.

9%estion 2o: +, * 'arks: 1 . ; 4lease choose one
9hen an application--------------- data! it makes a copy of the data available to all other computers on the
network.
< (roadcasting
< 2ulticasting
< 7nicasting
< 2one of the given *not s%re.
9%estion 2o: +- * 'arks: 1 . ; 4lease choose one
Ethernet uses a ------ bit static addressing scheme in which each device is assigned a unique address by
the manufacturer.
< H$
< ?+
< 3)
< M
Ethernet %ses a ?+;"it static addressing scheme
9%estion 2o: +? * 'arks: 1 . ; 4lease choose one
A system with redundant bridges might have a problem with in the system.
< /oop
< +ilters
< ,panning *rees
< All given choices
*he product of delay and throughput measures the of data that can be present on the network.
< Area
B 1olume
< .ength
< None of the given
It is computed as delay time multiplied by effective throughput. It measures amount of data that can be
present in the networ
Connectionless service! 2essage-;riented protocol! best effort delivery service! arbitrary interaction and
operating system independent are the characteristics of
< *C4
< B#4
< 64
< None of the given
B#4 has the following characteristics.
I It is an end;to;end protocol. It provides application;to;application comm%nication.
I It provides connectionless service.
I It is a 'essage;Criented protocol.
I It %ses "est;effort delivery service.
I It follows ar"itrary interaction.
I It is operating system independent
Connection-oriented service! 4oint-to-point! Complete reliability! +ull-duple- communication! ,tream
by
< None of the given
< T&4
< 7D4
< 64
1E=@I&E 4=C@I#E# BJ T&4:
Aollowing are the services provided "y T&4:
I &onnection;oriented service
I 4oint;to;point
I &omplete relia"ility
I A%ll;d%ple) comm%nication
I 1tream interface
I =elia"le connection start%p
I Dracef%l connection sh%tdown
9%estion 2o: ++ * 'arks: 1 . ; 4lease choose one
*he process of using a routing table to select a ne-t hop for a given datagram is called
< Encapsulation
< "eassembling
< =o%ting or forwarding
< None of the given
< (84
< ;,4+
< =I4
< None of the given
I It is very simple to implement.
I 4acket switch %pdates its own ro%ting ta"le first.
I It is %sed in =I4.
A multicast routing scheme in which the protocol software builds a delivery tree from a central point is
called
< Distance 1ector 2ulticast "outing 4rotocol /D12"40
< &ore Based Trees *&BT.
< 4rotocol 6ndependent 2ulticast Sparse Mode (PIM-SM)
< 4rotocol 6ndependent 2ulticast Dense Mode (PIM-DM)
&C=E B31E# T=EE1 *&BT.:
3 m%lticast ro%ting scheme in which the protocol software "%ilds a delivery tree
from a central point.
;ne repeater ! two repeaters the ma-imum cable length limitation.
< doubles! cancel
< do%"les, triple
< square roots! cude roots
< and! triple
Cne repeater do%"les, two repeaters triple the ma)im%m ca"le length limitation.
9henever it handles a packet! 64 software needs to separate the destination address into a and
.
< postfi-! 6nfi-
< non of these
< 6nfi-! prefi-
< prefi), s%ffi)
Khenever it handles a packet, I4 software needs to separate the destination address into a prefi)
and s%ffi)
Although message e-change can be used to bind addresses! sending a request for each binding is
< Tr%e
< +alse
&31LI2D 3=4 =E14C21E1:
3ltho%gh message e)change can "e %sed to "ind addresses, sending a re$%est for
each "inding is hopelessly inefficient.
< -,, ?+
< )$! 3)
< 3)! H$
< 3)! &)M
3=4 is almost always %sed to "ind a -,;"it I4 address
to a ?+;"it Ethernet address
End-to-end delivery service is connection oriented.
< *rue
< Aalse
End;to;end delivery service is connection less
A single networking technology is best for all needs.

< *rue

< Aalse
There is no single networking technology that is "est for all needs
6n the &?@'s large organi>ations began to acquire multiple networks. Each network in the organi>ation
formed island. Employees needed to choose a computer appropriate for each task. ,o they needed
multiple screens! keyboards and computers.
< +alse
< Tr%e
In the 190s large organi5ations "egan to ac$%ire m%ltiple networks. Each network in the
organi5ation formed island. Employees needed to choose a comp%ter appropriate for each task. 1o
they needed m%ltiple screens, key"oards and comp%ters.
9hich method of Address "esolution 4rotocol is useful with any hardware:
Kere MTM stands for Ta"le look%p, M&M for &losed;form &omp%tation and M#M for #ata
E)changeN
Aeat%res

Types of
=esol%tion
hardware address
C
< T
< C
< D
< C! D

9%estion 2o: 99 *'arks:1 . ; 4lease choose one
E)changeN
Aeat%res

Types of
=esol%tion
hardware address
C
< *
< D
< &
< *! C
9e use the term to refer to a measure of the path that routing software use when choosing a
route.
< routing path
< ro%ting metric
< routing
switching
Ke %se the termro%ting metric to refer to a meas%re of the path that ro%ting software %se when
choosing a ro%te
9%estion 2o : 101 *'arks: 1. ; 4lease choose one
6n Direct point to point communication adding the Nth computer requires------------ new connections.
B None of the given
B N)
< 2;1
B /N) ON05)
disadvantage In #irect point to point comm%nication is that adding a new comp%ter to the network
re$%ires 2;1 new connections .*4O ,-.
6n 4oint-to-4oint topology there are two topologies.
B *ree and "ing
B ,tar and "ing
< 1tar and Tree
B None of the given
4;6N*-*;-4;6N*J
6n Point-to-Point topology there are two topologies.
&0 ,*A" topology
)0 *"EE topology
6n -------------! network occupies the smaller area like a room a floor or a building
< /32
B 9AN
B 2AN
B None of the given
In /32 network occ%pies the smaller area like a room a floor or a "%ilding.*4O ?.
=ardware that calculates a C"C uses two simple components.
B AND unit and <;" unit
< 1hift register and (C= %nit
< ,hift register and AND unit
B None of the given
C"C uses Dust two hardware componentsJ
,hift register
E-clusive ;" / <;" unit 0 .(P! "#)
C"C can detect more errors than a simple checksum.
B true
B false
*he 8igabit Ethernet hardware operates at a rate of --------
B &' 2bps
B &'' 2bps
< 1000 '"ps
B None of the given
Diga"it Ethernet that operates at 1 D"ps *1000 '"ps. over fi"er optics and twisted pair Ethernet ca"les.
+ormally named informally known as the twisted pair Ethernet or *4 Ethernet.
B &' (ase )
B &' (ase %
< 10 Base T
B None of the given
$#%&S'-()
This is another standard of wiring scheme. It is commonly called 10Base;T, Twisted 4air or T4 Ethernet.
*4O ?-.
An interface for thin Ethernet must have an connector ! and must generate signals according to
the specification.
< =>;?5, 10 Base T
B "#-$%! &' (ase %
B (NC! &' (ase )
B (NC! &' (ase *
A system with redundant bridges might have a problem with in the system.
< /oop
B +ilters
B ,panning *rees
B All given choices
computes shortest paths in a graph by using weights on edges as a measure of distance.
B 8reedy algorithm
B Distance vector algorithm
< #iPksta7s algorithm
B Non of the given
#Pikstra7s algorithm can accommodate weights on edges in graph. The shortest
path is then the path with lowest total weight *s%m of the weight with all edges.. It sho%ld
"e noted that the shortest path is not necessarily with fewest edges *or hops..
(asic .AN technologies such as Ethernet! *oken "ing! and +DD6 use a .
B Connectionless service paradigm
B Connection-oriented service paradigm
< Both &onnectionless and &onnection;oriented service paradigm
B None of the given
G%estion 2o: 11, * 'arks: 1 . ; 4lease choose one
B 4hysical .ayer
B Network 6nterface .ayer
B 6nternet .ayer
< Transport /ayer
/3JE= ?: ens%re relia"le transfer layer ? in T&4 layering model is transport layer.
An 6nternet Address /64 address0 is a unique binary number assigned to a host and used for all
communication with host
B $M-bit
< -,;"it
B )$-bit
B None of the given
3n Internet address *I4 address. is a %ni$%e -,;"it "inary n%m"er assigned to a
host and %sed for all comm%nication with the host
*he address identifies the physical network to which the computer is attached! while the
identifies an individual computer on that network.
B prefi- ! suffi-
< s%ffi) , prefi)
B suffi- ! suffi-
B None of the given
4"E+6<J
6t identifies the physical network to which the computers are attached.
,7++6<J
6t identifies an individual computer on the network.
places the boundary between the first and second octets
< &lass 3
B Class (
B Class C
B Class D
Class A places the boundary between the first and second octets. Class ( places the boundary between the
second and third octets! and class C places the boundary between the third and fourth octets.
places the boundary between the third and fourth octets.
B Class A
B Class (
< &lass &
B Class D
Class A places the boundary between the first and second octets. Class ( places the boundary between the
second and third octets! and class C places the boundary between the third and fourth octets.
field of header indicates whether a datagram is a fragment or a complete datagram.
B +.A8,
B +.A82EN* ;++,E*
B 6DEN*6+6CA*6;N
< 2one of the given
A=3D'E2T3TIC2:
64 uses fragmentation i.e. datagramKs can be split into pieces to fit in network with small 2*7. Each fragment
is an independent datagram. 6t includes all header fields. (it in header indicates that the datagram is a fragment
9%estion 2o: 11+ *'arks: 1. ; 4lease choose one
provides connectionless service.
B *C4
< B#4
B 64
B none of the given
B#4 has the following characteristics.
L 6t is an end-to-end protocol. 6t provides application-to-application communication.
L 6t provides connectionless service.
L 6t is a 2essage-;riented protocol.
L 6t uses best-effort delivery service.
L 6t follows arbitrary interaction.
L 6t is operating system independent
7D4 and *C4 are both layer protocols
B 4hysical
B Data link
B Network
< Transport
9%estion 2o: 1,0 * 'arks: 1 . ; 4lease choose one
Connection-oriented service! 4oint-to-point! Complete reliability! +ull-duple- communication! ,tream
by
B 64
B None of the given
< T&4
B 7D4
,E"16CE 4";16DED (I *C4J
+ollowing are the services provided by *C4J
L Connection-oriented service
L 4oint-to-point
L Complete reliability
L +ull-duple- communication
L ,tream interface
L "eliable connection startup
L 8raceful connection shutdown
9%estion 2o: 1,1 *'arks: 1. ; 4lease choose one
B 4hysical .ayer
BNetwork 6nterface .ayer
B 6nternet .ayer
< Transport /ayer
/3JE= ?: ens%re relia"le transfer layer ? in T&4 layering model is transport layer
9%estion 2o: 1,, * 'arks: 1 . ; 4lease choose one
identifies which application program on receiving computer should receive the data
B .ogical address
B ,ource port
< #estination 4ort
B None of the given
Aield#estination4ort identifies which application program on receiving comp%ter sho%ld receive the
data. Khile field so%rce port identifies the application programs that sent the data. *=eference from E;
"ooks.
9%estion 2o: 1,- *'arks: 1. ; 4lease choose one
identifies the application program that sent the data.
B Destination 4ort
< 1o%rce port
B .ogical address
B none of the given
Aield #estination 4ort identifies which application program on receiving comp%ter sho%ld receive the
data. Khile field so%rce port identifies the application programs that sent the data. *=eference from E;
"ooks.
9%estion 2o: 1,? *'arks: 1. ; 4lease choose one
*he (order 8ateway 4rotocol /(840 uses for all communication
B 7D4
< T&4
B (oth 7D4 and *C4
B none of the given
BC=#E= D3TEK3J 4=CTC&C/:
6t is most popular E-terior 8ateway 4rotocol in 6nternet. 6t has following characteristicsJ
A6t provides routing among autonomous systems /E840.
A6t provides policies to control routes advertised.
A6t uses reliable transport /*C40.
9hich of the following protocols allows the sender and receiver to enforce polices.
B "64
B ;,4+
B (84
B "64 and ;,4+
B (84
B ;,4+
< =I4
B None of the given
=CBTI2D I2AC='3TIC2 4=CTC&C/ *=I4.:
6t has the following characteristicsJ
MIt is %sed for ro%ting within an a%tonomo%s system *ID4..
A=op Count 2etricJ "64 measures distance in network hops! where each network
(etween the source and destination counts as a single hop.
A6t uses 7D4 for all message transmissions.
A"64 is used over .AN. 1ersion & of "64 uses hardware broadcast and version ) allows
Delivery via multicast.
A6t can be used to advertise default route propagation. An organi>ation can use "64 to
6nstall a default route in each router.
A6t uses distance vector algorithm.
9%estion 2o: 1, *'arks: 1. ; 4lease choose one
6C24 message transport is acted upon by getting 6C24 encrypted in 64.
< Tr%e
B +alse
I&'4 message transport is acted %pon "y getting I&'4 encaps%lated in I4 *4O 11.
9%estion 2o: 1,+ * 'arks: 1 . ; 4lease choose one
4rotocol addresses are abstractions provided by .
B hardware
< software
B operating system
B internet
4rotocol addresses are abstractions provided by software
9%estion 2o: 1,9 * 'arks: 1 . ; 4lease choose one
*hese packets serve same purpose on as frames on
B 6ntranet! .AN
B 6nternet! 9AN
B 6ntranet! 9AN
< Internet, /32
@I=TB3/ 43&QET1:
These packets serve same p%rpose in Internet as frames on /32
9%estion 2o: 1-0 *'arks: 1. ; 4lease choose one
Address mask defines how many bits of address are in suffi-:
B *rue
< Aalse
Address mask defines how many bits of address are in prefi-. 4refi- defines how much of address used to
identify network.
A single networking technology is best for all needs.
B *rue
< Aalse
There is no single networking technology that is "est for all needs
9%estion 2o: 1-, * 'arks: 1 . ; 4lease choose one
A computer attached to a given network can only communicate with other computers attached to the same
network. 6s this a problem with multiple networks:
< Tr%e
B +alse
the chief problems with multiple networks are as followsJ
L A computer attached to a given network can only communicate with other
Computers attached to the same network.
9%estion 2o: 1-- *'arks: 1. ; 4lease choose one
the term self-identifying is used for Classful 64 addresses because the class of the address can be computed
from the address.
< itself
B prefi-
B suffi-
B mask
&lassf%l I4 addresses are self;identifying "eca%se the class of the address can "e comp%ted from the
address itself
9%estion 2o: 1-? *'arks: 1. ; 4lease choose one
+ind the class of the address.
&'&''&&& &&'&&'&& &'''&'&& '&&'&&&&
B A
< B
B E
B C
=eference ta"le hando%ts 4 O +
+ind the class of the addressJ
&&&&''&& &''&&'&& &&&&&'&& ''''&&&&
B A
B C
< E
B (
=eference ta"le hando%ts 4 O +
9%estion 2o: 1-8 * 'arks: 1 . ; 4lease choose one
B *
B D
< &
B *! C
=eference ta"le hando%ts 4 O 9
9%estion 2o: 1- *'arks: 1. ; 4lease choose one
9hich method of Address "esolution 4rotocol requires hardware broadcast:
< #
B *
B C
B *! D
9%estion 2o: 1-+ * 'arks: 1 . ; 4lease choose one
9hich method of Address "esolution 4rotocol resolution with minimum delay:
B *! D
B c
B *
< T, &
9%estion 2o: 1-9 * 'arks: 1 . ; 4lease choose one
6n which method of Address "esolution 4rotocol the implementation is more difficult:
B *! C
B *
B C
< #
9%estion 2o: 1?0 *'arks: 1. ; 4lease choose one
on of the design goals for unicast route propagation is .
B Consistency
B inconsistency
< sta"ility
B dynamic addressing
on of the design goals for unicast route propagation is stabilityPcontinual changes in route are undesirable
because they lead to higher Ditter and datagram arriving out of order. *hus! once a unicast routing protocol
finds a shortest path! it usually retains the route until a failure makes the path unusable. /"eference from E-
book0
4ropagation multicast routing information differs dramatically from unicast route propagation:
< Tr%e
B +alse
Propagating multicast routing information differs dramatically from unicast route propagation. The
difference arises "eca%se internet m%lticast allows dynamic gro%p mem"ership and a%tonomo%s senders
9%estion 2o: 1?, *'arks: 1. ; 4lease choose one
*he 64 multicast abstraction allows an application running on an arbitrary computer to leave a multicast group
at any time. 9hile application on a computer remain a member of a group.
B ;ne or more
B only one
B no
B many
9%estion 2o: 1?- *'arks: 1. ; 4lease choose one
*o save traffic! an E84 does not summari>e routing information from the autonomous system before passing it
to another autonomous system.
B *rue
< Aalse
to save traffic, an ED4 s%mmari5e ro%ting information from the a%tonomo%s system "efore passing it to
another a%tonomo%s system. 'ore important an ED4 implements policy constraint that allows a system
manager to determine e)actly what information is released o%tside the organi5ation. *=eference from E;
"ook.
9%estion 2o: 1?? *'arks: 1. ; 4lease choose one
6n 64vH the type of address used for collection of computers with same prefi-. Are known as.
B Anycast
B 7nicast
B 2ulticast
< none of the given
Aollowing are special types of addresses, I4v8 %ses)
7nicastJ 6t is used for single destination computer.
2ulticastJ 6t is used for multiple destinationsN possibly not at same site.
ClusterJ *his type of address is used for collection of computers with same prefi-!
Datagram is delivered to one out of cluster.
,pecial types of addresses in 64vH used for multiple destinationsN possibly not at same site. Are known
as.
B 7nicast
B Anycast
< '%lticast
B none of the given
Aollowing are special types of addresses, I4v8 %ses:
Bnicast: 6t is used for single destination computer.
'%lticast: 6t is used for multiple destinationsN possibly not at same site.
&l%ster: *his type of address is used for collection of computers with same prefi-!
datagram is delivered to one out of cluster.
9%estion 2o: 1?8 * 'arks: 1 . ; 4lease choose one
7D4 offers application programs a 2essage-;riented 6nterface! applications can depend on protocol to
preserve data boundaries.
< Tr%e
B +alse
B#4 offers application programs a 'essage;Criented Interface. It does not divide messages into packets
for transmission and does not com"ine messages for delivery.
3#@32T3DE1:
I 3pplications can depend on protocol to preserve data "o%ndaries.
"eliability is the responsibility of the layer
B Network
B Datalink
< Transport
B Application
=elia"ility is the responsi"ility of the Transport layer
9%estion 2o: 1?+ * 'arks: 1 . ; 4lease choose one
*C4 uses mechanism to control the flow of data.
B door
< window
B acknowledgment
B retransmission
T&4 %ses window mechanism to control the flow of data.
9%estion 2o: 1?9 * 'arks: 1 . ; 4lease choose one
*he time for acknowledgement to arrival of packet depends on.
< #istance to destination and &%rrent traffic conditions
B Current traffic conditions
B Distance to destination
B non of these
*he time for acknowledgement to arrive depends onJ
L Distance to destination
L Current traffic conditions
+DD6 can transmits data at a rate of ----------
< 100 million "its per second
B &' million bits per second
B &''' million bits per second
B None of the given
A##I: Ai"er distri"%ted data interconnect *A##I. is another ring technology. Its most
important feat%res are:It %ses fi"er optics "etween stations and transmits data at 100'"ps.
9%estion 2o:151 *'arks:1. ; 4lease choose one
9hen an application--------------- data! it makes a copy of the data available to all other computers on the
network.
< Broadcasting
< 2ulticasting
< 7nicasting
< None of the given
9%estion 2o:15, *'arks:1. ; 4lease choose one
Ethernet uses a ------ bit static addressing scheme in which each device is assigned a unique address by
the manufacturer.
< H$
< ?+
< 3)
< M
*he product of delay and throughput measures the of data that can be present on the network.
< Area
< @ol%me
< .ength
< None of the given
9%estion 2o: 15? *'arks: 1. ; 4lease choose one
Connectionless service! 2essage-;riented protocol! best effort delivery service! arbitrary interaction and
operating system independent are the characteristics of
< *C4
< B#4
< 64
< None of the given
9%estion 2o: 155 *'arks: 1. ; 4lease choose one
< (84
< ;,4+
< =I4
< None of the given
9henever it handles a packet! 64 software needs to separate the destination address into a and
.
< postfi-! 6nfi-
< non of these
< 6nfi-! prefi-
< prefi), s%ffi)
< -,, ?+
< )$! 3)
< 3)! H$
< 3)! &)M
9%estion 2o: 15+ *'arks: 1. ; 4lease choose one
9hich method of Address "esolution 4rotocol is useful with any hardware:
*ere +(+ stands for (able looup, +-+ for -losed-form -omputation and +D+ for Data '.change/
< *
< &
< D
< C! D
E)change/
< *
< D
< &
< *! C
9e use the term to refer to a measure of the path that routing software use when choosing a
route.
< routing path
< ro%ting metric
< routing
< switching
A network uses a ------arranges for computers to be connected in a closed loop.
< ,tar *opology
< =ing Topology
< (us *opology
< None of the given
9%estion 2o: 18, *'arks: 1. ; 4lease choose one
An interface for thin Ethernet must have an connector ! and must generate signals
according to the specification.
< =>;?5, 10 Base T
< "#-$%! &' (ase %
< (NC! &' (ase )
< (NC! &' (ase *
< 4hysical .ayer
< 6nternet .ayer
< Transport /ayer
9%estion 2o: 18? *'arks: 1. ; 4lease choose one
< (84
< ;,4+
< =I4
< None of the given
CS610 Solved MCQS 100% Correct
________ of TCP/IP layering model, corresponds to basic network hardware.
Physical Layer
Network Interface ayer
Internet ayer
Transport ayer
_______ protocols of TCP/IP layering model specify how to ens!re reliable transfer.
Physical ayer
Network Interface ayer
Internet ayer
Transport Layer
________is called an end"to"end protocol beca!se it pro#ide a connection directly from an
application on one comp!ter to an application on a remote comp!ter.
IP
UDP
TCP
None of the gi#en
____________ !ses distance #ector approach to define ro!ting
$%P
&'P(
RIP
None of the gi#en
_______ is ideal in a sit!ation where the gro!p is small and all members are attached to
contig!o!s ocal )rea Networks.
lood!and !Pr"ne
Config!ration"and "T!nneling
Core"$ased *isco#ery
None of the gi#en
+o!ter that decrements TT to __ sends IC,P time e-ceeded message, with ro!ter s address as
so!rce address
.
/
0
0
Protocol addresses are abstractions pro#ided by ___________.
hardware
so#t$are

internet
)ltho!gh message e-change can be !sed to bind addresses, sending a re1!est for each binding is
Tr"e
(alse
)+P is almost always !sed to bind a ___"bit IP address to a ___"bit 2thernet address.
%&' ()
/3, ./
./, 43
./, 0/5
In the 0678s large organi9ations began to ac1!ire m!ltiple networks. 2ach network in
the organi9ation formed island. 2mployees needed to choose a comp!ter appropriate for
each task. 'o they needed m!ltiple screens, keyboards and comp!ters.
(alse
Tr"e
In which method of )ddress +esol!tion Protocol the protocol address is determined by
hardware address: ;ere <T< stands for Table look!p, <C< for Closed"form Comp!tation and <*<
for *ata 2-change:
T
*
C
T, C
;hich method of )ddress +esol!tion Protocol is !sef!l with any hardware:
;ere <T< stands for Table look!p, <C< for Closed"form Comp!tation and <*< for *ata 2-change:
T
C
*
C, *
In which method of )ddress +esol!tion Protocol the implimentation is more diffic!lt:
T, C
T
C
D
;hich method of )ddress +esol!tion Protocol resol!tion with minim!m delay:
T, *
c
T
T' C
The general form of an IP datagram is with a header followed by data. The header contains
information that controls where and how the datagram is to be sent.
Tr"e
(alse
To sa#e traffic, an 2%P does not s!mmeri9e ro!ting information from the a!tonomo!s system
before passing it to another a!tonomo!s system.
Tr!e
alse
""""""""""""" was especially concerned abo!t the lack of high powered comp!ters.
I222
)P+) =wrong spelling>
2I)
*one
,issing eot indicates sending comp!ter crashed in frame format.
Tr"e
(alse
The """""""""""""term refers to the general concept of a small block of data.
Pac+ets
*ata
(rame
None of gi#en
C+C can detect more errors than a simple checks!m.
Tr"e
(alse
The network that !ses a """"""""""""", !s!ally consist of a single long cable to which comp!ter
attach.
'tar topology
,"s topolo-y
+ing topology
None of the gi#en
)N that !se )T, technology ha#e a """""""""""""
'tar topology
$!s topology
+ing topology
*one o# the -iven
) bridge !ses """"""""""""""" to determine which comp!ter is connected to which segment, and
!ses the """"""""""""""" to determine whether to forward a copy of frame.

""""""""""""""" has a ?itter 9ero
@irt!al Pri#ate Network
Isochrono"s *et$or+
)synchrono!s Network
None of the gi#en
The network with Thro!ghp!t T and *elay * has a total """"""""""""""" bits in transit at a time.
* A T
* B T
D . T
* / T
&ne repeater """"""""""""""", two repeaters """"""""""""""" the ma-im!m cable length limitation.
Do"/le' triple
*o!ble, 3 time
half, triple
*o!ble, half
2nd"to"end deli#ery ser#ice is connection oriented.
Tr!e
alse
) single networking technology is best for all needs.
Tr!e
alse
Twice N)T allows a site to r!n ser#ers.
Tr"e
(alse
________ de#ice is !sed for m!lticasting.
C!b
'witch
Ro"ter
none of the gi#en
___________ does not depend on any partic!lar !nicast ro!ting protocol.
PI,"*,
PIM!SM
PI,"),
none of the gi#en
) ro!ting table contains_______
The destination network I*
The hop co!nt to reach the network
The ro"ter ID o# the ne0t hop
)ll of the gi#en
_______ can be !sed to propagate information abo!t remote networks.
Dyna1ic ro"tin-
'tatic ro!ting
)ddress resol!tion
None of the gi#en
________ protocol is designed to !se within an organi9ation.
&'P(
,2&'P(
M2SP
none of the gi#en
N)PT stands for ________________
Network )ddress and Protocol Translation
*et$or+ 3ddress and Port Translation
Network )ddress and Packet Translation
None of the gi#en
In dynamic ro!ting, the ro!ting table is initiali9ed when system boots.
Tr"e
(alse
&'P( incl!des ________ address mask with each address.
.8$it
%&,it
.3$it
none of the gi#en
Twice N)T fails if an application !ses the IP addresses instead of *omain Name.
Tr"e
(alse
_________ !ses window mechanism to control the flow of data.
IP
D*P
TCP
none of the gi#en
TCP !ses _______ mechanism to control the flow of data.
door
$indo$
acknowledgment
retransmission
I%Ps stand for _________
Internal %ateway Protocols
Interior 4ate$ay Protocols
Intermediate %ateway Protocols
None of the gi#en
________ protocol !ses distance #ector algorithm.
I%P
$%P
RIP
none of the gi#en
__________meas!res distance in network hops, where each network between the so!rce and
destination co!nts as single hop.
$%P
&'P(
RIP
Non of these
Network )ddress Translation =N)T> re1!ires de#ice to perform packet translation.
Tr"e
(alse
;e !se the term _______ to refer to a meas!re of the path that ro!ting software !se when
choosing a ro!te.
ro!ting path
ro"tin- 1etric
ro!ting
switching
Part of the ."way handshake !sed to create a connection, re1!ires each end to generate a
random _____ se1!ence n!mber.
%& /it
04 bit
5 bit
43 bit
+econstr!ction of original datagram is called reassembly.
Tr"e
(alse
+eliability is the responsibility of the ______ layer.
Transport
Network
Physical
Internet
_______ is ideal in a sit!ation where the gro!p is small and all members are attached to
contig!o!s ocal )rea Networks.
lood!and !Pr"ne
Config!ration"and "T!nneling
Core"$ased *isco#ery
None of the gi#en
In *irect point to point comm!nication adding the Nth comp!ter re1!ires"""""""""""" new
connections.
None of the gi#en
N
&
*!1
=N
&
BN>//
The n!mber of connections needed for N comp!ter in direct point to point comm!nication is
e1!al toE
5*
&
!*67&
N=N"0>
N
&
None of the gi#en
Cardware that calc!lates a C+C !ses two simple components.
)N* !nit and F&+ !nit
Shi#t re-ister and .2R "nit
'hift register and )N* !nit
None of the gi#en
The %igabit 2thernet hardware operates at a rate of """"""""
08 ,bps
088 ,bps
1000 M/ps
None of the gi#en
________ comp!tes shortest paths in a graph by !sing weights on edges as a meas!re of
distance. www.vustudents.ning.com
%reedy algorithm
*istance #ector algorithm
Di8+sta9s al-orith1
Non of the gi#en
$asic )N technologies s!ch as 2thernet, Token +ing, and (**I !se a _____.
Connectionless service paradi-1
Connection"oriented ser#ice paradigm
$oth Connectionless and Connection"oriented ser#ice paradigm
None of the gi#en
)n Internet )ddress =IP address> is a !ni1!e __________ binary n!mber assigned to a host
and !sed for all comm!nication with host
35"bit
%&!/it
/3"bit
None of the gi#en
The address __________ identifies the physical network to which the comp!ter is attached,
while the _______ identifies an indi#id!al comp!ter on that network.
pre#i0 ' s"##i0
s!ffi- , prefi-
s!ffi- , s!ffi-
None of the gi#en
___________ places the bo!ndary between the first and second octets
Class 3
Class $
Class C
Class *
___________ places the bo!ndary between the second and third octets.
Class )
Class ,
Class C
Class *
___________ places the bo!ndary between the third and fo!rth octets.
Class )
Class $
Class C
Class *
________ (ield of header indicates whether a datagram is a fragment or a complete datagram.
L34S
()%,2NT &(('2T
I*2NTI(IC)TI&N
None of the gi#en
______ pro#ides connectionless ser#ice.
TCP
UDP
IP
None of the gi#en
D*P and TCP are both_________ layer protocols
Physical
*ata link
Network
Transport
________identifies which application program on recei#ing comp!ter sho!ld recei#e the data
ogical address
'o!rce port
So"rce port
*estination Port
None of the gi#en
________ identifies the application program that sent the data.
*estination Port
So"rce port
ogical address
None of the gi#en
The $order %ateway Protocol =$%P> !ses_________ for all comm!nication
D*P
TCP
$oth D*P and TCP
None of the gi#en
;hich of the following protocols allows the sender and recei#er to enforce polices.
+IP
&'P(
,4P
+IP and &'P(
IC,P message transport is acted !pon by getting IC,P encrypted in IP.
Tr!e
alse
These IC,P message transport is acted !pon ________ as frames on ______
Intranet, )N
Internet, ;)N
Intranet, ;)N
Internet' L3*
)ddress mask defines how many bits of address are in s!ffi-:
Tr!e
alse
) comp!ter attached to a gi#en network can only comm!nicate with other comp!ters attached
to the same network. Is this a problem with m!ltiple networks:
Tr"e
(alse
The term self"identifying is !sed for Classf!l IP addresses beca!se the class of the address can be
comp!ted from the address__________.
itsel#
prefi-
s!ffi-
mask
(ind the class of the addressE
00008800 08800800 00000800 88880000
)
C
:
$
Th er e ar e thr e e standard i mpl e me ntati ons t o i mpr o v e c o mputati onal effi ci ency: Hashing, Dire ct Indexing
and Indir e ct
Indexing
+alse
A_____________ addr ess-bi nding tabl e is us e d f or e a c h physi cal net or !"
,ew
Similar
Separate
Old
______ layer #rovi des reliabl e d eli v ery of datagra m"
$et or !
Transport
Datalin!
n o ne of the gi v e n
Due t o re v oluti onali%ati on of I#-&' the spe e d has incr eas e d fr o m _______
512 to 1 GB
________ e nc apsulat es I#datagra m as data ar ea in hard ar e fra me"
.etwork %nter0ace -ayer
#atalink +ayer
,etwork +ayer
none of the given
_______ (iel d of h e ader indi cat es h et h er a datagra m is a frag me nt or a c o mpl et e datagra m"
+&A6ME.T F++SET
as the Internet gr e , the ori ginal )lassful addr essing s c h e me b e c a me a li mitati on" The I#addr ess spac e
a s b ei ng e xhaust ed b e c aus e all net or !s had t o c h o o s e o n e of f our possi bl e si%es"
+alse
As the Internet gr e , the ori gi nal )lassful addr essing s c h e me b e c a me a li mitati on" The I#addr ess spac e
a s b ei ng e xhaust ed b e c aus e all net or !s had t o c h o o s e o n e of ________ possi bl e si%es"
Three
Header c o ntains all inf or mati on ne e d e d t o deli v er datagra m t o the de stinati on c o mput er" *ut hi c h o n e of
the f oll o i ng is n ot include d:
&ecti0ier
______ c o ntains all inf or mati on ne e d e d t o deli v er datagra m t o the d estinati on"
1ea!er
o n e of the para met ers, hi c h m oti vat e d I#for c hang e is addr ess spac e" Th e _____________ addr ess
spac e all o s f or o v er a mi lli on net or !s" *ut m o st net or !s ar e cl ass )and t o o s mall f or ma ny
or gani%ati ons"
92#bit
)lass Ama s ! is + , ," -" -" - hi c h is us e d f or ______
Sub netting
#ostfix defines h o mu c h of addr ess us e d t o ide ntify net or !"
+alse
________ fi el d is us e d t o identify a spe cifi c path thr oug h the net or !
+-F/ -AHE-
_______ is a tec hni .ue us e d t o /i mit datagra m si%e t o s mall 0T1of any net or !
+ragmentation
Hashing is the transf or mati on of a string of c haract ers int o a usually sh ort er fixe d-l engt h value or a ! e y
that repr es ents the ori gi nal string"
True
In ______________, the pr ot o c ol addr ess assi gne d t o a c o mput er is c h os e n c ar efully s o that c o mput er2 s
hard ar e addr ess c an b e c o mput e d fr o m the pr ot o c ol addr ess using b asi c *ool ean and arith meti c
o perati ons"
(lose!#0orm (omputation
3out ers us e _______ t o f or ard datagra m al ong pr earrang e d path"
+low label
0apping b et e e n a pr ot o c ol addr ess and a hard ar e addr ess is c all e d Addr ess 3esoluti on"
True
#reli mi nary v ersi on of I#a s c all e d _________"
%' # .et 6eneration <%'ng=
_______ 4ourc e is responsi bl e f or frag me ntati on"
%'?4
5nd t o 5nd deli v ery 4ervi c e of I#datagra m is _____
(onnectionless
5very hard ar e tec hn ol o g y spe cifi cati on includes the d efiniti on of the ma xi mu m si%e of the fra me data
ar ea, hi c h is c all e d the ____________ Trans mi ssi on 1nit"
Maimum
I#&' addr ess es ar e _____ bits"
12;
0T14tands f or _______
Maimum transmission unit
_______ sh o s s e nders pr ef er enc e for l o lat ency, hi gh 3eliability"
SE&?%(E TE'E
$56T H5AD53fi el d in the bas e h e ader d efines type of h e ader it appears at the e nd of fixe d-si%e bas e
h e ader"
True
Th er e ar e t o standard i mpl e me ntati ons t o i mpr o v e c o mputati onal effi ci ency: Hashing and dir e ct
indexing
True
Adatagra m c ann ot b e lar g er than ________ of a net or ! o v er hi c h it is s ent"
%' hea!er
Th e pr ot o c ol addr ess of the next h op must b e _____________ t o an e .ui val ent hard ar e addr ess b ef or e a
pac ! et c an b e s e nt"
Translate! www.vustudents.ning.com
The physical addressing in a ;)N is similar as in )N in the way................
The data is transmitted in packets e1!i#alent to frames.
2ach packet has a format with header.
The packet header incl!des destination and so!rce addresses.
3ll o# the a/ove
In )synchrono!s Transfer ,ode @PI/@CI fields identify the cells""""""""""""""
;hich one of the following is a method for comp!ting ro!ting table information:
,an!al entry
$oot time ro!ting
Static ro"tin-
None of the abo#e
)ll destinations on same switch ha#e same
+o!ter
Information
*e0t hop
None of the abo#e
;hich of the following statement is wrong regarding )T,:
It is a single technology for #oice, #ideo and data
It has low ?itter and high capacity.
It !ses fi-ed si9e, small cells, and 35 octetGs data
*one o# the a/ove
;hich one of the following is the responsibility of *?ikstraG algorithm:
To co1p"te the shortest path /et$een t$o nodes
To e-tract ne-t hop information from path information
To insert ne-t hop information into ro!ting table
)ll of the abo#e
;hich of the following statement is tr!e regarding ink"state ro!ting:
Network topology is separated from ro!te comp!tation.
2ach switch b!ilds its own ro!ting tables.
ink"state ro!ting !ses *?ikstraGs algorithm.
3ll o# the a/ove
Hitter is significance for """"""""""""""""""
@oice
@ideo
*ata
3ll o# a/ove
The ro!ting table contains information abo!t the IIIIIIimmediately aro!nd it.
Topology of the network
Destination
$oth of the abo#e
None of the abo#e
=0> There are three types of C!bs that e-ist. ;hich of the following options correctly describes
these three:
a. Passi#e, dormant, special
b. )cti#e , dormant , passi#e
c. Passi#e, )cti#e, T!rbo
d. Passive' 3ctive' Intelli-ent
2. ) n!mber of different factors determine the cost of a C!b. ;hich of the following is
among these factors:
a. Speed ratin-
b. *!rability
c. $rand
d. Class

;hich of the following network topologies among the list below is incorrect:
a. 'tar
b. Internet
c. +ing
d. $!s
;hich of the following is not a feat!re of $ase band Coa-ial Cable:
a. $i"directional
b. (ew Jilometer range
c. Proton /ased
d. 2thernet=basis for 58/..> at 08 ,bps
;hich of the following is not a f!nction of a repeater:
Dses H!mper 'ettings
Transmits data in both directions
No $!ffering
;oins t$o 5&6 se-1ents o# ca/les
;hich le#el of the TCP/IP reference model ro!tes data/information across a network channel:
)pplication layer
*ata ink ayer
Transport ayer
*et$or+ Layer

The f!nction of a modem is to con#ert signals. Identify the correct signals it con#erts.
3nalo-"e to Di-ital
)nalog!e to $a!d rate
$a!d rate to )nalog!e
*igital to $inary

;hich of the following is not a )N B )rchitect!re:.
=a> Protocol architect!re
Media access control
ogical Protocol
ogical ink Control
Identify the statement which best describes TCP and D*P.
TCP is a connection oriented Protocol $hiles UDP is a data-ra1 service
TCP is a protocol for the Network ayer of the &'I
D*P and TCP co!ld be !sed interchangeably
TCP is an ad#anced protocol whiles D*P is a single protocol
;hich of the following characteristics best describes a frame:
Data lin+ layer5<eader' Trailer' Data6
Network ayer=Ceader, Trailer, *ata>
Transport ayer=Ceader, Trailer, *ata>
Physical ayer=Ceader, Trailer, *ata>

;hat does the terminology I'*N mean:
Internal *igital 'er#ices Network
Integrated 'ystems *igital Network
Integrated 'er#ices *igital Naming 'ystem
Inte-rated Services Di-ital *et$or+
;hat does the terminology )T, mean:
)!tomatic transfer mode
)!tomatic translation mode
3synchrono"s trans#er 1ode
)synchrono!s transformation mode
) simple )rchitect!re for (ile Transfer is made !p of E
(ile transfer applicationK Comm!nications ser#ice mod!leK Network access mod!le
(ile transfer applicationK transport layerK Network access mod!le
Network access layerK Transport layerK )pplication layer
3pplication layer= *et$or+ layer= Session layer
;hich of the following statements is tr!e abo!t standards:
'tandards create additional cost
Standards help individ"als9 "sers to increase e##ectiveness
'tandards allow prod!cts from m!ltiple #endors to comm!nicate
'tandards cannot free9e technology

;hich of the following statement is tr!e abo!t (&; C&NT+&:
lo$ control is a #"nction per#or1ed /y a receivin- entity to li1it the a1o"nt or
rate o# data on a net$or+>
(low control ad?!sts the weights on a network
(low control is a f!nction performed by the ,&*2,
(low control is an ad#anced form of network management

Identify the most s!itable description for 2++&+ C&NT+&:
:rror control is an activity that 1ana-es deadloc+>
2rror control is an ad#anced form of parity bit
2rror control is a s!b"f!nction of a modem and C!b
2rror control is needed to g!ard against loss or damage of data
;hat is the f!ll meaning of the terminology ',TP:
'tate ,ail Transfer Protocol
'imple ,ail Tailor Protocol
'imple ,anagement Transfer Protocol
Si1ple Mail Trans#er Protocol
'e#eral Comp!ters connected together is calledE
Client"ser#er
Client
Co1p"ter net$or+
C!b
In which of the following networks does the client s!bmit a task to the ser#er, then the ser#er
e-ec!tes and ret!rns the res!lt for the re1!esting client station:
=a> Peer"to"Peer
=b> Client"'er#er
'er#er"$ased
3ll o# the a/ove
In which network topology are all workstations connected in cascade form:
'tar
+ing
Mesh
$!s
;hich network topology !ses a C!b: www.vustudents.ning.com
Star
$!s
,esh
+ing
;hich of the following topologies is !sed for 2thernet:
'tar
$!s
+ing
3ll o# the a/ove

Comp!ters on a !ni#ersity camp!s are connected by a/anE
,)N
;)N
L3*
INT2+N2T
The primary f!nction of the network layer isE
2rror detection
'et !p a session
Ro"tin-
2ncryption
;hich of the following standards apply to logical link control:
I222 58/..
I::: )0&>&
I222 58/.L
I222 58/.3
;hich organi9ation defines standards for telecomm!nication:
ITD
I:::
2I)
I'&
;hich of the following statements is a tr!e description of fibre &ptic Cable:
(iber optic cables transfer data in a mesh
i/er optic ca/les trans#er data in li-ht #or1
(iber optic cables are similar to coa-ial cables
Non of the abo#e
;hich of the following is not tr!e of switching technology:
Packet 'witching
ink 'witching
Pac+ets are s$itched in the #or1 o# data-ra1
Circ!it switching techni1!es
;hich of the following is a tr!e description of ,!lti"stage 'witching:
,ore simple control
Increased n"1/er o# crossed points
,ore comple- control
+ed!ced +eliability
(looding in networks and data comm!nication has certain properties. ;hich of the options
below is a property of flooding:
)ll possible ro!tes are tried
3ll paths are loaded
)ll nodes are linked
Can not be !sed to set !p #irt!al circ!it

Identify any of the following statements which tr!ly describe a #irt!al circ!it.
=a> Packets are forwarded more 1!ickly and no ro!ting decisions
=b6 More relia/le in #"nctionality
=c> Call set !p phases are present
Packets are centrali9ed at random and more ro!ting decisions are made
;hich of the following operating systems software is most s!itable for wide area network:
*&'
&'//
;IN*&;' NT
*2?:LL *:T@3R:
$inding is an important f!nction in establishing comm!nication between a Client and a 'er#er.
;hich of the following statements tr!ly describes binding in protocols:
=a> ,indin- protocols to net$or+ inter#aces speci#ies that the selected protocol can
/e sent and received thro"-h the selected L3* inter#ace card>
=b> $inding is a f!nction of the Network &perating 'ystems 'oftware
$inding is a config!ration process in mail ser#er management.
$inding ser#es as a sec!rity layer in operating systems.
=.4> In config!ring ;indows NT 3.8 for Network )ccess. There are se#en =7> areas to be
addressed. Identify from the options below the area that sho!ld not be addressed.
Protocols
$indings
IP )ddress
3"toe0ec Mana-e1ent www.vustudents.ning.com
;hich of the following is not a network adapter:
. com P III
. com 2ther link III I')
. com 2ther link II )dapter
% co1 %CA0) IS3 16 ,IT

;hich of the following statement is tr!e abo!t an IP address:
IP address is /ased on yo"r co1p"ter net$or+ card
IP address is iss!ed by a comp!ter #endor
IP address is a Transport Protocol
IP address is not !sed on the internet

;hich of the following is not associated with the session layer:
Control of dialog!e between applications
*ialog!e discipline
Data co1pression
'ynchroni9ation
C' 408 'ol#ed =Correct> ,CM' =+eferences are gi#en in $l!e
(ont>

The $rotocol address of the next ho$ must be @@@@@@@@@@@@@ to an e%uivalent hardware address
before a $acket can be sent.
5ncry$ted
#ecry$ted
Translated
,on of these
A @@@@@@@@@@@@@ address"binding table is used for each $hysical network.
,ew
Similar
Separate
Old
?#8 $rovides connection"oriented service.
True
(alse
T<8 $rovides connection oriented reliable data streaming service& whereas ?#8 $rovides connection"
less unreliable messaging service.
The ?#8 stands for@@@@@@@@@@.
?niversal #atagram 8rotocol
Gser Batagram 'rotocol
?nited #atagram 8rotocol
,one of the given
In ;"way handshake T<8 re%uires to generate a random @@@@@@@@ se%uence number.
;9 bit
92 bit
;/ bit
none of the given
T<8 stands for @@@@@@@
Trans$ort control $rotocol
Transmission control protocol
Terminal control $rotocol
,one of the given
)s the Internet grew, the original Classf!l addressing scheme became a limitation. The IP
address space was being e-ha!sted beca!se all networks had to choose one of three possible
si9es.
'elect correct optionE
Tr"e
(alse
M!estion N 3 of /8 = 'tart timeE 84E33E87 P, >
Total , a r k sE 0
Twice N)T allows a site to r!n ser#ers.
Tr"e
(alse
Preliminary #ersion of IP was called _________.
IP " New %eneration =IPng>
IP ! *e0t 4eneration 5IPn-6
IP " Net %eneration =IPng>
None of the gi#en
)s the Internet grew, the original Classf!l addressing scheme became a limitation. The IP
address space was being e-ha!sted beca!se all networks had to choose one of two possible si9es.
Tr!e
alse
_________ !ses window mechanism to control the flow of data.
IP
D*P
TCP
none of the gi#en
TCP !ses window mechanism to control the flow of data.
The Internet ser#ice pro#iders coordinate with the Internet assigned n!mber a!thority to obtain
their network n!mbers.
Tr"e
(alse
;hich protocol is !sed to test different tools.
ICMP
I%,P
TCP/IP
none of the gi#en
?SI,C I<)8 TO T5ST 75A<FA0I+ITP!
I<)8 can also be used to test different tools. An Internet host A& is reachable from another host 0& if
datagramNs can be delivered from A to 0. 8ing $rogram tests reach ability. It sends datagram from 0 to
A& that echoes back to 0. it uses I<)8 echo re%uest and echo re$ly messages. Internet layer includes
code to re$ly to incoming I<)8
echo re%uest messages.
________ identifies the application program that sent the data.
*estination Port
So"rce port
ogical address
None of the gi#en
The 'o!rce can config!re o!tgoing datagramGs to a#oid _________
'egmentation
*efragmentation
ra-1entation
None of the gi#en
6ragmentation should be avoided. Source can configure outgoing datagrams to avoid fragmentation.
Source determines $ath )T?" smallest network )T? on $ath from source to destination.
M!estion N 05 of /8 = 'tart timeE 84EL7E0/ P, >
Total , a r k sE 0
The time for acknowledgement to arri#e depends on __________
*istance to destination
C!rrent traffic conditions
,oth a and /
None of the gi#en
The time for acknowledgement to arrive de$ends on!
U #istance to destination
U <urrent traffic conditions
which is not the type of error messages defined by IC,P.
'o!rce 1!ench
Time e-ceeded
*estination !nreachable
*one o# the -iven
2++&+ ,2'')%2'E
These are as followsE
O 'o!rce 1!ench
O Time e-ceeded
O *estination !nreachable
O +edirect
O (ragmentation re1!ired
@@@@@@@@@ is used to attach two autonomous systems.
Select correct o$tion!
0C8
IC8
:4P
none of the given
Question D 2 o0 2@
#ue to revolutionali'ation of I8"A: the s$eed has increased from @@@@@@@
4:kb$s to 432kb$s
432kb$s to 3gb$s
A6+/ps to 1-/ps
none of the given
Scale is also dramatically changed. Si'e from a few tens to a few tens of millions
Of com$uters has been revolutioni'ed. S$eed has increased from 4:Ib$s to 3Cb$s. Also
There is an increased frame si'e in hardware
Question D 9 o0 2@
Whenever it handles a $acket& I8 software needs to se$arate the destination address into a $refix.
True
alse
<O)8?TI,C TF5 <+ASS O6 A, A##75SS!
Whenever it handles a $acket& I8 software needs to se$arate the destination
Address into a $refix and suffix.
Question D 3 o0 2@
TT+ stands for @@@@@@@@@@
Time to +earn
Time to +eave
Ti1e to Live
none of the given
Question D 5 o0 2@
IC8s stand for @@@@@@@@@
Internal Cateway 8rotocols
Interior 4ate$ay Protocols
Intermediate Cateway 8rotocols
,one of the given
Question D 4 o0 2@
8888888888888identifies which a$$lication $rogram on receiving com$uter should receive the data
+ogical address
Source $ort
Destination Port
,one of the given
6ield #estination 8ort identifies which a$$lication $rogram on receiving com$uter should receive the
data. While field source $ort identifies the a$$lication $rograms that sent the data.
Question D : o0 2@
@@@@@@@@@@@@@@@@@@enca$sulates I8 datagram as data area in hardware frame.
*et$or+ Inter#ace Layer
#atalink +ayer
,etwork +ayer
,one of the given
The network interface layer enca$sulates an entire datagram in the data area of a hardware frame
vu's.net
Question D ; o0 2@
<lass A mask is 244.9.9.9 which is used for @@@@@@@@@@@@@@@@
?nicasting
)ulticasting
S"/nettin-
All of the given
class A mask is 244.9.9.9 which is used for subnetting.
Question D > o0 2@
,AT is not useful at a residence with <able )odem or #S+ connectivity.
True
+alse
Question D 1@ o0 2@
Autonomous System chooses a routing $rotocol to exchange routing information which is $assed before
being summari'ed to another grou$.
True
6alse
Question D 11 o0 2@
@@@@@@ layer 8rovides reliable delivery of datagram.
,etwork
Transport
#atalink
none of the given
Trans$ort layer $rovides reliable delivery. ,etwork layer S I8 S can detect and
re$ort errors without actually fixing them. It focuses on datagram delivery. A$$lication
layer is not interested in differentiating among delivery $roblems at intermediate routers
Question D 12 o0 2@
The $rocess of using a routing table to select a next ho$ for a given datagram is called@@@@@@@@@.
5nca$sulation
7eassembling
Ro"tin- or #or$ardin-
,one of the given
The $rocess of using a routing table to select a next ho$ for a given datagram is called routing or
forwarding.
Question D 19 o0 2@
The $rocess of learning the $ath )T? is known as $ath )T? discovery.
Tr"e
6alse
The $rocess of learning the $ath )T? is known as $ath )T? discovery.
Question D 13 o0 2@
As the Internet grew& the original <lassful addressing scheme became a limitation. The I8 address s$ace
was being exhausted because all networks had to choose one of @@@@@@@@ $ossible si'es.
three
two
four
five
Three
As the Internet grew& the original <lassful addressing scheme became a limitation.
The I8 address s$ace was being exhausted because all networks had to choose one of
Three $ossible si'es. )any addresses were unused.
Two new mechanisms were invented to overcome the limitations& which are as
6ollows!
U Subnet addressing
U <lassless addressing
Question D 15 o0 2@
5nd to 5nd delivery Service of I8 datagram is @@@@@
<onnection oriented
Connectionless
both a and b
none of the given
Question D 14 o0 2@
5C8 stands for @@@@@@@@@
5xtension Cateway 8rotocol
:0terior 4ate$ay Protocol
5x$licit Cateway 8rotocol
none of the given
Question D 1: o0 2@
Fashing is the transformation of a string of characters into a usually shorter fixed"length value or a key
that re$resents the original string.
Tr"e
6alse
Fashing is the transformation of a string of characters into a usually shorter fixed"length value or a key
that re$resents the original string. Fashing is used to index and retrieve items in a database because it is
faster to find the item using the shorter hashed key than to find it using the original value. It is also used
in many encry$tion algorithms.
Question D 1; o0 2@
Although the A78 message format is sufficiently general to allow arbitrary $rotocol and hardware
addresses. A78 is almost always used to bind a ;2"bit I8 address to a @@@@ 5thernet address.
3:"bit
()!/it
:/"bit
322"bit
Although the A78 message format is sufficiently general to allow arbitrary $rotocol and hardware
addresses. A78 is almost always used to bind a ;2"bit I8 address to a /2"bit 5thernet address
Question D 1> o0 2@
7eliability is not the res$onsibility of the Trans$ort layer.
True
+alse
7eliability is the res$onsibility of the Trans$ort layer. In T<8HI8& T<8 $rovides reliable trans$ort service.
)ost Internet a$$lications use T<8 as no other $rotocol has $roved to work better.
Question D 2@ o0 2@
I8A: address with @@@@@@ leading 'eros is inter$reted to hold an I8A/ address.
httpE//#!st!dents.ning.com//
>4
399
329
none of the given
I8v: address with =: leading 'eros is inter$reted to hold an I8v/ addressQuestion D 1 o0 2@
,AT software does not allow a 8< to connect with the Internet and act as a ,AT device at the same time.
True
+alse
Question D 2 o0 2@
T<8 uses the term segment to refer to a @@@@@@@@.
$acket
message
both *a- and *b-
,one of the given
both a and b
T<8 uses single format for all messages. T<8 uses the term segment to refer to a message. 5ach message
sent from T<8 on one machine to T<8 on another machine uses this format including data and
acknowledgement.
Question D 9 o0 2@
The ?niversal #atagram 8rotocol is a message"oriented $rotocol.
True
6alse
?#8 has the following characteristics.
U It is an end"to"end $rotocol. It $rovides a$$lication"to"a$$lication communication.
U It $rovides connectionless service.
U It is a )essage"Oriented $rotocol.
U It uses best"effort delivery service.
U It follows arbitrary interaction.
U It is o$erating system inde$endent
Question D 3 o0 2@
@@@@@@@@@@@@@@field tells the receiver how to order fragments within a given datagram.
6+ACS
6+AC)5,T O66S5T
I#5,TI6I<ATIO,
.one o0 the given
The 67AC)5,T O66S5T field tells a receiver how to order fragments within a given datagram
Question D 5 o0 2@
I8 datagram can contains @@@@@@@@ octets.
9":4&4;4
1#45,595
3":4&4;:
none of the given
#atagrams can have different si'es i.e.
Feader area is usually fixed *29 octets- but can have o$tions. #ata area can contain
between 3 octet and :4.4;4 octets *23:"3-.
?sually& data area is much larger than header.
Question D 4 o0 2@
The amount of buffer s$ace available at any time is called the window.
True
6alse
Question D : o0 2@
@@@@@@@ Source is res$onsible for fragmentation.
I8A/
%'?4
I8v: source *not intermediate routers- is res$onsible for fragmentation. 7outers
sim$ly dro$ datagrams larger than network )T? *)aximum Transmission ?nit-. So
source must fragment datagram to reach destination.
Question D ; o0 2@
7outers use @@@@@@@ to forward datagrams along $rearranged $ath.
Traffic class
+low label
#estination address
none of the given
7outers use flow label to forward datagrams along $rearranged $ath
Question D > o0 2@
@@@@@@@ $rotocol uses three way handshake to begin a connection.
?#8
T('
I8
none of the given
Question D 1@ o0 2@
Ty$ical internet routing uses uses a combination of two metrics@@@@@@@@@@@@@@@@@@.
routing metrics
administrative cost and routing metrics
ho$ cost
a!ministrative cost an! hop count
Question D 13 o0 2@
,etwork Address and 8ort Translation *,A8T- is by far the most $o$ular form of @@@@@@@
,etwork Address Transmission
.etwork A!!ress Translation
,etwork Address Transformation
,one of the given
Question D 15 o0 2@
The routers within an autonomous system use a @@@@@@@@@@@@@ to exchange routing information.
%nterior 6ateway protocols<%6's=
5xterior Cateway $rotocol *5C8s-
0oth Interior Cateway $rotocols*IC8s- and 5xterior Cateway $rotocol *5C8s-
,one of the given
It is used among routers within autonomous system. The destinations lie within IC8.
Question D 1: o0 2@
Interior Cateway 8rotocols *IC8s- and 5xterior Cateway 8rotocols *5C8s- two broad classes of Internet
7outing 8rotocol.
True
6alse
Question D 1; o0 2@
The ,etwork +ayer 8rotocol I<)8 stands for@@@@@@@@@@@@
Instant <ontrol )essage 8rotocol
%nternet (ontrol Message 'rotocol
Initial <ontrol )essage 8rotocol
,one of the given
Question D 1> o0 2@
The <urrent version of I8"Aersion / is @@@@@ old
32 years
2@ years
22 years
none of given
T<8 is a connectionless and reliable trans$ort $rotocol.
True
+alse
ATM hea!er is about the8888888888888888o0 the cell.
34V
1@J page 44
29V
4V
$itter is signi0icance 0or 88888888888888
Aoice
Aideo
#ata
Al o0 above page 44
1ow many metho!s eist 0or buil!ing routing table5
Select correct o$tion
3
2 pages
; /
The process o0 0orwar!ing the packets o0 in0ormation is calle! routing
The routing table contains in0ormation about the 8888888888888 imme!iately aroun! it
To$ology of the network
Bestination page 5;
0oth of the above
,one of the above
Asynchronous Trans0er Mo!e uses the concept o0 88888888888888
<onnection"less networking
(onnection#oriente! networking page 44
/hich o0 the 0ollowing statement is true regar!ing ATM5
It is a single technology for voice& video and data
It has low (itter and high ca$acity
It uses fixed si'ed small cells. /2 octet1s data
All o0 the above page 45
A 8888 can 0orwar! or block messages base! on the in0ormation in the message itsel0
Select correct o$tion
)essage digest
8roxy firewall
'acket 0ilter 0irewall not 0oun! in han!outs
8rivate Iey
Pou can use an I8 $acket filter firewall to create a set of rules that either discards or acce$ts traffic over
a network connection.*Source to confirm
htt$!HH$ublib.boulder.ibm.comHinfocenterH$owersysHv;r3m4Hindex.(s$
to$icTHi$ha4H$acketfilterfirewall.htm-
Transmission me!ia are usually categorize! as
6ui!e! or ungui!e!
6ixed or unfixed
#eterminate or indeterminate
)etallic or nonmetallic
/hich o0 the 0ollowing is not a gui!e! me!ium5
Twisted"$air cable
6iber"o$tic cable
Atmosphere
<oaxial <able
/hich multipleing techniAue transmits !igital signals5
W#)
6#)
TBM
,one of the above
All !estinations on same switch have same 888888888
7outer
Information
.et 1op page 5;
,one of the above
/hich o0 the 0ollowing statement is true regar!ing Bistance#?ector &outing5
It is very sim$le to im$lement.
'acket switch up!ates its own routing table 0irst. 'age 43
It is used in 7I8.
All of the above
An eterior switch is one with which 888888888888888
(omputers are attache! page 5>
,o com$uter is attached
Fubs are attached externally ,one of the above
+rame relay is 88888888888888888888888
(onnection oriente! service page 43
<onnectionless service It is ty$ically ranges from 4)b$s to 3999)b$s. ,one of the above
An interior switch is one with which 88888888888
<om$uters are attached
.o computer is attache! page 5>
<om$uters are attached internally
,one of the above
/hich o0 the 0ollowing is not a bene0it o0 source in!epen!ence5
It allows fast and efficient routing.
'acket switch !o not nee! to have complete in0ormation about all !estinations
,etwork functions even if to$ology changes
,one of the above

/hich o0 the 0ollowing statement regar!ing ATM is true5
<onnections in AT) are called virtual channels
The A< is identified by a 2/"bit value formed from the A8I
Hoth <a= an! <b=
,one of the above
ATM hea!er is about the ########## o0 the cell.
34V
1@J
29V
4V

1ow many metho!s eist 0or computing routing table5
4
/
;
2
/hich o0 the 0ollowing statement is true regar!ing Bistance#vector routing5
It is very sim$le to im$lement.
'acket switch up!ates its own routing table 0irst.
It is used in 7I8.
All of the above
/hich one o0 the 0ollowing is a property o0 static routing5
It is inflexible
It is done at boot time
It has low network overload
All o0 the above
Asynchronous Trans0er Mo!e uses the concept o0 ####################.
<onnection"less networking
(onnection#oriente! networking
/hich multipleing techniAue shi0ts each signal to a !i00erent carrier 0reAuency5
T#)
+BM
0oth a and b
,one of the above
An interior switch is one with which KKKKKKK.
<om$uters are attached
.o computer is attache!
<om$uters are attached internally
,one of the above
-A. networks can not be eten!e! to very large networks because o0 the limitations o0...........
Area
Bistance
7outers
Technology
/hich o0 the 0ollowing statement is wrong regar!ing ATM5
It is a single technology for voice& video and data
It has low (itter and high ca$acity.
It uses fixed si'e& small cells& and /2 octetNs data
.one o0 the above
/hich one o0 the 0ollowing is the responsibility o0 BCikstraI algorithm5
To compute the shortest path between two no!es
To extract next ho$ information from $ath information
To insert next ho$ information into routing table
All of the above
/hich one o0 the 0ollowing is a property o0 !ynamic routing5
It is inflexible
It has low network overload
%t can work aroun! network 0ailure
All of the above
/hich o0 the 0ollowing statement is true regar!ing ATM5
AT) is a single technology that is designed to meet the goals of both +A,s and WA,s.
AT) uses the conce$t of connection"oriented networking.
Hoth <a= an! <b=
,one of the above
Source in!epen!ence is a phenomena in which net hop to !estination !oes not !epen! on the
WWWWWWW
Source o0 packet
#estination of $acket
,o of ho$s
Source of $rotocol
%0 a computer on the network shares resources 0or others to use, it is calle! 8888
a. Server
b. (lient
c. Main0rame
Answer" a
2. Terminators are use! in 888888 topology.
a. Hus
b. Star
Answer" a
9. %n 88888 topology, i0 a computerIs network cable is broken, whole network goes !own.
a. Hus
b. Star
Answer" a
3. +or large networks, 8888888 topology is use!.
a. Hus
b. Star
c. &ing
Answer" b
5. %SF stan!s 0or
a. %nternational Stan!ar! Frganization
b. %nternational Stu!ent Frganization
c. %ntegrate! Services Frganization
Answer" a
4. %SF FS% mo!el is use! in
a. Stan! alone '(
b. .etwork environment
Answer" b
:. .etwork cable lies on 88888 layer
a. Application
b. .etwork
c. 'hysical
Answer" c
;. 8888 -ayer !eci!es which physical pathway the !ata shoul! take.
a. Application
b. .etwork
c. 'hysical
Answer" c
>. %SB. is an eample o0 888888 network
a. (ircuit switche!
b. 'acket switche!
Answer" a
1@. L.25 is an eample o0 888888 network
a. (ircuit switche!
b. 'acket switche!
Answer" b
11. 8888888888888 allows -A. users to share computer programs an! !ata.
a. (ommunication server
b. 'rint server
c. +ile server
Answer" c
12. 'rint server uses 88888888 which is a bu00er that hol!s !ata be0ore it is sen! to the printer.
a. Queue
b. Spool
c. .o!e
Answer" b
19. A stan!alone program that has been mo!i0ie! to work on a -A. by inclu!ing concurrency controls
such as 0ile an! recor! locking is an eample o08888
a -A. intrinsic so0tware
b. -A. aware so0tware
c. 6roupware
!. -A. ignorant so0tware
Answer" a
13. The 888888 portion o0 -A. management so0tware restricts access, recor!s user activities an! au!it
!ata etc.
a. (on0iguration management
b. Security management
c. 'er0ormance management
Answer " b
15. /hat is the ma cable length o0 ST'5
a. 1@@ 0t
b. 2@@ 0t
c. 1@@ m
!. 2@@ m
Answer " !
14. /hat is the ma !ata capacity o0 ST'5
a. 1@ mbps
b. 1@@ mbps
c. 1@@@ mbps
!. 1@@@@ mbps
Answer" b
1:. /hich connector ST' uses5
a. H.(
b. &$#11
c. &$#35
!. &$#4>
Answer " c
1;. /hat is the central !evice in star topology5
a. ST' server
b. 1ub7switch
c. 'B(
!. &outer
Answer " b
1>. /hat is ma !ata capacity 0or optical 0iber cable5
a. 1@ mbps
b. 1@@ mbps
c. 1@@@ mbps
!. 1@@@@ mbps
Answer " c
In #irect $oint to $oint communication adding the ,th com$uter re%uires"""""""""""" new connections.
,one of the given
,2
,"3
*,2 S,-H2
disadvantage In Direct point to point communication is that adding a new computer to the network
requires N-1 new connections .(P# 23
Question .o" 2 < M a r k s" 1 = http"77vustu!ents.ning.com7
In 8oint"to"8oint to$ology there are two to$ologies.
Tree and 7ing
Star and 7ing
Star and Tree
,one of the given
8OI,T"TO"8OI,T!
In Point-to-Point to$ology there are two to$ologies.
3- STA7 to$ology
2- T755 to$ology
Question .o" 9 < M a r k s" 1 =
%n #############, network occupies the smaller area like a room a 0loor or a buil!ing
+A,
WA,
)A,
,one of the given
In !"N network occupies the sma##er area #ike a room a $#oor or a %ui#ding.(P# &
1ar!ware that calculates a (&( uses two simple components.
A,# unit and XO7 unit
Shift register and XO7 unit
Shift register and A,# unit
none of the given
<7< uses (ust two hardware com$onents!
U Shift register
U 5xclusive O7 * XO7 unit - .(P# 2'
The Cigabit 5thernet hardware o$erates at a rate of """"""""
39 )b$s
399 )b$s
3999 )b$s
,one of the given
(iga%it )thernet that operates at 1 (%ps (1''' *%ps over $i%er optics and twisted pair )thernet ca%#es.
http"77vustu!ents.ning.com7
0ormally name! 8888888888 in0ormally known as the twiste! pair Ethernet or T' Ethernet.
39 0ase 2
39 0ase 4
39 0ase T
none of the given
1'+",)--.
-his is another standard o$ wiring scheme. It is common#/ ca##ed 1'+ase--0 -wisted Pair or -P )thernet.
(P# &3
.net
An inter0ace 0or thin Ethernet must have an 888888888888 connector , an! must generate signals
accor!ing to the8888888888888 speci0ication.
7."/4& 39 0ase T
7."/4& 39 0ase 4
0,<& 39 0ase 2
0,<& 39 0ase T
A system with re!un!ant bri!ges might have a problem with8888888 in the system.
+oo$
6ilters
S$anning Trees
All given choices
88888888 computes shortest paths in a graph by using weights on e!ges as a measure o0 !istance.
Creedy algorithm
#istance vector algorithm
#i(kstaNs algorithm
none of the given
D1ikstra2s a#gorithm can accommodate weights on edges in graph. -he shortest
Path is then the path with #owest tota# weight (sum o$ the weight with a## edges. It shou#d
%e noted that the shortest path is not necessari#/ with $ewest edges (or hops.
Hasic -A. technologies such as Ethernet, Token &ing, an! +BB% use a 88888.
<onnectionless service $aradigm
<onnection"oriented service $aradigm
,one of the given
8888888 protocols o0 T('7%' layering mo!el speci0y how to ensure reliable trans0er.
8hysical +ayer
,etwork Interface +ayer
Internet +ayer
Trans$ort +ayer
!"3)4 &. ensure re#ia%#e trans$er #a/er & in -5P #a/ering mode# is transport #a/er.
"77vuzs.net
An %nternet A!!ress <%' a!!ress= is a uniAue 8888888888 binary number assigne! to a host an! use!
0or all communication with host
/2"bit
;2"bit
2/"bit
,one of the given
"n Internet address (IP address is a unique 32-%it %inar/ num%er assigned to a
6ost and used $or a## communication with the host
the a!!ress 8888888888 i!enti0ies the physical network to which the computer is attache!, while the
8888888 i!enti0ies an in!ivi!ual computer on that network.
8refix& suffix
suffix& $refix
suffix& suffix
none of the given
PREFIX:
It identi$ies the ph/sica# network to which the computers are attached.
SUFFIX:
It identi$ies an individua# computer on the network.
88888888888 places the boun!ary between the 0irst an! secon! octets
<lass A
<lass 0
<lass <
<lass #
<lass A $laces the boundary between the first and second octets. <lass 0 $laces the boundary between
the second and third octets& and class < $laces the boundary between the third and fourth octets.
88888888888 places the boun!ary between the thir! an! 0ourth octets.
<lass A
<lass 0
<lass <
<lass #
88888888 0iel! o0 hea!er in!icates whether a !atagram is a 0ragment or a complete !atagram.
6+ACS
6+AC)5,T O66S5T
I#5,TI6I<ATIO,
,one of the given
74"(*)N-"-I8N.
I8 uses fragmentation i.e. datagramNs can be s$lit into $ieces to fit in network with small )T?. 5ach
fragment is an inde$endent datagram. It includes all header fields. 0it in header indicates that the
datagram is a fragment
tp"77vuzs.net
888888 provi!es connectionless service.
T<8
?#8
I8
none of the given
9DP has the $o##owing characteristics.
: It is an end-to-end protoco#. It provides app#ication-to-app#ication communication.
: It provides connection#ess service.
: It is a *essage-8riented protoco#.
: It uses %est-e$$ort de#iver/ service.
: It $o##ows ar%itrar/ interaction.
: It is operating s/stem independent
"77vuzs.net
GB' an! T(' are both888888888 layer protocols
8hysical
#ata link
,etwork
Trans$ort
(onnection#oriente! service, 'oint#to#point, (omplete reliability, +ull#!uple communication, Stream
inter0ace, &eliable connection start#up an! 6race0ul connection shut!own are the services provi!e!
by8888888888
I8
,one of the given
T<8
?#8
S57AI<5 87OAI#5# 0P T<8!
6ollowing are the services $rovided by T<8!
U <onnection"oriented service
U 8oint"to"$oint
U <om$lete reliability
U 6ull"du$lex communication
U Stream interface
U 7eliable connection start"u$
U Craceful connection shutdown
8hysical +ayer
Internet +ayer
Trans$ort +ayer
!"3)4 &. ensure re#ia%#e trans$er #a/er & in -5P #a/ering mode# is transport #a/er
88888888i!enti0ies which application program on receiving computer shoul! receive the !ata
+ogical address
Source $ort
#estination 8ort
,one of the given
7ie#d Destination Port identi$ies which app#ication program on receiving computer shou#d receive the
data $ie#d source port identi$ies the app#ication programs that sent the data.
@@@@@@@@ identifies the a$$lication $rogram that sent the data.
#estination 8ort
Source $ort
+ogical address
,one of the given
7ie#d Destination Port identi$ies which app#ication program on receiving computer shou#d receive the
data ;hi#e $ie#d source port identi$ies the app#ication programs that sent the data. (4e$erence $rom )-
%ooks
The Hor!er 6ateway 'rotocol <H6'= uses888888888 0or all communication
?#8
T<8
0oth ?#8 and T<8
none of the given
0O7#57 CAT5WAP 87OTO<O+!
It is most $o$ular 5xterior Cateway 8rotocol in Internet. It has following characteristics!
QIt $rovides routing among autonomous systems *5C8-.
QIt $rovides $olicies to control routes advertised.
QIt uses reliable trans$ort *T<8-.
"77vuzs.net
888888888888 uses !istance vector approach to !e0ine routing
0C8
OS86
7I8
,one of the given
7O?TI,C I,6O7)ATIO, 87OTO<O+ *7I8-!
It has the following characteristics!
QIt is used for routing within an autonomous system *IC8-.
QFo$ <ount )etric! 7I8 measures distance in network ho$s& where each network between the source
and destination counts as a single ho$.
QIt uses ?#8 for all message transmissions.
Q7I8 is used over +A,. Aersion 3 of 7I8 uses hardware broadcast and version 2 allows #elivery via
multicast.
QIt can be used to advertise default route $ro$agation. An organi'ation can use 7I8 to
Install a default route in each router.
QIt uses distance vector algorithm.
"77vuzs.net
%(M' message transport is acte! upon by getting %(M' encrypte! in %'.
True
6alse
I5*P message transport is acted upon %/ getting I5*P encapsu#ated in IP (P# 11<
'rotocol a!!resses are abstractions provi!e! by 88888888888.
hardware
software
o$erating system
internet
Protoco# addresses are a%stractions provided %/ so$tware (re$erence
These packets serve same purpose on 88888888 as 0rames on 888888
Intranet& +A,
Internet& WA,
Intranet& WA,
Internet& +A,
=I4-9"! P"5>)-,.
-hese packets serve same purpose in Internet as $rames on !"N
A!!ress mask !e0ines how many bits o0 a!!ress are in su00i5
True
6alse
Address mask defines how many bits of address are in $refix. 8refix defines how much of address used
to identify network.
a single networking technology is best 0or all nee!s.
True
6alse
-here is no sing#e networking techno#og/ that is %est $or a## needs
A computer attache! to a given network can only communicate with other computers attache! to the
same network. %s this a problem with multiple networks5
True
6alse
the chief $roblems with multi$le networks are as follows!
U A com$uter attached to a given network can only communicate with other
<om$uters attached to the same network.
"77vuzs.net
The term sel0#i!enti0ying is use! 0or (lass0ul %' a!!resses because the class o0 the a!!ress can be
compute! 0rom the a!!ress8888888888.
Itself
$refix
suffix
mask
5#ass$u# IP addresses are se#$-identi$/ing %ecause the c#ass o$ the address can %e computed $rom the
address itse#$
+in! the class o0 the a!!ress.
1@1@@111 11@11@11 1@@@1@11 @11@1111
A
0
5
<
7eference table handouts 8 K 2>
vuzs.net
+in! the class o0 the a!!ress"
1111@@11 1@@11@11 11111@11 @@@@1111
A
<
5
0
"77vuzs.net
%n which metho! o0 A!!ress &esolution 'rotocol the protocol a!!ress is !etermine! by har!ware
a!!ress5
/ere MTM stan!s 0or Table lookup, M(M 0or (lose!#0orm (omputation an! MBM 0or Bata Echange5
T
#
<
T& <
7eference table handouts 8 K =>
"77vuzs.net
/hich metho! o0 A!!ress &esolution 'rotocol reAuires har!ware broa!cast5
#
T
<
T& #
"77vuzs.net
/hich metho! o0 A!!ress &esolution 'rotocol resolution with minimum !elay5
T& #
c
T
T& <
%n which metho! o0 A!!ress &esolution 'rotocol the implimentation is more !i00icult5
T& <
T
<
#
7eference table handouts 8 K =>"77vuzs.net
Fn o0 the !esign goals 0or unicast route propagation is 8888888888.
<onsistency
inconsistency
stability
dynamic addressing
8n o$ the design goa#s $or unicast route propagation is sta%i#it/?continua# changes in route are
undesira%#e %ecause the/ #ead to higher 1itter and datagram arriving out o$ order. -hus0 once a unicast
routing protoco# $inds a shortest path0 it usua##/ retains the route unti# a $ai#ure makes the path
unusa%#e. (4e$erence $rom )-%ook
vuzs.net
'ropagation multicast routing in0ormation !i00ers !ramatically 0rom unicast route propagation5
True
6alse
Propagating multicast routing information differs dramatically from unicast route
propagation. -he di$$erence arises %ecause internet mu#ticast a##ows d/namic group mem%ership and
autonomous senders
To save tra00ic, an E6' !oes not summarize routing in0ormation 0rom the autonomous system be0ore
True
6alse
-o save tra$$ic0 an )(P summari@e routing in$ormation $rom the autonomous s/stem %e$ore passing it to
another autonomous s/stem. *ore important an )(P imp#ements po#ic/ constraint that a##ows a s/stem
manager to determine eAact#/ what in$ormation is re#eased outside the organi@ation. *4e$erence $rom )-
%ook-
"77vuzs.net
%n %'v4 the type o0 a!!ress use! 0or collection o0 computers with same pre0i. Are known
as888888888.
Anycast
?nicast
)ulticast
,on of the given
7o##owing are specia# t/pes o$ addresses0 IPvB uses.
Unicast: It is used $or sing#e destination computer.
Multicast: It is used $or mu#tip#e destinationsC possi%#/ not at same site.
Cluster: -his t/pe o$ address is used $or co##ection o$ computers with same pre$iA0
Datagram is de#ivered to one out o$ c#uster.
Special types o0 a!!resses in %'v4 use! 0or multiple !estinationsN possibly not same site. Are known
as88888888
?nicast
Anycast
)ulticast
none of the given
6ollowing are s$ecial ty$es of addresses& I8v: uses!
Gnicast" It is used for single destination com$uter.
Multicast" It is used for multi$le destinationsM $ossibly not at same site.
(luster" This ty$e of address is used for collection of com$uters with same $refix&
#atagram is delivered to one out of cluster.
"77vuzs.net
GB' o00ers application programs a Message#Friente! %nter0ace, applications can !epen! on protocol
to preserve !ata boun!aries.
True
6alse
9DP o$$ers app#ication programs a *essage-8riented Inter$ace. It does not divide messages into packets
$or transmission and does not com%ine messages $or de#iver/.
"D="N-"(),.
: "pp#ications can depend on protoco# to preserve data %oundaries.
"77vuzs.net
&eliability is the responsibility o0 the 888888888 layer
,etwork
#ata link
Trans$ort
A$$lication
4e#ia%i#it/ is the responsi%i#it/ o$ the -ransport #a/er
vuzs.net
T(' uses 8888888 mechanism to control the 0low o0 !ata.
door
window
acknowledgment
retransmission
%n Birect point to point communication a!!ing the .th computer reAuires############ new connections.
,one of the given
,2
,"3
*,2 S,-H2
disadvantage In Direct point to point communication is that adding a new computer to the network
requires N-1 new connections .(P# 23
net
%n 'oint#to#'oint topology there are two topologies.
Tree and 7ing
Star and 7ing
Star and Tree
,one of the given
8OI,T"TO"8OI,T!
In Point-to-Point to$ology there are two to$ologies.
3- STA7 to$ology
2- T755 to$ology
%n #############, network occupies the smaller area like a room a 0loor or a buil!ing
+A,
WA,
)A,
,one of the given
In !"N network occupies the sma##er area #ike a room a $#oor or a %ui#ding.(P# &
.net
1ar!ware that calculates a (&( uses two simple components.
A,# unit and XO7 unit
Shift register and XO7 unit
Shift register and A,#unit
none of the given
<7< uses (ust two hardware com$onents!
U Shift register
U 5xclusive O7 * XO7 unit - .(P# 2'
The 6igabit Ethernet har!ware operates at a rate o0 ########
39 )b$s
399 )b$s
3999 )b$s
,one of the given
(iga%it )thernet that operates at 1 (%ps (1''' *%ps over $i%er optics and twisted pair )thernet ca%#es.
.net
0ormally name! 8888888888 in0ormally known as the twiste! pair Ethernet or T' Ethernet.
39 0ase 2
39 0ase 4
39 0ase T
none of the given
1'+",)--.
-his is another standard o$ wiring scheme. It is common#/ ca##ed 1'+ase--0 -wisted Pair or -P )thernet.
(P# &3 net
An inter0ace 0or thin Ethernet must have an 888888888888 connector , an! must generate signals
accor!ing to the8888888888888 speci0ication.
7."/4& 39 0ase T
7."/4& 39 0ase 4
0,<& 39 0ase 2
0,<& 39 0ase T
"77vuzs.net
A system with re!un!ant bri!ges might have a problem with8888888 in the system.
+oo$
6ilters
S$anning Trees
All given choices
"77vuzs.net
88888888 computes shortest paths in a graph by using weights on e!ges as a measure o0 !istance.
Creedy algorithm
#istance vector algorithm
#i(kstaNs algorithm
none of the given
D1ikstra2s a#gorithm can accommodate weights on edges in graph. -he shortest
Path is then the path with #owest tota# weight (sum o$ the weight with a## edges. It shou#d
+e noted that the shortest path is not necessari#/ with $ewest edges (or hops.
Hasic -A. technologies such as Ethernet, Token &ing, an! +BB% use a 88888.
<onnectionless service $aradigm
<onnection"oriented service $aradigm
none of the given
vuzs.net
8hysical +ayer
Internet +ayer
Trans$ort +ayer
!"3)4 &. ensure re#ia%#e trans$er #a/er & in -5P #a/ering mode# is transport #a/er.
An %nternet A!!ress <%' a!!ress= is a uniAue 8888888888 binary number assigne! to a host an! use!
0or all communication with host
/2"bit
;2"bit
2/"bit
,one of the given
"n Internet address (IP address is a unique 32-%it %inar/ num%er assigned to a
host and used $or a## communication with the host
The a!!ress 8888888888 i!enti0ies the physical network to which the computer is attache!, while the
8888888 i!enti0ies an in!ivi!ual computer on that network.
$refix & suffix
suffix & $refix
suffix & suffix
,one of the given
PREFIX:
It identi$ies the ph/sica# network to which the computers are attached.
SUFFIX:
It identi$ies an individua# computer on the network.
88888888888 places the boun!ary between the 0irst an! secon! octets
<lass A
<lass 0
<lass <
<lass #
88888888888 places the boun!ary between the thir! an! 0ourth octets.
<lass A
<lass 0
<lass <
<lass #
88888888 0iel! o0 hea!er in!icates whether a !atagram is a 0ragment or a complete !atagram.
6+ACS
6+AC)5,T O66S5T
I#5,TI6I<ATIO,
,one of the given
74"(*)N-"-I8N.
"77vuzs.net
888888 provi!es connectionless service.
T<8
?#8
I8
none of the given
9DP has the $o##owing characteristics.
: It is an end-to-end protoco#. It provides app#ication-to-app#ication communication.
: It provides connection#ess service.
: It is a *essage-8riented protoco#.
: It uses %est-e$$ort de#iver/ service.
: It $o##ows ar%itrar/ interaction.
: It is operating s/stem independent
GB' an! T(' are both888888888 layer protocols
8hysical
#ata link
,etwork
Trans$ort
(onnection#oriente! service, 'oint#to#point, (omplete reliability, +ull#!uple communication, Stream
inter0ace, &eliable connection startup an! 6race0ul connection shut!own are the services provi!e!
by8888888888
I8
,one of the given
T<8
?#8
S57AI<5 87OAI#5# 0P T<8!
6ollowing are the services $rovided by T<8!
U <onnection"oriented service
U 8oint"to"$oint
U <om$lete reliability
U 6ull"du$lex communication
U Stream interface
U 7eliable connection start"u$
U Craceful connection shutdown
8hysical +ayer
Internet +ayer
Trans$ort +ayer
!"3)4 &. ensure re#ia%#e trans$er #a/er & in -5P #a/ering mode# is transport #a/er
"77vuzs.net
88888888i!enti0ies which application program on receiving computer shoul! receive the !ata
+ogical address
Source $ort
#estination 8ort
,one of the given
88888888 i!enti0ies the application program that sent the !ata.
#estination 8ort
Source $ort
+ogical address
,one of the given
The 0order Cateway 8rotocol *0C8- uses@@@@@@@@@ for all communication
?#8
T<8
0oth ?#8 and T<8
,one of the given
0O7#57 CAT5WAP 87OTO<O+!
It is most $o$ular 5xterior Cateway 8rotocol in Internet. It has following characteristics!
QIt $rovides routing among autonomous systems *5C8-.
QIt $rovides $olicies to control routes advertised.
QIt uses reliable trans$ort *T<8-.
.
888888888888 uses !istance vector approach to !e0ine routing
0C8
OS86
7I8
,one of the given
7O?TI,C I,6O7)ATIO, 87OTO<O+ *7I8-!
It has the following characteristics!
QIt is used for routing within an autonomous system *IC8-.
QFo$ <ount )etric! 7I8 measures distance in network ho$s& where each network
between the source and destination counts as a single ho$.
QIt uses ?#8 for all message transmissions.
Q7I8 is used over +A,. Aersion 3 of 7I8 uses hardware broadcast and version 2 allows
delivery via multicast.
QIt can be used to advertise default route $ro$agation. An organi'ation can use 7I8 to
install a default route in each router.
QIt uses distance vector algorithm.
"77vuzs.net
%(M' message transport is acte! upon by getting %(M' encrypte! in %'.
True
6alse
I5*P message transport is acted upon %/ getting I5*P encapsu#ated in IP (P# 11<
"77vuzs.net
'rotocol a!!resses are abstractions provi!e! by 88888888888.
hardware
software
o$erating system
internet
Protoco# addresses are a%stractions provided %/ so$tware
These packets serve same purpose on 88888888 as 0rames on 888888
Intranet& +A,
Internet& WA,
Intranet& WA,
Internet& +A,
=I4-9"! P"5>)-,.
-hese packets serve same purpose in Internet as $rames on !"N
.net
A!!ress mask !e0ines how many bits o0 a!!ress are in su00i5
True
6alse
Address mask defines how many bits of address are in $refix. 8refix defines how much of address used
to identify network.
A single networking technology is best 0or all nee!s.
True
6alse
-here is no sing#e networking techno#og/ that is %est $or a## needs"77vuzs.net
A computer attache! to a given network can only communicate with other computers attache! to the
same network. %s this a problem with multiple networks5
True
6alse
the chief $roblems with multi$le networks are as follows!
U A com$uter attached to a given network can only communicate with other
<om$uters attached to the same network.
"77vuzs.net
The term sel0#i!enti0ying is use! 0or (lass0ul %' a!!resses because the class o0 the a!!ress can be
compute! 0rom the a!!ress8888888888.
Itself
$refix
suffix
mask
5#ass$u# IP addresses are se#$-identi$/ing %ecause the c#ass o$ the address can %e computed $rom the
address itse#$
+in! the class o0 the a!!ress.
1@1@@111 11@11@11 1@@@1@11 @11@1111
A
0
5
<
+in! the class o0 the a!!ress"
1111@@11 1@@11@11 11111@11 @@@@1111
A
<
5
0
%n which metho! o0 A!!ress &esolution 'rotocol the protocol a!!ress is !etermine! by har!ware
a!!ress5
T
#
<
T& <
"77vuzs.net
/hich metho! o0 A!!ress &esolution 'rotocol reAuires har!ware broa!cast5
#
T
<
T& #
vuzs.net
/hich metho! o0 A!!ress &esolution 'rotocol resolution with minimum !elay5
T& #
c
T
T& <
%n which metho! o0 A!!ress &esolution 'rotocol the implementation is more !i00icult5
T& <
T
<
#
Fn o0 the !esign goals 0or unicast route propagation is 8888888888.
<onsistency
inconsistency
stability
dynamic addressing
8n o$ the design goa#s $or unicast route propagation is sta%i#it/?continua# changes in route are
undesira%#e %ecause the/ #ead to higher 1itter and datagram arriving out o$ order. -hus0 once a unicast
routing protoco# $inds a shortest path0 it usua##/ retains the route unti# a $ai#ure makes the path
unusa%#e. (4e$erence $rom )-%ook
'ropagation multicast routing in0ormation !i00ers !ramatically 0rom unicast route propagation5
True
6alse
Propagating multicast routing information differs dramatically from unicast route
propagation. -he di$$erence arises %ecause internet mu#ticast a##ows d/namic group mem%ership and
autonomous senders
to save tra00ic an E6' !oes not summarize routing in0ormation 0rom the autonomous system be0ore
True
6alse
to save tra$$ic0 an )(P summari@e routing in$ormation $rom the autonomous s/stem %e$ore passing it to
another autonomous s/stem. *ore important an )(P imp#ements po#ic/ constraint that a##ows a s/stem
manager to determine eAact#/ what in$ormation is re#eased outside the organi@ation. *4e$erence $rom )-
%ook-
%n %'v4 the type o0 a!!ress use! 0or collection o0 computers with same pre0i. Are known as88888
Anycast
?nicast
)ulticast
none of the given
7o##owing are specia# t/pes o$ addresses0 IPvB uses.
Unicast: It is used $or sing#e destination computer.
Multicast: It is used $or mu#tip#e destinationsC possi%#/ not at same site.
Cluster: -his t/pe o$ address is used $or co##ection o$ computers with same pre$iA0
Datagram is de#ivered to one out o$ c#uster.
vuzs.net
Special types o0 a!!resses in %'v4 use! 0or multiple !estinationsN possibly not at same site. 888888888.
?nicast
Anycast
)ulticast
none of the given
6ollowing are s$ecial ty$es of addresses& I8v: uses!
Gnicast" It is used for single destination com$uter.
Multicast" It is used for multi$le destinationsM $ossibly not at same site.
(luster" This ty$e of address is used for collection of com$uters with same $refix&
#atagram is delivered to one out of cluster.
GB' o00ers application programs a Message#Friente! %nter0ace, applications can !epen! on protocol
to preserve !ata boun!aries.
True
6alse
9DP o$$ers app#ication programs a *essage-8riented Inter$ace. It does not divide messages into packets
$or transmission and does not com%ine messages $or de#iver/.
"D="N-"(),.
: "pp#ications can depend on protoco# to preserve data %oundaries.
&eliability is the responsibility o0 the 888888888 layer
,etwork
#ata link
Trans$ort
A$$lication
4e#ia%i#it/ is the responsi%i#it/ o$ the -ransport #a/er
"77vuzs.net
T(' uses 8888888 mechanism to control the 0low o0 !ata.
#oor
window
acknowledgment
retransmission
-5P uses window mechanism to contro# the $#ow o$ data.
the time 0or acknowle!gement to arrival o0 packet !epen!s on.
#istance to destination and <urrent traffic conditions
<urrent traffic conditions
#istance to destination
non of these
-he time $or acknow#edgement to arrive depends on.
: Distance to destination
: 5urrent tra$$ic conditions
"77vuzs.net
+BB% can transmits !ata at a rate o0 ##########
399 million bits $er second
,one of the given
the time 0or acknowle!gement to arrival o0 packet !epen!s on.
#istance to destination and <urrent traffic conditions
<urrent traffic conditions
#istance to destination
non of these
-he time $or acknow#edgement to arrive depends on.
: Distance to destination
: 5urrent tra$$ic conditions"77vuzs.net
+BB% can transmits !ata at a rate o0 ##########
,one of the given
Guestion!"!
Sub(ect! i$v:
Sir&
su$$ose I8v: scheme is de$loyed in com$uter network of medical com$any. In I8v:& who is
res$onsible for fragmentation of I8 datagram
9
"
Answer!"
I8v: source *not intermediate routers- is res$onsible for fragmentation. 7outers sim$ly dro$
datagrams larger than network )T? *)aximum Transmission ?nit-. So source must fragment
datagram to reach destination.
Guestion!"!
Sub(ect! routing
7outing of a $acket from source to destination does not de$end on source address of a $acket. Sir&
what whould be the advantages of this in"de$endency.
9
"
Answer!"
,ext ho$ to destination does not de$end on source of $acket. This $henomenon is called YSource
Inde$endenceN. It has several benefits. It allows fast and efficient routing.
8acket switch need not hove com$lete information about all destinations in s$ite it (ust has next
ho$ so reduces total information and increases dynamic robustness. The network can continue to
function even if to$ology changes without notifying entire network.
why the internet multicast routing is difficult
Internet multicast routing is difficult because internet multicast allows arbitrary com$uter to (oin
multicast grou$ at any time. It allows arbitrary member to leave multicast grou$ at any time. It
also allows arbitrary com$uter to send message to a grou$ *even if not a member-.
Sub(ect! collisions in network
Sir& can network be totally $rotected from collisions with the hel$ of ex$onential back off
9
"
Answer!"
5X8O,5,TIA+ 0A<I O66
It reduces likely hood of se%uence of collision.
Sub(ect! tc$Hi$
T<8HI8 su$$orts different a$$roaches of address resolution algorithm in a real environment. Sir&
what are their names
9
"
Answer!"
Address 7esolution Techni%ues
Address resolution algorithms can be grou$ed into three basic categories!
Z Table looku$
Z <losed"form com$utation
Z )essage 5xchange
Sub(ect! ,AT
Su$$ose an organi'ation wants to share the transmission of multi$le devices of its network with
single $ublicly routable I8 address. To achieve this goal it uses ,AT. Sir it is re%uested to tell what
would be the alternative of ,AT.
9
"
Answer!"
,A8T *,etwork Address and 8ort Translation- or T<8 Slicing
TWI<5 ,AT
<AT
Sub(ect! gateway
7eliability is the base need of communication systems but some gateway $rotocols are considered
unreliable. Sir it is re%uested to convey us which gateway $rotocol is unreliable $rotocol for
trans$ortation of messages
9
Answer!"
We have unreliable transmission in 7outing Information 8rotocol *7I8-.
Sub(ect! A78
Su$$ose in a com$uter network of multinational com$any& network administratorNs system
receives some A78 messages while communication with other system. <onsidering this scenario
Sir it is re%uested to to tell how does system deal these incoming A78 messages
9
Answer!"
When an A78 message arrives& the $rotocol s$ecifies that the receiver must $erform two basic
ste$s.
6irst the receiver extracts the senderNs addresses binding and checks to see if it is $resent in the
cache. If not& it u$dates the cache.
The receiver examines the o$eration field of the message to determine whether the message is a
re%uest or a res$onse. If the message is a re%uest& the receiver com$ares the field TA7C5T 8A##7
with the local $rotocol address. If the two are identical& the com$uter is the target of the re%uest
and must send an A78 res$onse.
22
Sub(ect! multicast
"
Answer!"
Several multicast $rotocols exist. Some of the $ro$osed $rotocols are!
#istance Aector )ulticast 7outing 8rotocol *#A)78-
<ore 0ased Trees *<0T-
8rotocol Inde$endent )ulticast@ S$arse )ode *8I)"S)-
8rotocol Inde$endent )ulticast @ #ense )ode *8I)"#)-
)ulticast 5xtensions to the O$en Shortest 8ath 6irst 8rotocol *)OS86-
=2
Sub(ect! )?+TI<ASTI,C
.
Guestion!"! >2
Sub(ect! 5C8
What gateway $rotocol mostly used as 5C8 with some $ro$erties.
9
"
0order Cateway 8rotocol *0C8- is most $o$ular 5xterior Cateway 8rotocol in Internet. It has following
characteristics!
U It $rovides routing among autonomous systems *5C8-.
U It $rovides $olicies to control routes advertised.
U It uses reliable trans$ort *T<8-.
U It gives $ath of autonomous systems for each destination.
U <urrently the 5C8 is of choice in the Internet.
U It $rovides facilities for Transit 7outing.
>>
Sub(ect! #5+AP
What ty$e of Trans$ort 8rotocol is used when 8acket dro$$ing is $roffered than #elay.
9
"
Answer!"
?#8 *?ser datagram $rotocol- is used in this case.
>:
Sub(ect! I8 #ATAC7A)
What is the right $lace in I8 #atagram Feader to add extra o$tions
9
"
Answer!"
Several o$tions can be added in I8 o$tions field.
Sub(ect! #5+AP
,etworking <om$onents take sometime while forwarding data over network medium. Identify the
ty$e of delay
9
"
Answer!"
There are following ty$es of delay!
87O8ACATIO, #5+AP!
It defined as the time to travel across medium.
SWIT<FI,C #5+AP!
It is the time re%uired for network com$onent *hub& bridge& $acket switch- to forward data.
A<<5SS #5+AP!
It is the time re%uired to get control of medium *<S)AH<#& token-.
G?5?I,C #5+AP!
It is the time en%uired in $acket switches.
>/
Sub(ect! OS86
Which characteristics OS86 have
9
"
Answer!"
6ollowing are the characteristics of O$en Shortest 8ath 6irst *OS86-!
3. To satisfy demand for a routing $rotocol that can scale to large organi'ations& the I5T6
devised an IC8 known as the O$en Shortest 8ath
6irst 8rotocol *OS86-.
2. OS86 allows subdivision of Autonomous System into areas.
;. The link status information is $ro$agated within an area.
/. The routes are summari'ed before being $ro$agated to another area.
4. It reduces overhead *less broadcast traffic-.
:. 0ecause it allows a manager to $artition the routers and networks in an autonomous
system into multi$le areas
>. OS86 can scale to handle a larger number of routers than other IC8s.
>;
Sub(ect! A78
,etwork administrator receives some messages on his system. Fow does com$uter deal this
incoming A78 messages*
9
"
Answer!"
6ollowing se%uence of ste$s will be $erformed!
3. 6irst the receiver extracts the senderNs addresses binding and checks to see if it is
$resent in the cache.
2. If not& it u$dates the cache.
;. The receiver examines the o$eration field of the message to determine whether the
message is a re%uest or a res$onse.
/. If the message is a re%uest& the receiver com$ares the field TA7C5T 8A##7 with the
local $rotocol address.
4. If the two are identical& the com$uter is the target of the re%uest and must send an A78
res$onse.
>2
Sub(ect! tc$
Fow congestion is controlled by T<8*
9
"
Answer!"
T<8 uses a number of mechanisms to achieve high $erformance and avoid
where network $erformance can fall by several orders of magnitude. These mechanisms control the
rate of data entering the network& kee$ing the data flow below a rate that would trigger colla$se.
They also yield an a$$roximately max"min fair allocation between flows.
Acknowledgments for data sent& or lack of acknowledgments& are used by senders to infer network
conditions between the T<8 sender and receiver. <ou$led with timers& T<8 senders and receivers
can alter the behavior of the flow of data. This is more generally referred to as congestion control
andHor network congestion avoidance.
)odern im$lementations of T<8 contain four intertwined algorithms!
avoidance& fast retransmit& and fast recovery *76< 4:23-.
>3
Sub(ect! snuffer
What are the o$erations of network snuffer
9
"
Answer!"
The basic idea behind the o$eration of network analy'er *,etwork Sniffer- is a com$uter with a
network interface that receives all frames& which is called $romiscuous mode. )any deskto$
com$uters have interface that can be configured for $romiscuous mode. When combined with
software com$uter can examine any frame on +A,. In this way the communication across +A, is
guaranteed to be $rivate. This com$uter receives and dis$lays *but does not res$ond to- frames on
the +A,. ,etwork analy'er can be configured to filter and $rocess frames. It can count frames of
s$ecific ty$e of si'e. It dis$lays only frames from or to s$ecific com$uters. In general it can be
configured to match any value of any field and ca$ture only these frames meeting the filter
s$ecifications.
>9
Sub(ect! reachbility
Fow can we test any website for exam$le www.vu.edu.$k
9
"
Answer!"
This is done through 8I,C command for $robing the Internet.
:=
Sub(ect! $rotocol
which $rotocol is used within organi'ation. Which $rotocol is used to handle traffic in com$uter
network over countries
9
Answer!"
An autonomous system can be thought of as a set of networks and routers under one
administrative authority *organi'ation-. Interior Cateway 8rotocol *IC8- is used among routers
within autonomous system *organi'ation-. 6ollowing are the Internet routing $rotocols!
0order Cateway $rotocol
7outing Information 8rotocol
O$en Shortest 8ath 6irst 8rotocol
6or secure data communication in an organi'ation Airtual 8rivate ,etwork *A8,- is used.
Question No: 31 ( Marks: 2 )
What are the advantages of a multipoint connection over a point-
to-point connection?
Answer:
Point-to-point connection is limited to two devices, were else
more tan two devices sare a sin!le link in multipoint
connection" Multipoint connection can #e used $or $ail-over
and relia#ilit%"
What's the name of the telephone service in which there is no
need of dialing.
Answer:
&'(( (di!ital data service) is te telepone service in wic
tere is no need o$ dialin!"
Which type of frames are present in BSC frames?
Answer:
)ere are two t%pes o$ $rames tat are present in *(+"
1" +ontrol ,rames and
2" 'ata ,rames
Question No: 3- ( Marks: 2 )
.at metods o$ line discipline are used $or peer to peer and
primar% secondar% communication/
Answer:
Line discipline is done in two ways:
. !"#$%C& '!n(uiry %c)nowledgement*
+his is used for peer to peer communication.
,. -oll$ Select
+his method is used for primary secondary communication.
1ow does te cecksum cecker know tat te received data
unit is undama!ed/ 233
Answer:
Chec)sum Chec)er or generator:
+he sender su.divides data units into e(ual segments of /n0
.its'1 .its*
. +hese segments are added together using one0s complement.
,. +he total 'sum* is then complemented and appended to the
end of the original data unit as redundancy .its called
C2!C&S34.
5. +he e6tended data unit is transmitted across the networ).
7. +he receiver su.divides data unit and adds all segments
together and complement the result.
8. 9f the intended data unit is intact: total value found .y adding
the data segments and the chec)sum field should .e ;ero.
1. 9f the result is not ;ero: the pac)et contains an error < the
receiver re=ects it.
.ic one as more overead, a repeater or a #rid!e/ 56plain
%our answer" 233
Answer:
% .ridge has more overhead than a repeater. % .ridge processes
the pac)et at two
layers > a repeater processes a frame at only one layer. % .ridge
needs to search a
ta.le and find the forwarding port as well as to regenerate the
signal> a repeater
only regenerates the signal. 9n other words: a .ridge is also a
repeater 'and more*> a
repeater is not a .ridge.
.rite down disadvanta!es o$ 8in! )opolo!%"
Answer:
?isadvantages of @ing +opology
3nidirectional +raffic
% .rea) in a ring that is a disa.led station can disa.le the entire
networ)
Can .e solved .y using:
?ual @ing or
% switch capa.le of closing off the Brea)
1ow parit% #its are counted in :8+ error detection metod
tecni;ue in case o$ odd parit% !enerator/
Answer:
Aor e6ample:
We want to +B the .inary data unit CCCC
%dding together the num.er of 0s gives us 5: an odd num.er
Before +B: we pass the data unit through a parity generator:
which counts the 0s and appends the parity .it '* to the end
+he total num.er of 0s is now 7: an even num.er +he system
now transfers the entire e6panded across the networ) lin) When
it reaches its destination: the @B puts all D .its through an even
parity chec)ing function
9f the @B sees CCCC: it counts four ones: an even num.er and
the data unit passes
When the parity chec)er counts the 0s: it gets 8 an odd num.er
+he receiver )nows that an error has occurred somewhere and
therefore re=ects the whole unit Some systems may also use E??
parity chec)ing +he principal is the same as even parity
Question No: -< ( Marks: 0 )
56plain Protocol 'ata =nit (P'=)/
Answer: -rotocol data unit '-?3* is an ES9 term that refers
generically to a group of information added or removed .y a
particular layer of the ES9 model. 9n specific terms: an L6-?3
implies the data and headers defined .y layer 6. !ach layer uses
the -?3 to communicate and e6change information. +he -?3
information is only read .y the peer layer on the receiving device
and then stripped off: and data is handed over to the ne6t upper
layer.
#uestion "o: , ' 4ar)s: , *
9s there a comparison .etween +C-$9- reference model and
ES9 reference model.
Both the +C-$9- and ES9 are international standards for data
communication. Both use the concept of protocol layering. +hese
are the conceptual tools that is often used to show how various
protocols and technologies fit together to implement networ)s.
+he functions that the model represents are much the same. +his
means that the +C-$9- and the ES9 models are really (uite similar
in nature even if they don't carve up the networ) functionality
pie in precisely the same way. +here is a fairly natural
correspondence .etween the +C-$9- and ES9 layers> it =ust isn't
always a Fone-to-oneG relationship. Since the ES9 model is used
so widely: it is common to e6plain the +C-$9- architecture .oth in
terms of the +C-$9- layers and the corresponding ES9 layers
#uestion "o: ,, ' 4ar)s: , *
Fow can a datagram be transmitted across a $hysical network that does not understand the
datagram format
5nca$sulate[
L The network interface layer enca$sulates an entire datagram in the data area
of a hardware frame.
L The network hardware ignores the datagram format.
L The hardware treats a frame containing a datagram like any other frame.
L The sender $laces a frame ty$e in the frame header indicating that the frame
contains a datagram.
L The receiver reads the frame ty$e and knows the frame contains a datagram.

"o: ,1 ' 4ar)s: 5 *
Why does 9-v1 use separate !6tension 2eaders?
9-v1 use separate !6tension 2eaders. Aragmentation information
is )ept in separate e6tension header. !ach fragment has .ase
header and 'inserted* fragmentation header. !ntire datagram
including original header may .e fragmented.
#uestion "o: ,H ' 4ar)s: 8 *
Consider the 9- addresses: HD.,CC.,H.8 and the
corresponding su.net mas)s ,88.,88.,88.C: then find out the
following:
a. +he num.er of .its used for su.netting '%nswer D .its*
.. +otal num.er of host in the su.net '%nswer ,87 *
c. +he networ) address of the
su.net. '%nswer HD.,CC.,H.C*
d. +he su.net address of the 9- address.
2ere is the online calculator for su.netting
"E+!. +his is =ust for concept not included in the answer
+he su.net mas) determines what portion of the +C-$9- address
represents your networ) and what portion can .e used for your
hosts. +he networ) num.er represents the street 9 live on: and
the host portion is used for the num.ers on all the houses on my
street.
% su.net mas) of ,88.,88.,88.C means that the first three octets
of the address will .e used for the networ): and thus our networ)
num.er is I,.1D.. +his means we can have ,87 computers on
this networ): .ecause the fourth octet is not .eing used .y the
networ) portion of the address. We )now this .ecause of the C in
the su.net mas) ',88.,88.,88.C*.
#uestion "o: ,D ' 4ar)s: 8 *
2ow does 9- software reassem.le fragments that arrive out of
order?
% uni(ue 9? num.er of each outgoing datagram
When a router fragments the datagram: the router copies the 9?
num.er into each fragment.
+he fragment EAAS!+ field tells a receiver how to order fragments
within a given datagram
+he process of creating a copy of the original datagram from
fragments is called reassem.ly.
#uestion "o: ,I ' 4ar)s: 8 *
Write down the comparison of ?istance- vector and Lin) J state
algorithm?
CE4-%@9SE":
?9S+%"C!-K!C+E@ @E3+9"L:
M 9t is very simple to implement.
M -ac)et switch updates its own routing ta.le first.
M 9t is used in @9-.
L9"&-S+%+! %LLE@9+24:
M 9t is much more comple6.
M Switches perform independent computations.
M 9t is used in ES-A.
#uestion "o: 5C ' 4ar)s: C *
?esci.e in detail what is the purpose of the following ta.le? What
sort of information can .e e6tracted?
6irst 6our 0its Of
address
Table index in
decimal
<lass of Address
9999 9 A
9993 3 A
9939 2 A
9933 ; A
9399 / A
9393 4 A
9339 : A
9333 > A
3999 2 0
3993 = 0
3939 39 0
3933 33 0
3399 32 <
3393 3; <
3339 3/ #
3333 34 5
+he ta.le shows in the figure: how the class of address can .e
computed.

#uestion "o: 5 ' 4ar)s: C *
List down and descri.e at least five characteristics of @outing
9nformation -rotocol.
@E3+9"L 9"AE@4%+9E" -@E+ECEL '@9-*:
9t has the following characteristics:
N9t is used for routing within an autonomous system '9L-*.
N2op Count 4etric: @9- measures distance in networ) hops: where
each networ)
Between the source and destination counts as a single hop.
N9t uses 3?- for all message transmissions.
N@9- is used over L%". Kersion of @9- uses hardware .roadcast
and version , allows
?elivery via multicast.
N9t can .e used to advertise default route propagation. %n
organi;ation can use @9- to
9nstall a default route in each router.
N9t uses distance vector algorithm.
N@9- allows hosts to listen passively and update its routing ta.le

'oes >(P, onl% sare in$ormation witin an area or does it
allow communication #etween areas?
ES-A allows su.division of %utonomous System into areas. +he
lin)-status information is propagated within an area. +he routes
are summari;ed .efore .eing propagated to another area. 9t
reduces overhead 'less .roadcast traffic*. Because it allows a
manager to partition the routers and networ)s in an autonomous
system into multiple areas: ES-A can scale to handle a larger
num.er of routers than other 9L-s.
Question No: 2- ( Marks: 3 )
'escri#e te di$$erence #etween static and d%namic routin!/
()A)?+ 8>=)?N@:
9t is one of the forms of 9nternet routing. 9n Static routing: the
ta.le is initiali;ed
When system .oots and there is no further changes.
'ANAM?+ 8>=)?N@:
9n dynamic routing the ta.le is initiali;ed when system .oots. 9t
includes routing
Software which learns routes and updates ta.le. 9n this way
continuous changes are
possi.le due to routing software.
.at is te $irst address in te #lock i$ one o$ te addresses
is 1-<"12<"9-"2-B2</
)e $irst address in te #lock is 1-<"12<"9<"<B2<
W! can use the following short cut to find the first address
3. divide the prefi6 length into four groups'corresponding to the
four .ytes in an address* and find the num.er of s in each group
2. if the num.er of s in a group is D the corresponding .yte in the
first address is the same 'no change*
;. 9f the num.er of s in the group is ;ero 'nos*: the corresponding
.yte in the first address is C
/. if the num.er of s in a group is .etween ;ero and eight: we )eep
the corresponding .its in that group
.rite tree new $eatures o$ ?P:4"
+he new features of 9-K1 are as follows:
M 9-K1 addresses are ,D .its.
M 2eader format is entirely different.
M %dditional information is stored in optional e6tension headers:
followed .y data.
M Alow la.el and (uality of service allows audio and video
applications to esta.lish
%ppropriate connections.
M "ew features can .e added more easily. So it is e6tensi.le.
.at is te di$$erence #etween an interior !atewa% protocol
and an e6terior !atewa% protocol/ Name an e6ample o$ eac"
?N)58?>8 @A)5.AA P8>)>+>C( (?@Ps):
9t is used among routers within autonomous system. +he
destinations lie within 9L-.
5D)58?>8 @A)5.AA P8>)>+>C( (5@Ps):
9t is used among autonomous systems. +he destinations lie
throughout 9nternet
Question No: 2E ( Marks: 0 )
.at are ?Pv4 A''85(( N>)A)?>N/
?Pv4 A''85(( N>)A)?>N:
,D-.it addresses unwisely in dotted decimal> re(uires 1
num.ers:
C8.,,C.51.CC.,88.,88.,88.,88.C.C.D.,D.7C.C.,88.,88
Lroups of 1-.it num.ers in he6 separated .y colons J colon
he6adecimal 'or colon he6*.
1I?C: DD17:AAAA: AAAA: C:,DC:DCC%:AAAA
Oero-compression J series of ;eroes indicated .y two colons
AACC: C:C:C:C:C:C:B
AACC::B
9-v1 address with I1 leading ;eros is interpreted to hold an 9-v7
address.
Question No: 3< ( Marks: 1< )
C?() (>M5 +1A8A+)58?()?+( >, A +C?5N)"
+1A8A+)58?()?+( >, A +C?5N):
+he characteristics of a client are e6plained .elow:
NClient is an ar.itrary application program.
N9t .ecomes client temporarily.
N9t can also perform other computations.
N9t is invo)ed directly .y the user.
N9t runs locally on the user0s computer.
N9t actively initiates contact with a server.
N9t contacts one server at a time.
Question No: 31 ( Marks: 1< )
.it elp o$ te dia!ram #elow, e6plain )+P (e!ment ,ormat:

+C- uses single format for all messages. +C- uses the term
segment to refer to a message. !ach message sent from +C- on
one machine to +C- on another machine uses this format
including data and ac)nowledgement
+iel! .ame Size <bytes= Bescription
SourcePort 2
e$hemeral *client- $ort numberSource'ort" The 3:"bit $ort
number of the $rocess that originated the T<8 segment on the
source device. This will normally be an for a re%uest sent by a
client to a server
DestinationPort 2
DestinationPort: The 3:"bit $ort number of the $rocess that is
the ultimate intended reci$ient of the message on the
destination device.
Sequence Number /
Sequence Number: 6or normal transmissions& the se%uence
number of the first byte of data in this segment. In a
connection re%uest *,3N- message& this carries the initial
se%uence number *IS,- of the source T<8.
Acknole!"ment
Number
/
Acknole!"ment Number: When the "5> bit is set& this
segment is serving as an acknowledgment *in addition to other
$ossible duties- and this field contains the se%uence number
the source is next ex$ecting the destination to send.
#in!o 2 #in!o: Indicates the number of octets of data the sender of
this segment is willing to acce$t from the receiver at one time.
This normally corres$onds to the current si'e of the buffer
allocated to acce$t data for this connection.
C$ecksum 2
3:"bit checksum for data integrity $rotectionC$ecksum: A &
com$uted over the entire T<8 datagram $lus a s$ecial D$seudo
head...
Ur"ent Pointer 2
Ur"ent Pointer: ?sed in con(unction with the 94( control bit
for $riority data transfer. This field contains the se%uence
number of the last byte of urgent data.
%&tions Aariable
%&tions! T<8 includes a generic mechanism for including one or
more sets of o$tional data in T<8 segment. 5ach of the o$tions
can be either one byte in length or variable length. The first
byte if the o$tion kind subfield and itNs value s$ecifies the ty$e
of o$tion& which in turn indicates whether the o$tion is (ust a
single byte or multi$le bytes. O$tions that are many bytes
consist of three fields

Sub0iel! name Size <bytes= Bescription
O$tion"kind 3 Fption#kin!" s$ecifies the
o$tion ty$e
O$tion"length! 3 Fption#length" the length of
the entire o$tion in bytes&
including the o$tion"kind and
o$tion"length fields.
O$tion"data Aariable Fption#!ata" the o$tion data
itself in at least one oddbll case&
this field is omitted*making
o$tion length e%ual to 2-
5) Message oriented Interface, advantages and disadvantages (5) (P# 120)
MESSAGE-OIE!"E# I!"E$A%E&
'#P offers a(()ication (rogra*s a Message-Oriented Interface+ It does not divide
*essages into (ac,ets for trans*ission and does not co*-ine *essages for de)iver.+
/et0s disc1ss its advantages and disadvantages+
A#2A!"AGES&
3 A(()ications can de(end on (rotoco) to (reserve data -o1ndaries+
g1ess(a(ers+.sa(a,+co*
#ISA#2A!"AGES&
3 Eac4 '#P *essage *1st fit into a sing)e IP datagra*+
3 It can res1)t to an inefficient 1se of t4e 1nder).ing net5or,+
6) %once(t of area in OSP$ (O(en S4ortest Pat4 $irst Protoco)) (P# 120)
OSP$ AEAS&
OSP$ a))o5s s1-division of A1tono*o1s S.ste* into areas+ "4e )in,-stat1s infor*ation
is (ro(agated 5it4in an area+ "4e ro1tes are s1**ari7ed -efore -eing (ro(agated to
anot4er area+ It red1ces over4ead ()ess -roadcast traffic)+ 8eca1se it a))o5s a *anager to
(artition t4e ro1ters and net5or,s in an a1tono*o1s s.ste* into *1)ti()e areas, OSP$
can sca)e to 4and)e a )arger n1*-er of ro1ters t4an ot4er IGPs+
9) 8enefits of data st1ffing &- P# 120)
In genera) to disting1is4 -et5een data -eing sent and contro) infor*ation s1c4 as fra*e
de)i*iters net5or, s.ste*s arrange for t4e sending side to c4ange t4e data s)ig4t). -efore
it is sent -eca1se s.ste*s 1s1a)). insert data or -.tes to c4ange data for trans*ission, t4e
tec4ni:1e is ,no5n as #ata St1ffing+
;rite so*e *erits 1sed -. ro1ting (rotoco)s P# 1<5)
A ro1ting (rotoco) is a (rotoco) t4at s(ecifies 4o5 ro1ters co**1nicate 5it4 eac4 ot4er,
disse*inating infor*ation t4at ena-)es t4e* to se)ect ro1tes -et5een an. t5o nodes on
a co*(1ter net5or,, t4e c4oice of t4e ro1te -eing done -. ro1ting a)gorit4*s+
"4ere are t5o -road c)asses of Internet o1ting Protoco)&
I!"EIO GA"E;A= PO"O%O/S (IGPs)&
It is 1sed a*ong ro1ters 5it4in a1tono*o1s s.ste*+ "4e destinations )ie 5it4in IGP+
E>"EIO GA"E;A= PO"O%O/S (EGPs)&
It is 1sed a*ong a1tono*o1s s.ste*s+ "4e destinations )ie t4ro1g4o1t Internet
10) 1nicast ro1nting and *1)ticast ro1ting P# 11?)
M'/"I%AS" O'"I!G&
Internet *1)ticast ro1ting is diffic1)t -eca1se internet *1)ticast a))o5s ar-itrar. co*(1ter
to @oin *1)ticast gro1( at an. ti*e+ It a))o5s ar-itrar. *e*-er to )eave *1)ticast gro1( at
an. ti*e+ It a)so a))o5s ar-itrar. co*(1ter to send *essage to a gro1( (even if not a
*e*-er)
'nicast& It is 1sed for sing)e destination co*(1ter+
M1)ticast& It is 1sed for *1)ti()e destinationsA (ossi-). not at sa*e site+
54. EGP not 1se ro1ting *etricBB(5) P# 11?)
A)t4o1g4 EGP is a d.na*ic ro1ting (rotoco), it 1ses a ver. si*()e design+ It does not 1se
*etrics and t4erefore cannot *a,e tr1e inte))igent ro1ting decisions
;e can0t 1se EGP in ro1ting *etric -eca1se EGP is 1sed a*ong a1tono*o1s s.ste*s+
"4e destinations )ie t4ro1g4o1t Internet
Co5 congestion contro) -. tc(B(5) P# 12D)
"4e goa) of congestion contro) is to avoid adding retrans*issions to an a)read. congested
net5or,+ ed1cing t4e 5indo5 si7e :1ic,). in res(onse to t4e )ost *essages does it+ It is
ass1*ed t4at )oss is d1e to congestion+
;4en a "%P connection first -egins, t4e S)o5 Start a)gorit4* initia)i7es a congestion
5indo5 to one seg*ent, 54ic4 is t4e *aEi*1* seg*ent si7e (MSS) initia)i7ed -. t4e
receiver d1ring t4e connection esta-)is4*ent (4ase+ ;4en ac,no5)edge*ents are
ret1rned -. t4e receiver, t4e congestion 5indo5 increases -. one seg*ent for eac4
ac,no5)edge*ent ret1rned+ "41s, t4e sender can trans*it t4e *ini*1* of t4e congestion
5indo5 and t4e advertised 5indo5 of t4e receiver, 54ic4 is si*(). ca))ed t4e
trans*ission 5indo5
IPv6 addressing (5) P# 11?)
IPv6 A##ESSI!G&
IPv6 1ses 12D--it addresses+ A 12D--it address inc)1des net5or, (refiE and 4ost s1ffiE+
An advantage of IPv6 addressing is t4at it 4as no address c)asses i+e+ (refiEFs1ffiE
-o1ndar. can fa)) an.54ere+
$o))o5ing are s(ecia) t.(es of addresses, IPv6 1ses&
'nicast& It is 1sed for sing)e destination co*(1ter+
M1)ticast& It is 1sed for *1)ti()e destinationsA (ossi-). not at sa*e site+
%)1ster& "4is t.(e of address is 1sed for co))ection of
#efine Gitter (2) (P# 66)
GI""E&
Gitter is t4e ter* 1sed for variance in trans*ission de)a.s+
Gitter is significance for voice, video and data+ In /A!s, @itter can occ1r 54en a (ac,et is
de)a.ed -eca1se t4e net5or, is -1s.+
#E$I!E "%P(2) (P# 122,12<)
"%P (rovides re)ia-)e trans(ort service+ "%P is t4e *a@or trans(ort (rotoco) in t4e
"%PFIP s1ite+ It 1ses 1nre)ia-)e datagra* service offered -. IP 54en sending data to
anot4er co*(1ter+ It (rovides re)ia-)e data de)iver. service to a(()ications+
;4at is c)ient server (2) (P# 1?5)
"4e t5o a(()ication (rogra*s *a,e contact in t4e fo))o5ing 5a.&
One a(()ication active). -egins eEec1tion first and anot4er a(()ication 5aits (assive). at
(rearranged )ocation+ "4is (rocess is ca))ed c)ient-server interaction+
Co5 receiver ,no5s inco*ing fra*e is i( datagra* (2)
According to its IP address nat1re -eca1se in IP 4eader (arts a)) t4e infor*ation avai)a-)e
t4at 54ic4 ,ind of t4e datagra* t4e receiver received+
;4. organi7ation does not 1se sing)e ro1ter(<)
if t4ere is no signa), 4o5 sever co*e to ,no5 t4ere is co**1nication arrived(<) -. @1st
g1essing and after fiEed ti*e t4e sender can0t received an. res(onse so t4e sender again
sent 4e data so 54en 4e received an. A%H t4an 5e ,no5 no5 t4e (at4 is c)ear t4e read.
to co**1nicate 5it4 receiver
An ot4er (a(er
11
54at are t5o i*(ortant (rinci(a) t4at IP address 4ierarc4. granteeB 2 *ar,s
"CE IP A##ESS CIEA%C=&
Eac4 <2--it IP address is divided into t5o (arts&
PE$I>&
It identifies t4e (4.sica) net5or, to 54ic4 t4e co*(1ters are attac4ed+
S'$$I>&
It identifies an individ1a) co*(1ter on t4e net5or,+
does OSP$ s4are infor*ation 5it4in an area or it a))o5 co**1nication -F5
areaB 2 *ar,s (P# 1?1)
OSP$ AEAS&
OSP$ a))o5s s1-division of A1tono*o1s S.ste* into areas+ "4e )in,-stat1s infor*ation
is (ro(agated 5it4in an area+ "4e ro1tes are s1**ari7ed -efore -eing (ro(agated to
anot4er area+ It red1ces over4ead ()ess -roadcast traffic)+ 8eca1se it a))o5s a *anager to
(artition t4e ro1ters and net5or,s in an a1tono*o1s s.ste* into *1)ti()e areas, OSP$
can sca)e to 4and)e a )arger n1*-er of ro1ters t4an ot4er IGPs+
;4ere s4o1)d I%MP *essage -e sentB 2 *ar,s (P# 119)
I%MP *essage is sent in res(onse to inco*ing datagra*s 5it4 (ro-)e*s+ I%MP *essage
is not sent for I%MP *essage+
Co5 t4e "%P is is re)ia-)e (rotoco)B 2 *ar,s (P# 12<)
e)ia-i)it. is f1nda*enta) in a co*(1ter s.ste*+ Soft5are in t4e Internet *1st (rovide
t4e sa*e )eve) of re)ia-i)it. as a co*(1ter s.ste*+ Soft5are *1st g1arantee (ro*(t and
re)ia-)e co**1nication 5it4o1t an. )oss, d1()ication, and c4ange in t4e order+
;4ere t4e connection is orients service 1se connection identifier instead of f1))
addressB 2 *ar,s (P# 69)
"4e connection-oriented service (aradig* for net5or,ing is si*i)ar to t4e *anner in
54ic4 te)e(4ones are 1sed+ "4is is given as fo))o5s& A ca))er dia)s a n1*-er of t4e
destination+ "4e te)e(4one at t4e destination signa)s t4e arriva) of a connection re:1est+ If
t4e ca))ed (erson does not ans5erA t4e ca))er gives 1( after 5aiting for a ti*eo1t+ If t4e
ca))ed (erson does ans5er, t4en t4e connection is esta-)is4ed+
In data co**1nication, as -inar. connection identifier is given to eac4 of t4e t5o Parties
to ena-)e identification of t4e connection+
S1**ari7e IP *1)ticast se*anticsB 2 *ar,s (P# 1?2)
IP M'/"I%AS" SEMA!"I%S&
IP *1)ticast gro1( is anon.*o1s in t5o 5a.s&
1+ !eit4er a sender nor a receiver ,no5s t4e identit. or t4e n1*-er of gro1( *e*-ers+
2+ o1ters and 4osts do not ,no5 54ic4 a(()ications 5i)) send a datagra* to a gro1(+
Internet ro1ting 4o5 does a 4ost @oin and )eave t4e gor1(B< *ar,s (on net )
A 4ost sends a re:1est to create, @oin, or )eave a gro1( to an i**ediate neig4-or gate5a.+
If t4e 4ost re:1ests creation of a gro1(, a ne5 net5or, *e*-ers4i( record is created -.
t4e serving gate5a. and distri-1ted to a)) ot4er gate5a.s+ If t4e 4ost is t4e first on its
net5or, to @oin a gro1(, or if t4e 4ost is t4e )ast on its net5or, to )eave a gro1(, t4e
gro1(Is net5or, *e*-ers4i( record is 1(dated in a)) gate5a.s
;rite t4e ne5 feat1re if i(v6B <*ar,s ( ( # 111 )
"4e ne5 feat1res of IP26 are as fo))o5s&
3 IP26 addresses are 12D -its+
3 Ceader for*at is entire). different+
3 Additiona) infor*ation is stored in o(tiona) eEtension 4eaders, fo))o5ed -. data+
3 $)o5 )a-e) and :1a)it. of service a))o5s a1dio and video a(()ications to esta-)is4
a((ro(riate connections+
3 !e5 feat1res can -e added *ore easi).+ So it is eEtensi-)e+
#ifference -F5 eE()icit and i*()icit fra*e t.(eB < *ar,s ( ( # <6 )
E>P/I%I" $AME "=PE&
In t4is t.(e t4e identif.ing va)1e is inc)1ded 5it4 fra*e descri-es t.(es of inc)1ded data+
IMP/I%I" $AME "=PE&
In i*()icit fra*e t4e receiver *1st infer fro* fra*e data+
%4aracteristics of 8GPB 5 *ar,s ( on net )
J e)ia-)e trans(ort (rotoco)
J /oo( detection
J %I# s1((ort
J /arge ro1ting ta-)e s1((ort
J Po)ic.--ased ro1ting
Iuestion No/ 21 = !ar's/ 2 )
Is there a co#parison $etween T"0I" reference #odel and -SI reference
#odel.
%oth the T"0I" and -SI are international standards for data co##unication.
%oth use the concept of protocol layering. These are the conceptual tools that is
often used to show how various protocols and technologies fit together to
i#ple#ent networ's. The functions that the #odel represents are #uch the
sa#e. This #eans that the T"0I" and the -SI #odels are really (uite si#ilar in
nature even if they donJt carve up the networ' functionality pie in precisely the
sa#e way. There is a fairly natural correspondence $etween the T"0I" and -SI
layersK it @ust isnJt always a Gone8to8oneH relationship. Since the -SI #odel is
used so widely& it is co##on to e+plain the T"0I" architecture $oth in ter#s of
the T"0I" layers and the corresponding -SI layers
Cow can a datagra# $e trans#itted across a physical networ' that does not
understand the datagra# for#atL
EncapsulateM
The networ' interface layer encapsulates an entire datagra# in the data area of
a hardware fra#e.
The networ' hardware ignores the datagra# for#at.
The hardware treats a fra#e containing a datagra# li'e any other fra#e.
The sender places a fra#e type in the fra#e header indicating that the fra#e
contains a datagra#.
The receiver reads the fra#e type and 'nows the fra#e contains a datagra#.
1hat is the $asic concept of Twice NAT =Networ' Address Translation)L
Twice NAT is another variant of NAT. it is used with site that runs server. In this
process NAT $o+ is connected to *o#ain Na#e.
1hy does I"v4 use separate E+tension CeadersL
I"v4 use separate E+tension Ceaders. )rag#entation infor#ation is 'ept in
separate e+tension header. Each frag#ent has $ase header and =inserted)
frag#entation header. Entire datagra# including original header #ay $e
frag#ented.
Iuestion No/ 2< = !ar's/ : )
onsider the I" addresses/ 1<7.299.12<.: and the corresponding su$net #as's
2::.2::.2::.9& then find out the following/
a. The nu#$er of $its used for su$netting =Answer 7 $its)
$. Total nu#$er of host in the su$net =Answer 2:5 )
N 2O7 N 2:482 N 2:5 = 7 $its are used for host and 82 is used for $roadcast
and netwro' I*)
c. The networ' address of the su$net. =Answer 1<7.299.12<.9)
d. The su$net address of the I" address.
Start $y using 2:4& the su$net #as'& which is 2:489N2:4. The first su$net is 7.
The ne+t su$net would $e 14& then 25& and then 62. This host is in the 25
su$net& the $roadcast address is 61& and the valid host range is 2: through 61.
See hapter 6 for #ore infor#ation on I" addressing.
The su$net #as' deter#ines what portion of the T"0I" address represents
your networ' and what portion can $e used for your hosts. The networ' nu#$er
represents the street I live on& and the host portion is used for the nu#$ers on
all the houses on #y street.
A su$net #as' of 2::.2::.2::.9 #eans that the first three octets of the
address will $e used for the networ'& and thus our networ' nu#$er
is1F2.147.1. This #eans we can have 2:5 co#puters on this networ'& $ecause
the fourth octet is not $eing used $y the networ' portion of the address. 1e
'now this $ecause of the 9 in the su$net #as' =2::.2::.2::.9).
Iuestion No/ 27 = !ar's/ : )
Cow does I" software reasse#$le frag#ents that arrive out of orderL
A uni(ue I* nu#$er of each outgoing datagra#
1hen a router frag#ents the datagra#& the router copies the I* nu#$er into
each frag#ent.
The frag#ent -))SET field tells a receiver how to order frag#ents within a
given datagra#
The process of creating a copy of the original datagra# fro# frag#ents is called
reasse#$ly.
Iuestion No/ 2F =!ar's/ :)
1rite down the co#parison of *istance8 vector and ,in' ; state algorith#L
-!"ARIS-N/
*ISTANE8AET-R R-DTIN?/
P It is very si#ple to i#ple#ent.
P "ac'et switch updates its own routing ta$le first.
P It is used in RI".
,IN.8STATE A,?-RITC!/
P It is #uch #ore co#ple+.
P Switches perfor# independent co#putations.
P It is used in -S").
The ta$le shows in the figure& how the class of address can $e co#puted.
,ist down and descri$e atleast five charachteristics of Routing Infor#ation
"rotocol.
R-DTIN? IN)-R!ATI-N "R-T--, =RI")/
It has the following characteristics/
QIt is used for routing within an autono#ous syste# =I?").
QCop ount !etric/ RI" #easures distance in networ' hops& where each
networ'
$etween the source and destination counts as a single hop.
QIt uses D*" for all #essage trans#issions.
QRI" is used over ,AN. Aersion 1 of RI" uses hardware $roadcast and version 2
allows
delivery via #ulticast.
QIt can $e used to advertise default route propagation. An organi2ation can use
RI" to
QIt uses distance vector algorith#.
9%estion 2o: ?0 * 'arks: 5 .

Descr
ibe how NA* can be usefull for residence with cable modem or D,.:
9%estion 2o: -1 * 'arks: , .
9hat are the advantages of a multipoint connection over a point-to-point connection:
3nswer:
4oint;to;point connection is limited to two devices, where else more than two devices share a single
link in m%ltipoint connection. '%ltipoint connection can "e %sed for fail;over and relia"ility.
9%estion 2o: -, * 'arks: , .
9hatQs the name of the telephone service in which there is no need of dialing.
3nswer:
R#11 *digital data service. is the telephone service in which there is no need of dialing.
9%estion 2o: -- * 'arks: , .
9hich type of frames are present in (,C frames:
3nswer:
There are two types of frames that are present in B1&.
1. &ontrol Arames and
,. #ata Arames
9%estion 2o: -? * 'arks: , .
Khat methods of line discipline are %sed for peer to peer and primary secondary comm%nicationN
3nswer:
.ine discipline is done in two waysJ
&. ENG5ACE /Enquiry Acknowledgement0
*his is used for peer to peer communication.
). 4oll5 ,elect
*his method is used for primary secondary communication.
9%estion 2o: -5 * 'arks: - .
Low does the checks%m checker know that the received data %nit is %ndamagedN S-T
3nswer:
Checksum Checker or generatorJ
*he sender subdivides data units into equal segments of RnK bits/&H bits0
&. *hese segments are added together using oneKs complement.
). *he total /sum0 is then complemented and appended to the end of the original data unit as redundancy
bits called C=ECE,72.
3. *he e-tended data unit is transmitted across the network.
$. *he receiver subdivides data unit and adds all segments together and complement the result.
%. 6f the intended data unit is intact! total value found by adding the data segments and the checksum field
should be >ero.
H. 6f the result is not >ero! the packet contains an error F the receiver reDects it.
9%estion 2o: -8 * 'arks: - .
Khich one has more overhead, a repeater or a "ridgeN E)plain yo%r answer. S-T
3nswer:
A bridge has more overhead than a repeater. A bridge processes the packet at two
layers N a repeater processes a frame at only one layer. A bridge needs to search a
table and find the forwarding port as well as to regenerate the signalN a repeater
only regenerates the signal. 6n other words! a bridge is also a repeater /and more0N a
repeater is not a bridge.
9%estion 2o: - * 'arks: - .
Krite down disadvantages of =ing Topology.
3nswer:
Disadvantages of "ing *opology
7nidirectional *raffic
A break in a ring that is a disabled station can disable the entire network
Can be solved by usingJ
Dual "ing or
A switch capable of closing off the (reak
9%estion 2o: -+ * 'arks: - .
Low parity "its are co%nted in @=& error detection method techni$%e in case of odd parity
generatorN
3nswer:
+or e-ampleJ
9e want to *< the binary data unit &&''''&
Adding together the number of &Ks gives us 3! an odd number (efore *<! we pass the data unit through a
parity generator! which counts the &Ks and appends the parity bit /&0 to the end *he total number of &Ks is
now $! an even number *he system now transfers the entire e-panded across the network link 9hen it
reaches its destination! the "< puts all M bits through an even parity checking function
6f the "< sees &&&''''&! it counts four ones! an even number and the data unit passes
9hen the parity checker counts the &Ks! it gets % an odd number *he receiver knows that an error has
occurred somewhere and therefore reDects the whole unit ,ome systems may also use ;DD parity
checking *he principal is the same as even parity
9%estion 2o: ?0 * 'arks: 5 .
E)plain 4rotocol #ata Bnit *4#B.N
3nswer: 4rotocol data unit /4D70 is an ;,6 term that refers generically to a group of information added
or removed by a particular layer of the ;,6 model. 6n specific terms! an .-4D7 implies the data and
headers defined by layer -. Each layer uses the 4D7 to communicate and e-change information. *he
4D7 information is only read by the peer layer on the receiving device and then stripped off! and data is
handed over to the ne-t upper layer.
9%estion 2o: ,1 * 'arks: , .
Is there a comparison "etween T&40I4 reference model and C1I reference model.
(oth the *C4564 and ;,6 are international standards for data communication. (oth use the concept of
protocol layering. *hese are the conceptual tools that is often used to show how various protocols and
technologies fit together to implement networks. *he functions that the model represents are much the
same. *his means that the *C4564 and the ;,6 models are really quite similar in nature even if they donQt
carve up the network functionality pie in precisely the same way. *here is a fairly natural correspondence
between the *C4564 and ;,6 layersN it Dust isnQt always a Sone-to-oneT relationship. ,ince the ;,6 model
is used so widely! it is common to e-plain the *C4564 architecture both in terms of the *C4564 layers and
the corresponding ;,6 layers
9%estion 2o: ,, * 'arks: , .
Low can a datagram "e transmitted across a physical network that does not %nderstand the
datagram formatN
Encaps%lateU
*he network interface layer encapsulates an entire datagram in the data area of a hardware frame.
*he network hardware ignores the datagram format.
*he hardware treats a frame containing a datagram like any other frame.
*he sender places a frame type in the frame header indicating that the frame contains a datagram.
*he receiver reads the frame type and knows the frame contains a datagram.
9%estion 2o: ,- * 'arks: , .
Khat is the "asic concept of Twice 23T *2etwork 3ddress Translation.N
*wice NA* is another variant of NA*. it is used with site that runs server. 6n this process NA* bo- is
connected to Domain Name.
Khy does I4v8 %se separate E)tension LeadersN
64vH use separate E-tension =eaders. +ragmentation information is kept in separate e-tension header.
Each fragment has base header and /inserted0 fragmentation header. Entire datagram including
originalheader may be fragmented.
9%estion 2o: , * 'arks: 5 .
Consider the I4 addressesJ 1+.,00.1,.5 and the corresponding s%"net masks ,55.,55.,55.0, then find
out the followingJ
a. *he number of bits used for subnetting /Answer + "its.
b. *otal number of host in the subnet /Answer ,5? .
c. *he network address of the subnet. /Answer 1+.,00.1,.0.
d. *he subnet address of the 64 address.
Lere is the online calc%lator for s%"netting
http:00www.s%"netmask.info0
http:00www.s%"net;calc%lator.com0s%"net.phpNnetVclassGB
2CTE. This is P%st for concept not incl%ded in the answer
*he subnet mask determines what portion of the *C4564 address represents your network and what
portion can be used for your hosts. *he network number represents the street 6 live on! and the host
portion is used for the numbers on all the houses on my street.
A subnet mask of ,55.,55.,55.0 means that the first three octets of the address will be used for the
network! and thus our network number is 19,.18+.1. *his means we can have ,5? computers on this
network! because the fourth octet is not being used by the network portion of the address. 9e know this
because of the 0 in the subnet mask /)%%.)%%.)%%.00.
9%estion 2o: ,+ * 'arks: 5 .
Low does I4 software reassem"le fragments that arrive o%t of orderN
A unique 6D number of each outgoing datagram
9hen a router fragments the datagram! the router copies the 6D number into each fragment.
*he fragment ;++,E* field tells a receiver how to order fragmentswithin a given datagram
*he process of creating a copy of the original datagram from fragments is called reassembly.
9%estion 2o: ,9 * 'arks: 5 .
Krite down the comparison of #istance; vector and /ink E state algorithmN
C;24A"6,;NJ
/I2Q;1T3TE 3/DC=ITL':
L 6t is much more comple-.
L ,witches perform independent computations.
L 6t is used in ;,4+.
9%estion 2o: -0 * 'arks: 10 .
Descibe in detail what is the purpose of the following table: 9hat sort of information can be e-tracted:
*he table shows in the figure! how the class of address can be computed.
9%estion 2o: -1 * 'arks: 10 .
/ist down and descri"e at least five characteristics of =o%ting Information 4rotocol.
";7*6N8 6N+;"2A*6;N 4";*;C;. /"640J
A6t is used for routing within an autonomous system /6840.
(etween the source and destination counts as a single hop.
A"64 allows hosts to listen passively and update its routing table
9%estion 2o: ,1 * 'arks: , .
#oes C14A only share information within an area or does it allow comm%nication "etween areas:
;,4+ allows subdivision of Autonomous ,ystem into areas. *he link-status information is propagated
within an area. *he routes are summari>ed before being propagated to another area. 6t reduces overhead
/less broadcast traffic0. (ecause it allows a manager to partition the routers and networks in an
autonomous system into multiple areas! ;,4+ can scale to handle a larger number of routers than other
684s.
1T3TI& =CBTI2D:
6t is one of the forms of 6nternet routing. 6n ,tatic routing! the table is initiali>ed
9hen system boots and there is no further changes.
#J23'I& =CBTI2D:
6n dynamic routing the table is initiali>ed when system boots. 6t includes routing
,oftware which learns routes and updates table. 6n this way continuous changes are
possible due to routing software.
9%estion 2o: ,5 * 'arks: - .
Khat is the first address in the "lock if one of the addresses is 1?0.1,0.+?.,?0,0N
The first address in the "lock is 1?0.1,0.+0.00,0
9E can use the following short cut to find the first address
3. divide the prefi- length into four groups/corresponding to the four bytes in an address0 and find
the number of &s in each group
2. if the number of &s in a group is M the corresponding byte in the first address is the same /no
change0
;. 6f the number of &s in the group is >ero /no&s0! the corresponding byte in the first address is '
/. if the number of &s in a group is between >ero and eight! we keep the corresponding bits in that
group
9%estion 2o: ,8 * 'arks: - .
Krite three new feat%res of I4@8.
*he new features of 641H are as followsJ
L 641H addresses are &)M bits.
L =eader format is entirely different.
L Additional information is stored in optional e-tension headers! followed by data.
L +low label and quality of service allows audio and video applications to establish
Appropriate connections.
L New features can be added more easily. ,o it is e-tensible.
Khat is the difference "etween an interior gateway protocol and an e)terior gateway protocolN
2ame an e)ample of each.
I2TE=IC= D3TEK3J 4=CTC&C/1 *ID4s.:
6t is used among routers within autonomous system. *he destinations lie within 684.
E(TE=IC= D3TEK3J 4=CTC&C/1 *ED4s.:
6t is used among autonomous systems. *he destinations lie throughout 6nternet
9%estion 2o: ,+ * 'arks: 5 .
3s the Internet grew, the original &lassf%l addressing scheme "ecame a limitation, what is the
designed sol%tion.

9%estion 2o: ,9 * 'arks: 5 .
Khat are I4v8 3##=E11 2CT3TIC2N
I4v8 3##=E11 2CT3TIC2:
&)M-bit addresses unwidely in dotted decimalN requires &H numbersJ
&'%.))'.&3H.&''.)%%.)%%.)%%.)%%.'.'.&M.&)M.&$'.&'.)%%.)%%
8roups of &H-bit numbers in he- separated by colons O colon he-adecimal /or colon he-0.
H?DCJ MMH$J++++J ++++J 'J&)M'JMC'AJ++++
Cero-compression O series of >eroes indicated by two colons
++'CJ 'J'J'J'J'J'J(&
++'CJJ(&
64vH address with ?H leading >eros is interpreted to hold an 64v$ address.
9%estion 2o: -0 * 'arks: 10 .
/I1T 1C'E &L3=3&TE=I1TI&1 CA 3 &/IE2T.
&L3=3&TE=I1TI&1 CA 3 &/IE2T:
*he characteristics of a client are e-plained belowJ
AClient is an arbitrary application program.
A6t becomes client temporarily.
A6t can also perform other computations.
A6t is invoked directly by the user.
A6t runs locally on the userKs computer.
A6t actively initiates contact with a server.
A6t contacts one server at a time.
9%estion 2o: -1 * 'arks: 10 .
Kith help of the diagram "elow, e)plain T&4 1egment Aormat:

*C4 uses single format for all messages. *C4 uses the term segment to refer to a message. Each message
sent from *C4 on onemachine to *C4 on another machine uses this format including data
andacknowledgement
www.v%st%dents.ning.com
Aield 2ame 1i5e *"ytes. #escription
SourcePort )
ephemeral /client0 port number1o%rce4ort: *he &H-bit port
number of the process that originated the *C4 segment on the
source device. *his will normally be an for a request sent by a
client to a server
DestinationPort ) DestinationPort: *he &H-bit port number of the process that is
the ultimate intended recipient of the message on the destination
device.
Sequence Number $
Sequence Number: +or normal transmissions! the sequence
number of the first byte of data in this segment. 6n a connection
request /S010 message! this carries the initial sequence number
/6,N0 of the source *C4.
Acknowledgment
Number
$
Acknowledgment Number: 9hen the &-2 bit is set! this
segment is serving as an acknowledgment /in addition to other
possible duties0 and this field contains the sequence number the
source is ne-t e-pecting the destination to send.
Window )
Window: 6ndicates the number of octets of data the sender of
this segment is willing to accept from the receiver at one time.
*his normally corresponds to the current si>e of the buffer
allocated to accept data for this connection.
Cecksum )
&H-bit checksum for data integrity protectionCecksum: A !
computed over the entire *C4 datagram plus a special Spseudo
headerT of fields. 6t is used to protect the entire *C4 segment
against not Dust errors in transmission! but also errors in delivery.
!rgent Pointer )
!rgent Pointer: 7sed in conDunction with the 345 control bit
for priority data transfer. *his field contains the sequence
number of the last byte of urgent data.
"ptions 1ariable
"ptionsJ *C4 includes a generic mechanism for including one or
more sets of optional data in *C4 segment. Each of the options
can be either one byte in length or variable length. *he first byte
if the option kind subfield and itKs value specifies the type of
option! which in turn indicates whether the option is Dust a single
byte or multiple bytes. ;ptions that are many bytes consist of
three fields

1ote this table is also included in options column. options may vary
1%"field name 1i5e *"ytes. #escription
;ption-kind & Cption;kind: specifies the option type
;ption-lengthJ & Cption;length: the length of the entire option in bytes!
including the option-kind and option-length fields.
;ption-data 1ariable Cption;data: the option data itself in at least one oddbll
case! this field is omitted/making option length equal to
)0
+%.A-TE&M ELAM%.AT%F.
=CBTI2D I2AC='3TIC2 4=CTC&C/ *=I4.:
MIt is %sed for ro%ting within an a%tonomo%s system *ID4..
between the source and destination counts as a single hop.
9hat are the advantages of a multipoint connection over a point-to-point connection:
3nswer:
4oint;to;point connection is limited to two devices, where else more than two devices share a single
link in m%ltipoint connection. '%ltipoint connection can "e %sed for fail;over and relia"ility.
9%estion 2o: -, * 'arks: , .
9hatQs the name of the telephone service in which there is no need of dialing.
3nswer:
##1 *digital data service. is the telephone service in which there is no need of dialing.
9%estion 2o: -- * 'arks: , .
9hich type of frames are present in (,C frames:
3nswer:
There are two types of frames that are present in B1&.
1. &ontrol Arames and
,. #ata Arames
9%estion 2o: -? * 'arks: , .
Khat methods of line discipline are %sed for peer to peer and primary secondary comm%nicationN
3nswer:
.ine discipline is done in two waysJ
&. ENG5ACE /Enquiry Acknowledgement0
*his is used for peer to peer communication.
). 4oll5 ,elect
*his method is used for primary secondary communication.
9%estion 2o: -5 * 'arks: - .
Low does the checks%m checker know that the received data %nit is %ndamagedN S-T
3nswer:
Checksum Checker or generatorJ
*he sender subdivides data units into equal segments of RnK bits/&H bits0
&. *hese segments are added together using oneKs complement.
). *he total /sum0 is then complemented and appended to the end of the original data unit as redundancy
bits called C=ECE,72.
3. *he e-tended data unit is transmitted across the network.
$. *he receiver subdivides data unit and adds all segments together and complement the result.
%. 6f the intended data unit is intact! total value found by adding the data segments and the checksum field
should be >ero.
H. 6f the result is not >ero! the packet contains an error F the receiver reDects it.
9%estion 2o: -8 * 'arks: - .
Khich one has more overhead, a repeater or a "ridgeN E)plain yo%r answer. S-T
3nswer:
A bridge has more overhead than a repeater. A bridge processes the packet at two
layers N a repeater processes a frame at only one layer. A bridge needs to search a
table and find the forwarding port as well as to regenerate the signalN a repeater
only regenerates the signal. 6n other words! a bridge is also a repeater /and more0N a
repeater is not a bridge.
9%estion 2o: - * 'arks: - .
Krite down disadvantages of =ing Topology.
3nswer:
Disadvantages of "ing *opology
7nidirectional *raffic
A break in a ring that is a disabled station can disable the entire network
Can be solved by usingJ
Dual "ing or
A switch capable of closing off the (reak
9%estion 2o: -+ * 'arks: - .
Low parity "its are co%nted in @=& error detection method techni$%e in case of odd parity
generatorN
3nswer:
+or e-ampleJ
9e want to *< the binary data unit &&''''&
Adding together the number of &Ks gives us 3! an odd number (efore *<! we pass the data unit through a
parity generator! which counts the &Ks and appends the parity bit /&0 to the end *he total number of &Ks is
now $! an even number *he system now transfers the entire e-panded across the network link 9hen it
reaches its destination! the "< puts all M bits through an even parity checking function
6f the "< sees &&&''''&! it counts four ones! an even number and the data unit passes
9hen the parity checker counts the &Ks! it gets % an odd number *he receiver knows that an error has
occurred somewhere and therefore reDects the whole unit ,ome systems may also use ;DD parity
checking *he principal is the same as even parity
9%estion 2o: ,1 * 'arks: , .
Is there a comparison "etween T&40I4 reference model and C1I reference model.
(oth the *C4564 and ;,6 are international standards for data communication. (oth use the concept of
protocol layering. *hese are the conceptual tools that is often used to show how various protocols and
technologies fit together to implement networks. *he functions that the model represents are much the
same. *his means that the *C4564 and the ;,6 models are really quite similar in nature even if they donQt
carve up the network functionality pie in precisely the same way. *here is a fairly natural correspondence
between the *C4564 and ;,6 layersN it Dust isnQt always a Sone-to-oneT relationship. ,ince the ;,6 model
is used so widely! it is common to e-plain the *C4564 architecture both in terms of the *C4564 layers and
the corresponding ;,6 layers
9%estion 2o: ,, * 'arks: , .
Low can a datagram "e transmitted across a physical network that does not %nderstand the
datagram formatN
Encaps%lateU
*he network interface layer encapsulates an entire datagram in the data area of a hardware frame.
*he network hardware ignores the datagram format.
*he hardware treats a frame containing a datagram like any other frame.
*he sender places a frame type in the frame header indicating that the frame contains a datagram.
*he receiver reads the frame type and knows the frame contains a datagram.
9%estion 2o: ,- * 'arks: , .
Khat is the "asic concept of Twice 23T *2etwork 3ddress Translation.N
*wice NA* is another variant of NA*. it is used with site that runs server. 6n this process NA* bo- is
connected to Domain Name.
9%estion 2o: ,8 * 'arks: - .
Khy does I4v8 %se separate E)tension LeadersN
64vH use separate E-tension =eaders. +ragmentation information is kept in separate e-tension header.
Each fragment has base header and /inserted0 fragmentation header. Entire datagram including original
header may be fragmented.
Consider the I4 addressesJ 1+.,00.1,.5 and the corresponding s%"net masks ,55.,55.,55.0, then find
out the followingJ
a. *he number of bits used for subnetting /Answer + "its.
b. *otal number of host in the subnet /Answer ,5? .
c. *he network address of the subnet. /Answer 1+.,00.1,.0.
d. *he subnet address of the 64 address.
Lere is the online calc%lator for s%"netting
http:00www.s%"netmask.info0
http:00www.s%"net;calc%lator.com0s%"net.phpNnetVclassGB
2CTE. This is P%st for concept not incl%ded in the answer
*he subnet mask determines what portion of the *C4564 address represents your network and what
portion can be used for your hosts. *he network number represents the street 6 live on! and the host
portion is used for the numbers on all the houses on my street.
A subnet mask of ,55.,55.,55.0 means that the first three octets of the address will be used for the
network! and thus our network number is 19,.18+.1. *his means we can have ,5? computers on this
network! because the fourth octet is not being used by the network portion of the address. 9e know this
because of the 0 in the subnet mask /)%%.)%%.)%%.00.
9%estion 2o: ,+ * 'arks: 5 .
Low does I4 software reassem"le fragments that arrive o%t of orderN
A unique 6D number of each outgoing datagram
9hen a router fragments the datagram! the router copies the 6D number into each fragment.
*he fragment ;++,E* field tells a receiver how to order fragments within a given datagram
*he process of creating a copy of the original datagram from fragments is called reassembly.
9%estion 2o: ,9 * 'arks: 5 .
Krite down the comparison of #istance; vector and /ink E state algorithmN
C;24A"6,;NJ
/I2Q;1T3TE 3/DC=ITL':
L 6t is much more comple-.
L ,witches perform independent computations.
L 6t is used in ;,4+.
9%estion 2o: -0 * 'arks: 10 .
Descibe in detail what is the purpose of the following table: 9hat sort of information can be e-tracted:
*he table shows in the figure! how the class of address can be computed.
9%estion 2o: -1 * 'arks: 10 .
/ist down and descri"e atleast five charachteristics of =o%ting Information 4rotocol.
";7*6N8 6N+;"2A*6;N 4";*;C;. /"640J
A6t is used for routing within an autonomous system /6840.
between the source and destination counts as a single hop.
A"64 allows hosts to listen passively and update its routing table
AI23/TE='
9%estion 2o: ,, * 'arks: , .
#oes C14A only share information within an area or does it allow comm%nication "etween areas:
;,4+ allows subdivision of Autonomous ,ystem into areas. *he link-status information is propagated
within an area. *he routes are summari>ed before being propagated to another area. 6t reduces overhead
/less broadcast traffic0. (ecause it allows a manager to partition the routers and networks in an
autonomous system into multiple areas! ;,4+ can scale to handle a larger number of routers than other
684s.
9%estion 2o: ,? * 'arks: - .
#escri"e the difference "etween static and dynamic ro%tingN
1T3TI& =CBTI2D:
6t is one of the forms of 6nternet routing. 6n ,tatic routing! the table is initiali>ed
when system boots and there is no further changes.
#J23'I& =CBTI2D:
6n dynamic routing the table is initiali>ed when system boots. 6t includes routing
software which learns routes and updates table. 6n this way continuous changes are
possible due to routing software.
9%estion0 2o: ,5 * 'arks: - .
Khat is the first address in the "lock if one of the addresses is 1?0.1,0.+?.,?0,0N
The first address in the "lock is 1?0.1,0.+0.00,0
9E can use the following short cut to find the first address
4. divide the prefi- length into four groups/corresponding to the four bytes in an address0 and find
the number of &s in each group
:. if the number of &s in a group is M the corresponding byte in the first address is the same /no
change0
>. 6f the number of &s in the group is >ero /no&s0! the corresponding byte in the first address is '
2. if the number of &s in a group is between >ero and eight! we keep the corresponding bits in that
group
9%estion 2o: ,8 * 'arks: - .
Krite three new feat%res of I4@8.
*he new features of 641H are as followsJ
L 641H addresses are &)M bits.
L =eader format is entirely different.
L Additional information is stored in optional e-tension headers! followed by data.
L +low label and quality of service allows audio and video applications to establish
Appropriate connections.
L New features can be added more easily. ,o it is e-tensible.
Khat is the difference "etween an interior gateway protocol and an e)terior gateway protocolN
2ame an e)ample of each.
I2TE=IC= D3TEK3J 4=CTC&C/1 *ID4s.:
6t is used among routers within autonomous system. *he destinations lie within 684.
E(TE=IC= D3TEK3J 4=CTC&C/1 *ED4s.:
6t is used among autonomous systems. *he destinations lie throughout 6nternet

9%estion 2o: ,9 * 'arks: 5 .
Khat are I4v8 3##=E11 2CT3TIC2N
I4v8 3##=E11 2CT3TIC2:
&)M-bit addresses unwidely in dotted decimalN requires &H numbersJ
&'%.))'.&3H.&''.)%%.)%%.)%%.)%%.'.'.&M.&)M.&$'.&'.)%%.)%%
8roups of &H-bit numbers in he- separated by colons O colon he-adecimal /or colon he-0.
H?DCJ MMH$J++++J ++++J 'J&)M'JMC'AJ++++
Cero-compression O series of >eroes indicated by two colons
++'CJ 'J'J'J'J'J'J(&
++'CJJ(&
64vH address with ?H leading >eros is interpreted to hold an 64v$ address.
9%estion 2o: -0 * 'arks: 10 .
/I1T 1C'E &L3=3&TE=I1TI&1 CA 3 &/IE2T.
&L3=3&TE=I1TI&1 CA 3 &/IE2T:
*he characteristics of a client are e-plained belowJ
AClient is an arbitrary application program.
A6t becomes client temporarily.
A6t can also perform other computations.
A6t is invoked directly by the user.
A6t runs locally on the userKs computer.
A6t actively initiates contact with a server.
A6t contacts one server at a time.
9%estion 2o: -1 * 'arks: 10 .
What is the difference between the physical and logical topologies?
Every LAN has a topology, or the way that the devices on a network are arranged and
how they communicate with each other.
PHYSICL TOPOLOGY:
The way that the workstations are connected to the network through the actual cables that
transmit data -- the physical structure of the network -- is called the physical topology. It
depends on the wiring scheme.
LOGICAL TOPOLOGY:
The logical topology, in contrast, is the way that the signals act on the network media, or
the way that the data passes through the network from one device to the next without
regard to the physical interconnection of the devices. We can say that it is defined by the
specific network technology.
Define Vector-Distance Algorithm.
Packet switches wait for next update message and they iterate through entries in message.
If entry has shortest path to destination, insert source as next hop to destination and
record distance as distance from next hop to destination plus distance from this switch to
next hop.
STORE AND FORWARD:
Data delivery from one computer to another is accomplished through store and forward
technology. In this technology packet switch stores incoming packet and also forwards
that packet to another switch or computer. For this purpose packet switch has internal
memory into which it can hold packet if outgoing connection is busy. Packets for each
connection held on queue.
How can Switched Virtual Network be established?
SWITCHED VIRTUAL CIRCUITS:
Most networks offer dynamic connections, which last for a relatively short time.
To handle this, ATM can dynamically establish a switched virtual circuit (SVC), allow it
last as long as necessary and then terminate it.
The terminology comes from the Telcos where switching system normally refers to all
switching.
ESTABLISHING AN SVC:
The computer sends a connection request to the switch to which it is attached.
Software in the switch finds a network path to the destination and sends along the
connection request.
Each pair of switches in the path communicates to choose a VPI/VCI for their tables.
Once the connection is established by the destination, a message is sent back to the
originating computer to indicate the SVC is ready.
If any switch or the destination computer does not agree to setting up the VC, an error
message is sent back and the SVC is not established
How can a bridge know whether to forward frames?
The bridge builds a list of MAC addresses on either side of the bridge. Therefore, it
knows which packets should be forwarded to the other side and which should not. Most
bridges are self-learning bridges. As soon as a frame arrives to a bridge, it extracts a
source address from its header and automatically adds it in the list for that segment. In
this way a bridge builds up address lists.
In the example of a packet that uses a MAC address not in its table it can err on the side
of caution by forwarding the packet.
Compare connection oriented and connectionless Service.
Connection-Oriented vs. Connectionless Service
This characteristic specifies whether conversations take place in a more or less structured
manner. When using a connection-oriented protocol, you incur the overhead of setting
up a virtual circuit (a defined communications path) between the sender and receiver,
which is maintained until the sender and receiver have completed their entire
conversation.
When the conversation is completed, you incur the overhead of tearing down the virtual
circuit. Connection-oriented protocols provide guaranteed delivery of messages in the
order in which they were sent.
Contrast this with Connectionless service, which does not require establishing a session
and a virtual circuit. This can be found in the network layer or transport layer, depending
on the protocol. You can think of a connectionless protocol as being akin to mailing a
post card. You send it and hope that the receiver gets it. Common features of a
connectionless service are:
Packets do not need to arrive in a specific order
Reassembly of any packet broken into fragments during transmission must be in
proper order
No time is used in creating a session
No Acknowledgement is required.
The largest connectionless

What is the main difference between TCP and UDP? (2)
T=P(Transmission =ontro0 Proto)o0).
';/ is a connection-oriente protoco!.
& connection can be mae 3rom c!ient to ser4er? an 3rom then on an# ata can be sent a!on" that
connection.
';/ /ro4ie a +e!iabi!it# ue to connection oriente 3eatures.
C/P(Cser /atagram Proto)o0).
& simp!er messa"e-base connection!ess protoco!.
Messa"es (pac7ets) can be sent across the networ7 in chun7s.
C,/ is Cnre!iab!e M as it cou! "et !ost on the wa#.
Why TCP calle en to en Protocol!!!!!!!(")
';/ estab!ishe connection between noes be3ore transmission or recei4in" the ata? ue to this 3eature?
it is ca!!e en-to-en protoco!.
Why #ore pre$erence gi%en to TCP as co#parati%e to &'P
';/ pro4ie re!iabi!it# as it 3o!!ows connection oriente protoco! parai"m that is wh# ';/ is "i4en
pre3erence o4er C,/.
(o) is TCP a relia*le protocol+ (,arks-")
';/ is a connection-oriente protoco!.
& connection can be mae 3rom c!ient to ser4er? an 3rom then on an# ata can be sent a!on" that
connection.
';/ /ro4ie a +e!iabi!it# ue to connection oriente 3eatures.
The #a.i#/# payloa o$ a TCP seg#ent is 012341 *ytes! Why )as s/ch a strange n/#*er chosen+(5)
& ';/ se"ment must 3it insie an I/ pac7et. 'he ';/ heaer is a 3i@e-3ormat o3 50- b#tes? an the I/
heaer is a!so 50 b#tes !on". %ince the ma@imum !en"th o3 an I/4: pac7et is <5?595 b#tes? this !ea4es
on!# <5?595-50-50 U <5?:B5 b#tes !e3t 3or ';/ pa#!oa.
Why oes &'P e.ist+ Wo/l it not ha%e *een eno/gh to 6/st let /ser processes sen ra) IP packets+(5)
C,/ instea o3 raw I/ is use because the C,/ heaer contains the port in3ormation 3or the source an
estination machines. 'his a!!ows the machines to 7now which processes the pac7et came 3rom an
shou! be sent to. 'his in3ormation is not a4ai!ab!e an#where in the heaer 3or the raw I/ pac7et. It wou!
not ha4e been enou"h to Just !et user processes sen raw I/ pac7ets
Characteristics o$ &'P (1)
C,/ is connection!ess protoco!
'he sener isnHt aware o3 the other part#Hs status an sen the ata an#time it wants to.
+ea!-time communication is possib!e.
'he port number is mar7e on the ata an the ata is encapsu!ate to I/ pac7et an sent.
+e!iabi!it# o3 communication is not "uarantee.
,ata can be !ost.
'i$$erentiate *et)een &NICAST2 ,&7TICAST AN' BROA'CAST (0)
'hree methos can be use to transmit pac7ets o4er a networ7: unicast? mu!ticast? an broacast.
Cni)ast in4o!4es communication between a sin"!e sener an a sin"!e recei4er. 'his is a t#pe o3 point-to-
point transmissionR since the pac7et is transmitte to one estination at a time.
Mu0ti)ast is use to sen pac7ets to a "roup o3 aresses? represente b# a S"roup aress.S In this
case? pac7ets are transmitte 3rom a sin"!e sener to mu!tip!e recei4ers. %ince the same ata pac7et can
be sent to mu!tip!e noes b# senin" Just one cop# o3 the ata? the !oa o3 the sener an the o4era!! !oa
o3 the networ7 are both reuce.
,roa6)ast in4o!4es senin" pac7ets to a!! noes on a networ7 simu!taneous!#. 'his t#pe o3 transmission
is use to estab!ish communication with another host? an 3or ,I;/ t#pe methos o3 assi"nin" I/
aresses. In the 3irst case? itHs neee because #our pac7ets must 7now the proper M&; aress to
sen pac7ets to a machine on #our !oca! networ7. %uppose #ou 7now the I/ aress (obtaine? 3or
e@amp!e? b# Kuer#in" a ,N% ser4er)? but ha4e not #et etermine the M&; aress that be!on"s to the
noe. I3 #ou broacast a pac7et that as7s reKuests the ientit# o3 the noe with that particu!ar I/ aress?
e4er# machine on the networ7 wi!! recei4e the messa"e? but on!# the one with that I/ aress wi!!
respon.
81: 'i$$erentiate *et)een connectionless an connection9oriente protocol+ (0)
=onne)tion-oriente6
+eKuires a session connection (ana!o"ous to a phone ca!!) be estab!ishe be3ore an# ata can be
sent.
'his metho is o3ten ca!!e a Sre!iab!eS networ7 ser4ice.
It can "uarantee that ata wi!! arri4e in the same orer.
;onnection-oriente ser4ices set up 4irtua! !in7s between en s#stems throu"h a networ7.
=onne)tion0ess
,oes not reKuire a session connection between sener an recei4er.
'he sener simp!# starts senin" pac7ets (ca!!e ata-"rams) to the estination.
'his ser4ice oes not ha4e the re!iabi!it# o3 the connection-oriente metho? but it is use3u! 3or
perioic burst trans3ers.
Neither s#stem must maintain state in3ormation 3or the s#stems that the# sen transmission to or
recei4e transmission 3rom.
& connection!ess networ7 pro4ies minima! ser4ices.
'e$ine special IP!!(1)
%pecia! I/Ds are those I/Ds which are not assi"ne to an# machineR these are reser4e I/Ds? use 3or
specia! purpose? 3or e@amp!e:

Ro/ting in$or#ation Protocol e$ine *rie$ly (:;)
'he +outin" In3ormation /rotoco! (+I/) is a #namic routin" protoco! use in !oca! an wie area
networ7s. &s such it is c!assi3ie as an interior "atewa# protoco! (I./). It uses the istance-4ector routin"
a!"orithm. It was 3irst e3ine in +8; 105A (1BAA). 'he protoco! has since been e@tene se4era! times?
resu!tin" in +I/ Eersion 5 (+8; 5:59). 1oth 4ersions are sti!! in use toa#? howe4er? the# are consiere
to ha4e been mae technica!!# obso!ete b# more a4ance techniKues such as -pen %hortest /ath 8irst
(-%/8) an the -%I protoco! I%-I%. +I/ has a!so been aapte 3or use in I/4< networ7s? a stanar
7nown as +I/n" (+I/ ne@t "eneration)? pub!ishe in +8; 50A0 (1BB>).
Features o: R&P
+outin" within an autonomous s#stem (I./)
Iop count metric
Cnre!iab!e transport (uses C,/)
1roacast or mu!ticast e!i4er#
,e3au!t +oute /ropa"ation
,istance 4ector a!"orithm
/assi4e 4ersion 3or host
What is OSP<!!!!!(")
-pen %hortest /ath 8irst (-%/8) is a #namic routin" protoco! 3or use in Internet /rotoco! (I/) networ7s.
%peci3ica!!#? it is a !in7-state routin" protoco! an 3a!!s into the "roup o3 interior "atewa# protoco!s?
operatin" within a sin"!e autonomous s#stem (&%).
What is #ean *y aress resol/tion )ith centrali=ation #essage e.change+
& networ7 inc!ues one or more ser4ers that are assi"ne the tas7 o3 answerin" aress reso!ution
reKuests. It has an a4anta"e that reso!ution is easier to con3i"ure? mana"e an contro!.
To sol%e the pro*le# the ro/ters an net)orks in the internet are i%ie into gro/ps2 ho) large o yo/
think are these gro/ps+ (,arks-")
'here is no !imit to etermine the size o3 "roup? it can be !ar"e or sma!! epens upon net wor7
aministrator.
(o) oes a packet pass across an internet+ (,arks-5)
& source creates the pac7et an p!aces the estination aress in a pac7et heaer
'he pac7et is sent to the nearest router
'he router uses the estination aress to se!ect the ne@t router on the path to the estination? an
then transmits the pac7et.
'he pac7et reaches the router that can e!i4er the pac7et to its 3ina! estination.
What are so#e o$ the #etrics /se *y ro/ting protocols+ (,arks-5)
/ath !en"th? re!iabi!it#? e!a#? banwith? !oa? an communication cost
What are the pro*le# that IP oes not g/arantee an ho) to hanle these pro*le#s+ (,arks-5)
I/ oes not "uarantee the 3o!!owin" prob!ems:
,e!i4er# o3 pac7ets
,e!i4er# o3 pac7ets in seKuence.
(o) can &ni%ersal Ser%ices *e achie%e+ (,arks-1)
'he "oa! o3 internetwor7in" is uni4ersa! ser4ice across hetero"eneous networ7s. 'o pro4ie this ser4ice
a!! computers an routers must a"ree to 3orwar in3ormation 3rom a source on one networ7 to a speci3ie
estination. 'he tas7 is comp!icate as 3rame 3ormats an aressin" schemes ma# i33er. 'he 7e# o3
achie4in" uni4ersa! ser4ice is uni4ersa! protoco! so3tware (';//I/).
What are the #ain a%antages an isa%antages o$ Ro/ting In$or#ation Protocol (RIP)+ (,arks-1)
A63antages:
V %imp!e to imp!ement
V )ow reKuirement in processin" an memor# at the noes
V %uitab!e 3or sma!! networ7s
/isa63antages:
V %!ow con4er"ence
V 1ouncin" e33ect
V ;ountin" to in3init# prob!em 3rom +outin" 1asics? +I/
V /oor metrics. +I/ on!# supports a hop count metric? with a ma@imum 4a!ue o3 15 hops.
Can a ro/ter in the glo*al internet /se static ro/ting the sa#e )ay a host oes+ I$ so2 ho) large is the
ro/ting ta*le in a ro/ter+ (,arks-:;)
'he answers o3 these Kuestions are comp!e@. &!thou"h cases e@it where a router uses static routin"? most
routers are usin" #namic routin".
(o) can )e pro%e that )e ha%e "2:3>23?5203? aresses in class A+ (")
In c!ass &? on!# 1 bit e3ines the c!ass. 'he remainin" 91 bits are a4ai!ab!e 3or the aress. Fith 91 bits?
we can ha4e 591 or 5?1:>?:A9?<:A aresses.
Why is internet #/lticast ro/ting i$$ic/lt+ (")
Internet mu!ticast routin" is i33icu!t because internet mu!ticast a!!ows arbitrar# computer to Join mu!ticast
"roup at an# time. It a!!ows arbitrar# member to !ea4e mu!ticast "roup at an# time. It a!so a!!ows arbitrar#
computer to sen messa"e to a "roup (e4en i3 not a member).
'e$ine )hat is the E.tension (eaers in IP%0! (")
In I/4<? optiona! internet-!a#er in3ormation is encoe in separate heaers that ma# be p!ace between
the I/4< heaer an the upper- !a#er heaer in a pac7et. 'here are a sma!! number o3 such e@tension
heaers? each ienti3ie b# a istinct Ne@t Ieaer 4a!ue. &s i!!ustrate in these e@amp!es? an I/4< pac7et
ma# carr# zero? one? or more e@tension heaers? each ienti3ie b# the Ne@t Ieaer 3ie! o3 the precein"
heaer:
I3 I/4: is so success3u!? then wh# chan"e I/4<G (5 mar7s)
Internet /rotoco! Eersion < (I/4<) is esi"ne to increase Internet "!oba! aress space to accommoate
the rapi!# increasin" numbers o3 users an app!ications that reKuire uniKue "!oba! I/ aresses an he!p
enab!e a "!oba! en4ironment where the aressin" ru!es o3 the networ7 are a"ain transparent to
app!ications.
Frite a note on I/4< (mar7s 5)
Fh# oes I/4< use separate E.tension (eaersG (9)
'here are two reasons:
3. (conom#
2. (@tensibi!it#
Fhat are I/4< &,,+(%% N-'&'I-NG (5)
'he stanar notation 3or I/4< aresses is to represent the aress as ei"ht 1<-bit he@aecima! wors
separate b# WW:HH (co!ons). 8or e@amp!e:
8(,;:1&BA:0995:0000:;8A&:000;:515::>919
Write three ne) $eat/res o$ IP@0! (5)
(@pane &ressin"
I/ aress size increases 3rom 95 bits in I/4: to 15A bits in I/4<? to support more !e4e!s o3
aressin" hierarch#. In aition? I/4< pro4ies man# more aressab!e I/4< s#stems.
&ress &uto-con3i"uration an Nei"hbor ,isco4er#
Ieaer 8ormat %imp!i3ication
Impro4e %upport 3or I/ Ieaer -ptions
&pp!ication %upport 3or I/4< &ressin"
&itiona! I/4< +esources
Iow oes I/ so3tware reassemb!e 3ra"ments that arri4e out o3 orerG (9)
'he sener p!aces a uniKue I, number in the Ienti3ication 3ie! o3 each out"oin" ata"ram
Fhen a router 3ra"ments the ata"ram? the router copies the ienti3ication number into each
3ra"ment
& recei4er uses the ienti3ication number an the I/ source aress in the incomin" 3ra"ment to
etermine the ata"ram to which the 3ra"ment be!on"s
'he 8ra"ment -33set 3ie! te!!s a recei4er how to orer 3ra"ments within a ata"ram
& uniKue I, number o3 each out"oin" ata"ram
Fhen a router 3ra"ments the ata"ram? the router copies the I, number into each 3ra"ment.
'he 3ra"ment -88%(' 3ie! te!!s a recei4er how to orer 3ra"ments within a "i4en ata"ram
'he process o3 creatin" a cop# o3 the ori"ina! ata"ram 3rom 3ra"ments is ca!!e reassemb!#.
What is the $irst aress in the *lock i$ one o$ the aresses is :0>!:44!:>;!?"A">+ (5)
'he pre3i@ !en"th is 5>? which means that we must 7eep the 3irst 5> bits as is an chan"e the remainin"
bits (5) to 0s. 'he 3o!!owin" shows the process:
&ress in binar#: 10100111 11000111 10101010 01010010
=eep the !e3t 5> bits: 10100111 11000111 10101010 01000000
+esu!t in ;I,+ notation: 1<>.1BB.1>0.<:/5>
What is the $irst aress in the *lock i$ one o$ the aresses is :3;!:";!?3!"3A";+ (5)
'he pre3i@ !en"th is 50? which means that we must 7eep the 3irst 50 bits as is an chan"e the remainin"
bits (15) to 0s. 'he 3o!!owin" shows the process:
&ress in binar#: 10001100 1111000 01010100 00011000
=eep the !e3t 50 bits: 10001100 1111000 01010000 00000000
+esu!t in ;I,+ notation: 1:0.150.A0.0/5>
In internet ro/ting ho) oes a host 6oin or lea%e a gro/p+ (5)
& stanar protoco! e@ists that a!!ows a host to in3orm a nearb# router whene4er the host nees to Join or
!ea4e a particu!ar mu!ticast "roup 7nown as Internet .roup Mu!ticast /rotoco! (I.M/). 'he computer uses
I.M/ to in3orm the !oca! router about the !ast app!ication when it !ea4es.
What is the role o$ area in open shortest path $irst (OSP<)+ (5)
-%/8 a!!ows subi4ision o3 &utonomous %#stem into areas. 'he !in7-status in3ormation is propa"ate
within an area. 'he routes are summarize be3ore bein" propa"ate to another area. It reuces o4erhea
(!ess broacast tra33ic). 1ecause it a!!ows a mana"er to partition the routers an networ7s in an
autonomous s#stem into mu!tip!e areas? -%/8 can sca!e to han!e a !ar"er number o3 routers than other
I./s.
Write a note on Aress Resol/tion! (1)
Mappin" between a protoco! aress an a harware aress is ca!!e &ress +eso!ution. & host or
router uses aress reso!ution when it nees to sen a pac7et to another computer on the same ph#sica!
networ7. & computer ne4er reso!4es the aress o3 a computer that attaches to a remote networ7.
What is the concept o$ classes $or IP Aresses+ Brie$ly escri*e each class (:;)
'he ori"ina! I/ aress scheme i4ies host aresses into three primar# c!asses. 'he c!ass o3 an
aress etermines the bounar# between the networ7 pre3i@ an su33i@.
'he ori"ina! c!asses o3 I/ aresses are shown in the 3i"ure be!ow.
What is aress resol/tion+ (" #arks)
Mappin" between a protoco! aress an a harware aress is ca!!e &ress +eso!ution. & host or
router uses aress reso!ution when it nees to sen a pac7et to another computer on the same ph#sica!
networ7. & computer ne4er reso!4es the aress o3 a computer that attaches to a remote networ7.
In IP atagra# $or#at2 )hat oes the $iel SER@ICE TBPE o+ (" #arks)
%(+EI;( '0/( shows senerDs pre3erence 3or !ow !atenc#? hi"h re!iabi!it# that is rare!# use.
What is store in ro/ting ta*le+ (5 #arks)
& routin" tab!e is use b# ';//I/ networ7 routers to ca!cu!ate the estinations o3 messa"es it is
responsib!e 3or 3orwarin". 'he tab!e is a sma!! in-memor# atabase mana"e b# the routerHs bui!t-in
harware an so3tware.
+outin" 'ab!e (ntries an %izes
+outin" tab!es contain a !ist o3 I/ aresses. (ach I/ aress ienti3ies a remote router (or other networ7
"atewa#) that the !oca! router is con3i"ure to reco"nize. 8or each I/ aress? the routin" tab!e
aitiona!!# stores a networ7 mas7 an other ata that speci3ies the estination I/ aress ran"es that
remote e4ice wi!! accept.
What are i#ple#entations o$ NAT+ (9 mar7s)
'he 3i"ure be!ow shows the imp!ementation o3 N&'. Fe can see that the o! an new 4a!ues o3 I/ source
3ie! an estination 3ie! are shown with their irections.
N&' e4ice stores state in3ormation in tab!e. 'he 4a!ue is entere in the tab!e when N&' bo@ recei4es
out"oin" ata"ram 3rom new
Why organi=ations onCt /se a single ro/ter to connect its entire net)ork+ (5)
-r"anization se!om uses a sin"!e router to connect its entire networ7 3or two reasons.
1ecause the router must 3orwar each pac7et? the processor in a "i4en router is insu33icient to
han!e the tra33ic.
+eunanc# impro4e Internet re!iabi!it#.
What are the characteristic o$ *orer gate)ay protocol+ (1 #arks)
'he characteristics o3 1./ 3o!!ow:
1./ is an e@terior "atewa# protoco! ((./) use in routin" in the Internet. It is an inter-omain
routin" protoco!.
1./ is a path 4ector routin" protoco! suite 3or strate"ic routin" po!icies.
1./ uses ';/ /ort 1>B to estab!ish connections with nei"hbors.
1./4: imp!ements ;I,+.
e1./ is 3or e@terna! nei"hbors. ItHs use between separate autonomous s#stems.
i1./ is 3or interna! nei"hbors. ItHs use within an &%.
1./ uses se4era! attributes in the routin"-ecision a!"orithm.
1./ uses con3eerations an route re3!ectors to reuce 1./ peerin" o4erhea.
'he M(, (metric) attribute is use between autonomous s#stems to in3!uence inboun tra33ic.
Fei"ht is use to in3!uence the path o3 outboun tra33ic 3rom a sin"!e router? con3i"ure !oca!!#.
As the Internet gre)2 the original Class$/l aressing sche#e *eca#e a li#itation! What )ere the ne)
esign goals to o%erco#e this li#itation+ (1 #arks)
&s the Internet "rew? the ori"ina! ;!ass3u! aressin" scheme became a !imitation.
'he I/ aress space was bein" e@hauste because a!! networ7s ha to choose one o3 three possib!e
sizes. Man# aresses were unuse.
'wo new mechanisms were in4ente to o4ercome the !imitations? which are as 3o!!ows:
X %ubnet aressin"
X ;!ass!ess aressin"
Instea o3 ha4in" three istinct aress c!asses? a!!ow the i4ision between pre3i@ an su33i@ to occur on
an arbitrar# bounar#. 'he c!ass!ess aressin" scheme so!4es the prob!em b# a!!owin" an I%/ to assi"n
a pre3i@ that is? 5A bits !on" (a!!owin" the host to ha4e up to 1: hosts).
&n I%/ has c!ass ; c!ass3u! aress 1B9.51:.11.0. I3 this I%/ has 9 customers each with < computers.
'hen what aresses wi!! be assi"ne to those three customers b# usin" c!ass!ess aressin"G (10
mar7s)
Is there a comparison between ';//I/ re3erence moe! an I%- re3erence moe!G (5)
';//I/ re3erence moe! ha4e internet !a#er whereas I%- re3erence o not ha4e internet !a#er.
,oes -%/8 on!# share in3ormation within an area or oes it a!!ow communication between areasG (5)
-%/8 a!!ows subi4ision o3 &utonomous %#stem into areas. 'he !in7-status in3ormation is propa"ate
within an area. 'he routes are summarize be3ore bein" propa"ate to another area. It reuces o4erhea
(!ess broacast tra33ic). 1ecause it a!!ows a mana"er to partition the routers an networ7s in an
autonomous s#stem into mu!tip!e areas? -%/8 can sca!e to han!e a !ar"er number o3 routers than other
I./s.
What are the i#ple#entations o$ Net)ork Aress Translation+ (")
Imp!ementations o3 N&' are a4ai!ab!e e.".
X %tan-a!one harware e4ice
X I/ router with N&' 3unctiona!it# embee
'he 3i"ure be!ow shows the imp!ementation o3 N&'. Fe can see that the o! an new 4a!ues o3 I/ source
3ie! an estination 3ie! are shown with their irections.
N&' e4ice stores state in3ormation in tab!e. 'he 4a!ue is entere in the tab!e when N&' bo@ recei4es
out"oin" ata"ram 3rom new
'escri*e the i$$erence *et)een static an yna#ic ro/ting+ (5)
%tati) routing is con3i"ure b# the networ7 aministrator. It is not capab!e o3 aJustin" to
chan"es in the networ7 without networ7 aministrator inter4ention.
/5nami) routing aJusts to chan"in" networ7 circumstances b# ana!#zin" incomin" routin"
upate messa"es without aministrator inter4ention.
Fhat is the i33erence between an interior "atewa# protoco! an an e@terior "atewa# protoco!G Name an
e@amp!e o3 each. (5)
&NT$R&"R 'AT$EAG PR"T"="4% (&'Ps):
It is use amon" routers within autonomous s#stem. 'he estinations !ie within I./.
(@amp!es are: +I/? I.+/? (I.+/? an -%/8.
$HT$R&"R 'AT$EAG PR"T"="4% ($'Ps):
It is use amon" autonomous s#stems. 'he estinations !ie throu"hout Internet
(@amp!e o3 (./ is 1roaer .atewa# /rotoco! (1./) . 1./ is the recommene bac7bone peerin"
protoco! because it is:
Inustria! %tanar.
%ca!ab!e
1est practice
Non-/roprietar#
8!e@ib!e
&s the Internet "rew? the ori"ina! ;!ass3u! aressin" scheme became a !imitation? what is was the
esi"ne so!ution. (5)
&s the Internet "rew? the ori"ina! ;!ass3u! aressin" scheme became a !imitation. 'he I/ aress space
was bein" e@hauste because a!! networ7s ha to choose one o3 three possib!e sizes. Man# aresses
were unuse. 'wo new mechanisms were in4ente to o4ercome the !imitations? which are as 3o!!ows:
X %ubnet aressin"
X ;!ass!ess aressin"
Instea o3 ha4in" three istinct aress c!asses? a!!ow the i4ision between pre3i@ an su33i@ to occur on
an arbitrar# bounar#. 'he c!ass!ess aressin" scheme so!4es the prob!em b# a!!owin" an I%/ to assi"n
a pre3i@ that is? 5A bits !on" (a!!owin" the host to ha4e up to 1: hosts).
)I%' %-M( ;I&+&;'(+I%'I;% -8 & ;)I(N'. (10)
'he characteristics o3 a c!ient are e@p!aine be!ow:
S;!ient is an arbitrar# app!ication pro"ram.
SIt becomes c!ient temporari!#.
SIt can a!so per3orm other computations.
SIt is in4o7e irect!# b# the user.
SIt runs !oca!!# on the userDs computer.
SIt acti4e!# initiates contact with a ser4er.
SIt contacts one ser4er at a time.
;I&+&;'(+I%'I;% -8 & %(+E(+:
'he characteristics o3 a ser4er are e@p!aine be!ow:
SIt is a specia!-purpose? pri4i!e"e pro"ram.
SIt is eicate to pro4ie one ser4ice.
SIt can han!e mu!tip!e remote c!ients simu!taneous!#.
SIt in4o7e automatica!!# when s#stem boots.
SIt e@ecutes 3ore4er.
SIt nees power3u! computer an operatin" s#stem.
SIt waits 3or c!ient contact.
SIt accepts reKuests 3rom arbitrar# c!ients.
Fith he!p o3 the ia"ram be!ow? e@p!ain ';/ %e"ment 8ormat: (10)
%our)e Port: 'he 1<-bit port number o3 the process that ori"inate the ';/ se"ment on the
source e4ice.
/estination Port: 'he 1<-bit port number o3 the process that is the u!timate intene recipient o3
the messa"e on the estination e4ice.
%eIuen)e Num2er: 8or norma! transmissions? the seKuence number o3 the 3irst b#te o3 ata in
this se"ment. In a connection reKuest (%0N) messa"e? this carries the initia! seKuence number
(I%N) o3 the source ';/.
A)8no>0e6gment Num2er: Fhen the &;= bit is set? this se"ment is ser4in" as an
ac7now!e"ment (in aition to other possib!e uties) an this 3ie! contains the seKuence
number the source is ne@t e@pectin" the estination to sen
/ata "::set: %peci3ies the number o3 95-bit wors o3 ata in the ';/ heaer. In other wors? this
4a!ue times 3our eKua!s the number o3 b#tes in the heaer? which must a!wa#s be a mu!tip!e o3
3our. It is ca!!e a Yata o33setZ since it inicates b# how man# 95-bit wors the start o3 the ata is
o33set 3rom the be"innin" o3 the ';/ se"ment.
Reser3e6: < bits reser4e 3or 3uture useR sent as zero.
=ontro0 ,its: ';/ oes not use a separate 3ormat 3or contro! messa"es instea certain bits are
set 3or contro!!in" communication.
Ein6o>: Inicates the number o3 octets o3 ata the sener o3 this se"ment is wi!!in" to accept
3rom the recei4er at one time.
=1e)8sum: & 1<-bit chec7sum 3or ata inte"rit# protection? compute o4er the entire ';/
ata"ram p!us a specia! Ypseuo heaerZ o3 3ie!s. It is use to protect the entire ';/ se"ment
a"ainst not Just errors in transmission? but a!so errors in e!i4er#. -ptiona! a!ternate chec7sum
methos are a!so supporte.
Crgent Pointer: Cse in conJunction with the C+. contro! bit 3or priorit# ata trans3er. 'his 3ie!
contains the seKuence number o3 the !ast b#te o3 ur"ent ata.
";tions: %et 3or other options
Pa66ing: I3 the -ptions 3ie! is not a mu!tip!e o3 95 bits in !en"th? enou"h zeroes are ae to
pa the heaer so it is a mu!tip!e o3 95 bits.
/ata: 'he b#tes o3 ata bein" sent in the se"ment.
Iow can a ata"ram be transmitte across a ph#sica! networ7 that oes not unerstan the ata"ram
3ormatG (5)
'he answer !ies in a techniKue 7nown as encapsu!ation. Fhen an I/ ata"ram is encapsu!ate in a
3rame? the entire ata"ram is p!ace in the ata area o3 a 3rame.
'he networ7 inter3ace !a#er encapsu!ates an entire ata"ram in the ata area o3 a harware
3rame.
'he networ7 harware i"nores the ata"ram 3ormat.
'he harware treats a 3rame containin" a ata"ram !i7e an# other 3rame.
'he sener p!aces a 3rame t#pe in the 3rame heaer inicatin" that the 3rame contains a
ata"ram.
'he recei4er reas the 3rame t#pe an 7nows the 3rame contains a ata"ram.
Y'o achie4e a hierarch#? -%/8 a!!ows an autonomous s#stem to be partitione 3or routin" purposesZ.
,oes this 3eature ma7e -%/8 more comp!e@ or power3u!G (9)
;onsier the &P aresses: 1!(.2++.12!.5 an the corresponin" su2net mas8s 255.255.255.+. then
3in out the 3o!!owin": (5)
a. 'he num2er o: 2its use 3or su2netting. (A-1its)
b. 'ota! num2er o: 1ost in the su2net (254)
c. 'he net>or8 a66ress o3 the su2net. (1>A.500.15>.0)
d. 'he su2net a66ress o3 the &P a66ress.
Iere is the on!ine ca!cu!ator 3or subnettin"
http://www.subnetmas7.in3o/
http://www.subnet-ca!cu!ator.com/subnet.phpGnet$c!assU1
Frite own the comparison o3 ,istance- 4ector an )in7 M state a!"orithmG (5)
/&%TAN=$-D$=T"R R"CT&N':
X It is 4er# simp!e to imp!ement.
X /ac7et switch upates its own routin" tab!e 3irst.
X It is use in +I/.
4&N#-%TAT$ A4'"R&TJM:
X It is much more comp!e@.
X %witches per3orm inepenent computations.
X It is use in -%/8.
,escibe in etai! what is the purpose o3 the 3o!!owin" tab!eG Fhat sort o3 in3ormation can be e@tracteG
(10)
)ist own an escribe at!east 3i4e charachteristics o3 +outin" In3ormation /rotoco!. (10)
It has the 3o!!owin" characteristics:
3. SIt is use 3or routin" within an autonomous s#stem (I./).
2. SIop ;ount Metric: +I/ measures istance in networ7 hops? where each networ7 between the
source an estination counts as a sin"!e hop.
;. SIt uses C,/ 3or a!! messa"e transmissions.
/. S+I/ is use o4er )&N. Eersion 1 o3 +I/ uses harware broacast an 4ersion 5 a!!ows e!i4er#
4ia mu!ticast.
4. SIt can be use to a4ertise e3au!t route propa"ation. &n or"anization can use +I/ to insta!! a
e3au!t route in each router.
:. SIt uses istance 4ector a!"orithm.
>. S+I/ a!!ows hosts to !isten passi4e!# an upate its routin" tab!e
Fhat ma7e ';/ re!iab!eG .i4e one techniKue which ma7es it re!iab!e (mar7s 10)
Fh# c!ass &? 1 an ; are ca!!e primar# c!asses (mar7s 5)
I#portance o$ intelligent net)ork
What )ill *e the shortest possi*le path $or sec/re co##/nication!
I3 ph#sica! !a#er not unerstan the ata"ram 3ormat? how ata transmit.......(5)
,escribe the process o3 routin" pac7ets.
+outin" is the act o3 mo4in" in3ormation across an internet wor7 3rom a source to a estination.
Fhat are some routin" a!"orithm t#pesG
%tatic? #namic? 3!at? hierarchica!? host-inte!!i"ent? router-inte!!i"ent? intra-omain? inter-omain? !in7-state?
an istance 4ector.
Fh# 'hree- wa# hansha7e is necessar# 3or ';/ communication an how three-wa# hansha7e occursG
10
Fhat are the characteristics o3 C,/G 5
C,/ has the 3o!!owin" characteristics.
It is an en-to-en protoco!. It pro4ies app!ication-to-app!ication communication.
It pro4ies connection!ess ser4ice.
It is a Messa"e--riente protoco!.
It uses best-e33ort e!i4er# ser4ice.
It 3o!!ows arbitrar# interaction.
It is operatin" s#stem inepenent.
In c!ient -ser4er interaction? i3 no si"na! is "i4en? how can an app!ication 7now when communication has
arri4eG (9)
-ne app!ication acti4e!# be"ins e@ecution 3irst an another app!ication waits passi4e!# at prearran"e
!ocation. 'his process is ca!!e c!ient-ser4er interaction.
Fhat is the concept o3 I/ &ress Iierarch#G 9
'he I/ aress hierarch# "uarantees two important princip!es:
3. (ach computer is assi"ne a uniKue aress.
2. &!thou"h networ7 number assi"nment must be coorinate "!oba!!#? su33i@es can be assi"ne
!oca!!#.
Iow I;M/ can be use to trace a routeG 9
)ist o3 a!! routers on path 3rom & to 1 is ca!!e the route 3rom & to 1. 'he intermeiate routers sen I;M/
time e@ceee messa"e to the source an estination sens an I;M/ estination unreachab!e messa"e
to the source.
'racert (Finows 4ersion) sens I;M/ echo messa"es with increasin" ''). +outer that ecrements '')
to 0 sens I;M/ time e@ceee messa"e? with routerDs aress as source aress. 8irst? with '') 1?
"ets to 3irst router? which iscars an sens time e@ceee messa"e. Ne@t? with '') 5 "ets throu"h 3irst
router to secon router. It continues unti! an I;M/ echo rep!# messa"e 3rom estination is recei4e.
Fhat is meant b# the ;!ient-%er4er /arai"mG (5)
It is use b# a!! networ7 app!ications. 'he passi4e pro"ram is ca!!e a ser4er an the acti4e pro"ram is
ca!!e a c!ient.
8in the c!ass o3 each aress:
a. 00000001 00001011 00001011 11101111
b. 11000001 10000011 00011011 11111111
c. 10100111 11011011 10001011 01101111
. 11110011 10011011 11111011 00001111
%o!ution
a. 'he 3irst bit is 0. 'his is a c!ass & aress.
b. 'he 3irst 5 bits are 1R the thir bit is 0. 'his is a c!ass ; aress.
c. 'he 3irst bit is 0R the secon bit is 1. 'his is a c!ass 1 aress.
. 'he 3irst : bits are 1s. 'his is a c!ass ( aress.
0 [ 15> ;!ass &
15A [ 1B1 ;!ass 1
1B5 [ 559 ;!ass ;
55: [ 59B ;!ass ,
5:0 [ 555 ;!ass (
8in the c!ass o3 each aress:
a. 55>.15.1:.A>b.1B9.1:.5<.55 c.1:.59.150.A . 555.5.15.111 e.19:.11.>A.5<
%o!ution
a. 'he 3irst b#te is 55> (between 55: an 59B)R the c!ass is ,.
b. 'he 3irst b#te is 1B9 (between 1B5 an 559)R the c!ass is ;.
c. 'he 3irst b#te is 1: (between 0 an 15>)R the c!ass is &.
. 'he 3irst b#te is 555 (between 5:0 an 555)R the c!ass is (.
e. 'he 3irst b#te is 19: (between 15A an 1B1)R the c!ass is 1.
;han"e the 3o!!owin" I/ aresses 3rom binar# notation to otte-ecima! notation.
a. 10000001 00001011 00001011 11101111
b. 11000001 10000011 00011011 11111111
c. 11100111 11011011 10001011 01101111
. 11111001 10011011 11111011 00001111
%o!ution
Fe rep!ace each "roup o3 A bits with its eKui4a!ent ecima! number (see &ppeni@ 1) an a ots 3or
separation:
a. 15B.11.11.59B
b. 1B9.191.5>.555
c. 591.51B.19B.111
. 5:B.155.551.15
8in the error? i3 an#? in the 3o!!owin" I/ aresses:
a. 111.5<.0:5.>A
b. 551.9:.>.A.50
c. >5.:5.901.1:
. 11100010.59.1:.<>
%o!ution
a. 'here are no !eain" zeroes in otte-ecima! notation (0:5).
b. Fe ma# not ha4e more than 3our numbers in an I/ aress.
c. In otte-ecima! notation? each number is !ess than or eKua! to 555R 901 is outsie this ran"e.
. & mi@ture o3 binar# notation an otte-ecima! notation is not a!!owe.
Is there a comparison between ';//I/ re3erence moe! an -%I re3erence moe!.
1oth the ';//I/ an -%I are internationa! stanars 3or ata communication. 1oth use the concept o3
protoco! !a#erin". 'hese are the conceptua! too!s that is o3ten use to show how 4arious protoco!s an
techno!o"ies 3it to"ether to imp!ement networ7s. 'he 3unctions that the moe! represents are much the
same. 'his means that the ';//I/ an the -%I moe!s are rea!!# Kuite simi!ar in nature e4en i3 the# onHt
car4e up the networ7 3unctiona!it# pie in precise!# the same wa#. 'here is a 3air!# natura! corresponence
between the ';//I/ an -%I !a#ersR it Just isnHt a!wa#s a Yone-to-oneZ re!ationship. %ince the -%I moe! is
use so wie!#? it is common to e@p!ain the ';//I/ architecture both in terms o3 the ';//I/ !a#ers an the
corresponin" -%I !a#ers
Question No: 1 ( Marks: 1 ) - Please choose one
No error detection scheme is perect !ecause transmission errors can aect the
additional inormation as "ell as the data.
# True ($eerence is %i&en !elo")
+alse
------ Pro%ram sends a messa%e to a remote computer and reports "hether the
computer responds'
# Pin% (P-11)
*race route
6C24
Non of the given
Question No: ( ( Marks: 1 ) - Please choose one
---------- "as especiall) concerned a!out the lack o hi%h po"ered computers'
# *$P* (+earch !) ,nternet) click here to see
6EEE
E6A
Non of the given
Question No: - ( Marks: 1 ) - Please choose one
The term -------- is used to denote the deinition o a packet used "ith a speciic t)pe
o net"ork'
4acket
# .rame (p-1/)
Data
None of the given
0eli&ered B): 1aseem 2eetumoni 3o%ic 4han
5omputer net"orks are oten called -------------- !ecause the) use packet technolo%)'
Ethernet
,witch networks
# Packet net"orks (+earch !) ,nternet) 5lick 6ere to see
None of the given
Question No: / ( Marks: 1 ) - Please choose one
-------------- ha&e ad&anta%es arisen rom the si7e and ease o computation'
# 5$5 (p-28)
4arity
Checksums
None of given
Most 3*Ns that emplo) rin% topolo%) use an access mechanism kno"n as-------
C,2A5CD
C,2A5CA
# T:4;N P*++,NG (p-(8)
None of the given
Question No: < ( Marks: 1 ) - Please choose one
,;;; 3 35=+N*P header is --------> "hich is used to speci) the t)pe o data'
# < octets (p-(9)
M bytes
M bits
None of the given
Question No: ? ( Marks: 1 ) - Please choose one
.ormall) named ########## inormall) kno"n as the t"isted pair ;thernet or TP
;thernet'
&' (ase )
&' (ase %
# 18 Base T (p--/)
None of the given
*n interace or t"isted pair ;thernet must ha&e an ############ connector > and
must %enerate si%nals accordin% to the############# speciication.
# $2--5> 18 Base T (p--9)
"#-$%! &' (ase %
(NC! &' (ase )
(NC! &' (ase *
* !rid%es unction in the ######### la)ers(s)'
4hysical /2AC0
Data link
# Net"ork (not sure)
4hysical /2AC0 and Data link
* Brid%e can ########
+ilter a frame
+orward a frame
E-tend a .AN
# 0o all the a!o&e (p-58)
Question No: 1( ( Marks: 1 ) - Please choose one
* Brid%e or"ards or ilters a rame !) comparin% the inormation in its address
ta!le to the rame@s##########
.ayer ) source address
,ource nodeKs physical address
3a)er 2 destination address (not sure)
.ayer 3 destination address
Question No: 1- ( Marks: 1 ) - Please choose one
######## computes shortest paths in a %raph !) usin% "ei%hts on ed%es as a
measure o distance'
8reedy algorithm
Distance vector algorithm
# 0iAksta@s al%orithm (p-/2)
Non of the given
########### is used or audio and &ideo> since these ha&e predeined maBimum
data rates
5onstant Bit $ate (5B$) ser&ice (p-91)
1ariable (it "ate /1("0 service
Available (it "ate /A("0 service
None of the given
Question No: 1/ ( Marks: 1 ) - Please choose one
Cnlike .rame $ela) and *TM> +M0+ (+"itched multi-me%a!it 0ata ser&ice)
oers####### '
5onnectionless ser&ice paradi%m (p-152)
Connection oriented service paradigm
(oth Connectionless and Connection-oriented service paradigm
None of the given
* net"ork "ith throu%hput T and dela) 0 has a total o ######## !it in transit at
an) time'
* 5 D
# T B 0 (p-<8)
* U D
None of the given
Question No: 1< ( Marks: 1 ) - Please choose one
*TM is desi%ned to "ork on###########'
*wisted 4air
Coa-ial
"adio +requency
# .i!er (p-(2)
Question No: 1? ( Marks: 1 ) - Please choose one
5omputers attached to an ;thernet use ------ in "hich a computer "aits or the
ether to !e idle !eore transmittin% a rame'
5+M*=50 (p--()
C,2A5CA
*;EEN 4A,,6N8
None of the given
.00, can transmits data at a rate o ----------
188 million !its per second (p-(1)
&' million bits per second
&''' million bits per second
None of the given
Question No: 1 ( M a r k s: 1 )
,n Point-to-Point topolo%) there are t"o topolo%ies'
B *ree and "ing
B ,tar and "ing
+tar and Tree /"eference is given below0
B None of the given
In Point-to-Point topo#og/ there are two topo#ogies.
1 ,-"4 topo#og/ 2 -4)) topo#og/
computer responds'
Pin% /"eference is given below0
B *raceroute
B 6C24
B Non of the given
Ping program tests reach a%i#it/. It sends datagram $rom + to "0 that echoes %ack to +. it
uses I5*P echo request and echo rep#/ messages.
Question No: ( ( M a r k s: 1 )
----- has no "a) to determine the cause o the pro!lem'
B 6C24
Pin% /"eference is given below0
B *race route
B Non of the given
Ping has no wa/ to determine the cause o$ the pro%#em. -racing " 4oute Network
administrators use another too#0 trace route.
Question No: - ( M a r k s: 1 )
The term----- ------- reers to the %eneral concept o a small !lock o data
Packet /"eference is given below0
B +rame
B Data
B None of the given
Packet is a generic term that re$ers to sma## %#ock o$ data. Packet have di$$erent $ormat.
)ach hardware uses di$$erent packet $ormat.
---------- scheme> "hich is desi%ned to help detect transmissions errors> send one
eBtra !it o inormation "ith each character
Parit) /"eference is given below0
B Checksums
B C"C
B None of given
" parit/ scheme0 which is designed to he#p detect transmission errors0 sends one eAtra hit
o$ in$ormation with each character. "#though it a##ows receiver to determine i$ a sing#e
%it has %een changed parit/ can not detect transmission errors that change an even
num%er o$ %its.
Question No: / ( M a r k s: 1 )
3ocal Talk is a 3*N technolo%) that emplo)s -------------
Bus topolo%) /"eference is given below0
B "ing topology
B ,tar topology
B None of the given
!85"! -"!>.
"pp#e invented the !"N techno#og/ that uses %us topo#og/. Its inter$ace is inc#uded with
a## *acintosh computers.
Most 3*Ns that emplo) rin% topolo%) use an access mechanism kno"n as-------
B C,2A5CD
B C,2A5CA
T:4;N P*++,NG /"eference is given below0
B None of the given
*ost !"Ns that emp#o/ ring techno#og/ use an access mechanism known as token
passing. " token ring operates as a sing#e0 shared medium. ;hen a computer wants to
send data0 it must wait unti# it o%tains the token0 when it is in contro# o$ the ring
Question No: < ( M a r k s: 1 )
;thernet uses a ------ !it static addressin% scheme in "hich each de&ice is assi%ned a
uniDue address !) the manuacturer'
B H$
-< /"eference is given below0
B 3)
B M
)thernet uses a &D-%it static addressing scheme
Question No: ? ( M a r k s: 1 )
.ormall) named ########## inormall) kno"n as the thick "ire ;thernet or Thick
net'
B &' (ase )
18 Base 5 /"eference is given below0
B &' (ase *
B None of the given
-hick )thernet0 o$$icia##/ known as 1' +ase E0 is the o#dest $orm o$ )thernet. It was
origina##/ deve#oped in the #ate 1F<'Gs %/ Digita# )quipment 5orporation0 I+*0
and HeroA0 and %ecame an internationa# standard (I))) D'2.3 in 1FD3.
-aken $rom http.IIwww.ma@nets.comItechI1'%ase-E.htm
.ormall) named ########## inormall) kno"n as the t"isted pair ;thernet or TP
;thernet'
B &' (ase )
B &' (ase %
18 Base T ($eerence is %i&en !elo")
B None of the given
7orma##/ ca##ed 1' +ase J-
"#so twisted pair )thernet or simp#/ -P )thernet
The maBimum si7e o an ;thernet se%ment is###########
B )%' meters
588 meters /"eference is given below0
B @'' meters
B None of the given
8ne )thernet ca%#e is sometimes ca##ed a segment. -his segment is #imited to E'' meters
in #ength. -he minimum separation %etween connections is 3 meters. (P# 2<
* Brid%e can ########
B +ilter a frame
B +orward a frame
B E-tend a .AN
0o all the a!o&e /"eference is given below0
" %ridge is a hardware device a#so used to connect two !"N segments to eAtend a !"N. It
#istens to a## tra$$ic and recogni@es $rame $ormat. It a#so $orwards on#/ correct comp#ete
$rames and discards the co##ided and error $rames.
-he most important task a %ridge per$orms is $rame $i#tering.
Question No: 1( ( M a r k s: 1 )
####### computes shortest paths in a %raph !) usin% "ei%hts on ed%es as a measure
o distance'
B 8reedy algorithm
B Distance vector algorithm
0iAksta@s al%orithm /"eference is given below0
B Non of the given
Di1kstras a#gorithm computes shortest paths in a graph %/ using weights on edg as a
measure o$ distance. " path with the $ewest num%er o$ edges ma/ not %e the path with
#east weight. (P# 1<3 e-%ooks
Question No: 1- ( M a r k s: 1 )
##########is used or compressed audio and &ideo "here the data rate depends on
the le&el o compression that can !e achie&ed'
B Constant (it "ate /C("0 service
Earia!le Bit $ate (EB$) ser&ice /"eference is given below0
B Available (it "ate /A("0 service
B None of the given
="4I"+!) +I- 4"-) (=+4.
It is used $or compressed audio and video where the data rate depends on the #eve# o$
compression that can %e achieved.
Basic 3*N technolo%ies such as ;thernet> Token $in%> and .00, use a #####'
5onnectionless ser&ice paradi%m /"eference is given below0
B (oth Connectionless and Connection-oriented service paradigm
B None of the given
+asic !"N techno#ogies such as Et$ernet' (oken Rin"' an! FDDI use a connection#ess
service paradigm. "#though a computer needs to wait $or access to a shared medium
%e$ore sending a packet
(@h0vu@s0nov1'
Question No: 1/ ( M a r k s: 1 )
The product o dela) and throu%hput measures the ##### o data that can !e
present on the net"ork'
B Area
B 1olume
B .ength
None o the %i&en /"eference is given below0
D)!"3 -6489P9- P48D95-.
It is computed as de#a/ time mu#tip#ied %/ e$$ective throughput. It measures amount o$
data that can %e present in the network (P# D'
* net"ork "ith throu%hput T and dela) 0 has a total o ######## !it in transit at
an) time'
B * 5 D
T B 0 /"eference is given below0
B * U D
B None of the given
" network with throughput - and de#a/ D has a tota# o$ - A D %its in transit at
an/ time. (e-%ooks
Question No: 1< ( M a r k s: 1 )
:ne repeater #######> t"o repeaters ######## the maBimum ca!le len%th
limitation'
dou!les> triple /"eference is given below0
B square roots! cude roots
B and! triple
B doubles! cancel
8ne repeater dou%#es0 two repeaters trip#e the maAimum ca%#e #ength #imitation. (P# &F
Question No: 1? ( M a r k s: 1 )
* net"ork uses a ------ i all computers attach to a central point
+tar Topolo%) /"eference is given below0
B "ing *opology
B (us *opology
B None of the given
,-"4 -8P8!8(3.
In this topo#og/0 a## computers are attached to a centra# point0 which is sometimes ca##ed
the K6u%L (P# 2E
5omputers attached to an ;thernet use ------ in "hich a computer "aits or the
other to !e idle !eore transmittin% a rame'
5+M*=50 /"eference is given below0
B C,2A5CA
B *;EEN 4A,,6N8
B None of the given
"## computers attached to the )thernet use 5,*"I5D to co-ordinate their activities. "
computer wishing to transmit checks $or e#ectrica# activit/ on the ca%#e0 in$orma##/ ca##ed
a carrier. I$ there is no carrier0 the computer can transmit. I$ a carrier is present0 the
computer waits $or the sender to $inish %e$ore proceeding.
M,0T;$M ;F*M,N*T,:N
.all 288<
5+/18- 5omputer Net"ork (+ession - 2)
Time: /8 min
Marks: (<
* t)pical port on an *TM s"itch operates at ########## or hi%her'
;C-) speed /&%%2bps0
;C-3 speed /&''2bps0
# :5-( speed (155M!ps) (p-92)
;C-3 speed /&%%8bps0
The product o dela) and throu%hput measures the ##### o data that can !e
present on the net"ork.
Area
1olume
.ength
# None o the %i&en (p-<8)
##########is used or compressed audio and &ideo "here the data rate depends on
the le&el o compression that can !e achie&ed'
Constant (it "ate /C("0 service
###Earia!le Bit $ate (EB$) ser&ice (p-91)
None of the given
1hich o the ollo"in% is a connectin% de&iceG
(ridge
"epeater
=ub
###*ll the %i&en (p-5-)
* !rid%es unction in the ######### la)ers(s)'
4hysical /2AC0
Data link
###Net"ork (not sure)
4hysical /2AC0 and Data link
,;;; 3 35=+N*P header is --------> "hich is used to speci) the t)pe o data'
###< octets (p-(9)
M bytes
M bits
None of the given
The third ield o the header consists o ------ !it ;thernet rame t)pe'
$M
3)
###1/ (p-(/)
M
*n ------------method> the net"ork hard"are desi%ners speci) ho" t)pe inormation
is included in the rame and the &alue use to identi) &arious rame t)pes'
###;Bplicit rame t)pe (not sure)
6deal frame type
6mplicit frame type
None of the given
3ocal Talk is a 3*N technolo%) that emplo)s -------------
,tar topology
###Bus topolo%) (p-(8)
"ing topology
None of the given
The .ast ;thernet hard"are operates at a rate o --------
&' 2bps
###188 M!ps (p-29)
&''' 2bps
None of the given
---------- scheme> "hich is desi%ned to help detect transmissions errors> send one
eBtra !it o inormation "ith each character
4arity
5hecksums (p-1?)
C"C
None of given
5omputer net"orks are oten called -------------- !ecause the) use packet technolo%)'
Ethernet
,witch networks
###Packet net"orks /repeated0
None of the given
computer responds'
###Pin% (p-11)
*raceroute
6C24
Non of the given
,n ---------> net"ork occupies lar%er areas like cities H countries'
.AN
###1*N (p-55)
2AN
None of the given
,n -------------> net"ork occupies the smaller area like a room a loor or a !uildin%
###3*N (p-55)
9AN
2AN
None of the given
,n Point-to-Point topolo%) there are t"o topolo%ies'
*ree and "ing
,tar and "ing
###+tar and Tree (p-2)
None of the given
M,0T;$M ;F*M,N*T,:N
.all 288<
$e No: 18?<1/
Time: /8 min
Marks: (<
######## has a Aitter 7ero
None of the given
1irtual 4rivate Network
6sochronous Network
# *s)nchronous Net"ork (p-/5)
#Cnlike .rame $ela) and *TM> +M0+ (+"itched multi-me%a!it 0ata ser&ice)
oers####### '
###5onnectionless ser&ice paradi%m (p-99)
Connection oriented service paradigm
None of the given
#*TM assi%ns each E5 a ############# identiier that is di&ided t"o parts to
produce a hierarch)'
)&-bit
))-bit
)3-bit
###2--!it (p-/9)
#Most 1*N s)stems include a mechanism that can !e used to eliminate the
common case o duplication routin% is called###########
=ierarchal address
###0eault route (p-/8)
,hortest path
None of the given
#The neBt hop to "hich a packet is sent depends onl) on
###Packet@s destination (p-182)
4acketKs original source
4ath the packet has taken
Non of the given
#*n interace or t"isted pair ;thernet must ha&e an ############ connector > and
must %enerate si%nals accordin% to the############# speciication'
###$2--5> 18 Base T (p--/)
"#-$%! &' (ase %
(NC! &' (ase )
(NC! &' (ase *
#1hen an application--------------- data> it makes a cop) o the data a&aila!le to all
other computers on the net"ork.
###Broadcastin% (p-5()
2ulticasting
7nicasting
None of the given
#* ---------- pro&ide a mechanism that a customer can use to set a ph)sical address'
,tatic addressing scheme
###5oni%ura!le addressin% scheme (p-(-)
Dynamic addressing scheme
None of the given
#.00, can transmits data at a rate o -----
###188 million !its per second ----- (p-(1)
&'' million bits per second
None of the given
#5omputers attached to an ether use ------ in "hich a computer "aits or the ether
to !e idle !eore transmittin% a rame.
###5+M*=50
C,2A5CA
*;EEN 4A,,6N8
None of the given
#-------------- ha&e ad&anta%es arisen rom the si7e and ease o computation'
C"C
4arity
###5hecksums (p-1?)
None of given
#The term -------- is used to denote the deinition o a packet used "ith a speciic
t)pe o net"ork'
4acket
###.rame (p-1/)
Data
None of the given
#------ has no "a) to determine the cause o the pro!lem'
###Pin% (p-11)
*race route
6C24
Non of the given
#------ Pro%ram sends a messa%e to a remote computer and reports "hether the
computer responds'
###Pin% (p-11)
*raceroute
6C24
Non of the given
#,n -------------> net"ork occupies the smaller area like a room a loor or a !uildin%
###3*N (p-55)
9AN
2AN
None of the given
M,0T;$M ;F*M,N*T,:N
,pring )'&'
C,H&'- Computer Network
6n Point-to-Point topology there are two topologies.
+tar and Tree (P-5)
,tar and "ing
B ,tar and (us
None of the given
------ 4rogram sends a message to a remote computer and reports whether the computer
responds.
Pin% (p-11)
*raceroute
6C24
Non of the given
------ has no way to determine the cause of the problem.
B 6C24
Non of the given
Pin% (p-11)
*race route
*he term------------ refers to the general concept of a small block of data
Packet (p-1/)
+rame
Data
None of the given
---------- scheme! which is designed to help detect transmissions errors! send one e-tra
bit of information with each character
Parit) (p-1<)
Checksums
C"C
None of given
.ocal *alk is a .AN technology that employs -------------
Bus topolo%) (p-(8)
"ing topology
None of the given
,tar topology
2ost .ANs that employ ring topology use an access mechanism known as-------
C,2A5CD
C,2A5CA
T:4;N P*++,NG (p-(8)
None of the given
Ethernet uses a ------ bit static addressing scheme in which each device is assigned a
unique address by the manufacturer.
B H$
-< (p-?<)
3)
M
+ormally named informally known as the thick wire Ethernet or *hick net.
&' (ase )
&' (ase %
18 Base T (p--8)
None of the given
+ormally named informally known as the twisted pair Ethernet or *4
Ethernet.
18 Base 2 (p--/)
&' (ase %
&' (ase *
None of the given
*he ma-imum si>e of an Ethernet segment is
)%' meters
588 meters (p-29)
@'' meters
None of the given
A (ridge can
+ilter a frame
+orward a frame
E-tend a .AN
0o all the a!o&e (p-58 )
computes shortest paths in a graph by using weights on edges as a measure of
distance.
8reedy algorithm
Distance vector algorithm
0iAksta@s al%orithm (p-/2)
Non of the given
is used for compressed audio and video where the data rate depends on the
level of compression that can be achieved.
B Constant (it "ate /C("0 service
Earia!le Bit $ate (EB$) ser&ice (p-91)
None of the given
(asic .AN technologies such as Ethernet! *oken "ing! and +DD6 use a .
None of the given
*he product of delay and throughput measures the of data that can be present on
the network.
Area
1olume
.ength
None o the %i&en (p-<8)
A network with throughput * and delay D has a total of bit in transit at any
time.
* 5 D
T B 0 (p-<8)
* U D
None of the given
Question No: 1< ( Marks: 1 ) - Please choose one
;ne repeater ! two repeaters the ma-imum cable length limitation.
dou!les> triple (p--?)
square roots! cude roots
and! triple
doubles! cancel
Question No: 1? ( Marks: 1 ) - Please choose one
A network uses a ------ if all computers attach to a central point
+tar Topolo%) (p-25)
"ing *opology
(us *opology
None of the given
Computers attached to an Ethernet use ------ in which a computer waits for the ether to be
idle before transmitting a frame.
5+M*=50 (p-2<)
C,2A5CA
B *;EEN 4A,,6N8
None of the given
M,0T;$M ;F*M,N*T,:N
.all 288<
$e No: 18?<1/
Time: /8 min
Marks: (<
has a Ditter >ero
B None of the given
B 1irtual 4rivate Network
B 6sochronous Network
*s)nchronous Net"ork (p-/5)
7nlike +rame "elay and A*2! ,2D, /,witched multi-megabit Data service0
offers .
BConnection oriented service paradigm
B(oth Connectionless and Connection-oriented service paradigm
BNone of the given
A*2 assigns each 1C a identifier that is divided two parts to produce a
hierarchy.
B)&-bit
B))-bit
B)3-bit
B2--!it (p-/9)
2ost 9AN systems include a mechanism that can be used to eliminate the common case
of duplication routing is called
B=ierarchal address
0eault route (p-/8)
B,hortest path
BNone of the given
*he ne-t hop to which a packet is sent depends only on
Packet@s destination (p-182)
B4acketKs original source
B4ath the packet has taken
BNon of the given
An interface for twisted pair Ethernet must have an connector ! and must
generate signals according to the specification.
$2--5> 18 Base T (p--/)
B"#-$%! &' (ase %
B(NC! &' (ase )
B(NC! &' (ase *
9hen an application--------------- data! it makes a copy of the data available to all other
computers on the network.
Broadcastin% (p-5()
B2ulticasting
B7nicasting
BNone of the given
A ---------- provide a mechanism that a customer can use to set a physical address.
B,tatic addressing scheme
5oni%ura!le addressin% scheme (p-(-)
BDynamic addressing scheme
BNone of the given
+DD6 can transmits data at a rate of ----- -----
188 million !its per second (p-(1)
B&'' million bits per second
B&'' million bits per second
BNone of the given
Computers attached to an ether use ------ in which a computer waits for the ether to be
idle before transmitting a frame.
5+M*=50 (not sure)
BC,2A5CA
B*;EEN 4A,,6N8
BNone of the given
-------------- have advantages arisen from the si>e and ease of computation.
BC"C
B4arity
5hecksums (p-1?)
BNone of given
*he term -------- is used to denote the definition of a packet used with a specific type of
network.
B4acket
.rame (p-1/)
BData
BNone of the given
------ has no way to determine the cause of the problem.
Pin% (p-11)
B*race route
B6C24
BNon of the given
------ 4rogram sends a message to a remote computer and reports whether the computer
responds.
Pin% (p-11)
B*raceroute
B6C24
BNon of the given
6n -------------! network occupies the smaller area like a room a floor or a building
3*N (p-55)
B9AN
B2AN
BNone of the given
1hat is the dierence !et"een the ph)sical and lo%ical topolo%iesG
Every .AN has a topology! or the way that the devices on a network are arranged
and how they communicate with each other.
P6I+,53 T:P:3:GI:
*he way that the workstations are connected to the network through the actual
cables that transmit data -- the physical structure of the network -- is called the physical
topology. 6t depends on the wiring scheme.
3:G,5*3 T:P:3:GIJ
*he logical topology! in contrast! is the way that the signals act on the network
media! or the way that the data passes through the network from one device to the ne-t
without regard to the physical interconnection of the devices. 9e can say that it is
defined by the specific network technology.
0eine Eector-0istance *l%orithm.
4acket switches wait for ne-t update message and they iterate through entries in
message. 6f entry has shortest path to destination! insert source as ne-t hop to destination
and record distance as distance from ne-t hop to destination plus distance from this
switch to ne-t hop.
Question No: 2( ( Marks: ( )
1hat is the concept o store and or"ard technolo%)G
+T:$; *N0 .:$1*$0:
Data delivery from one computer to another is accomplished through store and
forward technology. 6n this technology packet switch stores incoming packet and also
forwards that packet to another switch or computer. +or this purpose packet switch has
internal memory into which it can hold packet if outgoing connection is busy. 4ackets for
each connection held on queue.
Question No: 2- ( Marks: ( )
6o" can +"itched Eirtual Net"ork !e esta!lishedG
+1,T56;0 E,$TC*3 5,$5C,T+:
2ost networks offer dynamic connections! which last for a relatively short time.
*o handle this! A*2 can dynamically establish a switched virtual circuit /,1C0! allow it
last as long as necessary and then terminate it.
*he terminology comes from the *elcoKs where switching system normally refers to all
switching.
E,*A(.6,=6N8 AN ,1CJ
*he computer sends a connection request to the switch to which it is attached.
,oftware in the switch finds a network path to the destination and sends along the
connection request.
Each pair of switches in the path communicates to choose a 14651C6 for their tables.
;nce the connection is established by the destination! a message is sent back to the
originating computer to indicate the ,1C is ready.
6f any switch or the destination computer does not agree to setting up the 1C! an error
message is sent back and the ,1C is not established
6o" can a !rid%e kno" "hether to or"ard ramesG
*he bridge builds a list of 2AC addresses on either side of the bridge. *herefore!
it knows which packets should be forwarded to the other side and which should not. 2ost
bridges are self-learning bridges. As soon as a frame arrives to a bridge! it e-tracts a
source address from its header and automatically adds it in the list for that segment. 6n
this way a bridge builds up address lists.
6n the e-ample of a packet that uses a 2AC address not in its table it can err on the side
of caution by forwarding the packet.
Question No: 2/ ( Marks: 5 )
5ompare connection oriented and connectionless +er&ice'
5onnection-:riented &s' 5onnectionless +er&ice
*his characteristic specifies whether conversations take place in a more or less
structured manner. 9hen using a connection-oriented protocol! you incur the overhead of
setting up a virtual circuit /a defined communications path0 between the sender and
receiver! which is maintained until the sender and receiver have completed their entire
conversation.
9hen the conversation is completed! you incur the overhead of tearing down the virtual
circuit. Connection-oriented protocols provide guaranteed delivery of messages in the
order in which they were sent.
Contrast this with Connectionless service! which does not require establishing a session
and a virtual circuit. *his can be found in the network layer or transport layer! depending
on the protocol. Iou can think of a connectionless protocol as being akin to mailing a
post card. Iou send it and hope that the receiver gets it. Common features of a
connectionless service areJ
L 4ackets do not need to arrive in a specific order
L "eassembly of any packet broken into fragments during transmission must be in proper
order
L No time is used in creating a session
L No Acknowledgement is required.
L *he largest connectionless network in use today is the 6nternet
1hat is the dierence !et"een 3*N and 1*NG
.ocal area network /.AN0
.AN is small in si>e covers the area within a room! building or cities.
9ide area network /9AN0
9AN is large in si>e and covers the area cities! countries and continents.
0eine the term 2itter'
*he term #itter is used for variance in transmission delays. #itter is significance for
voice! video and data. #itter can occur when a packet is delayed because the network is
busy.
Gi&e a comparison o "irin% +chemes'
*hick Ethernet wiring scheme.
*his uses thick coa- cable. A76 cable or transceiver or drop cable connects from
N6C to transceiver. A76 cable carries digital signal from N6C to transceiver. *he
transceiver generates analog signal on coa- cable. *he wires in A76 carry digital signals
power and other control signals. *hick Ethernet also requires terminators to avoid signal
reflectance.
*hin Ethernet wiring scheme.
*hin Ethernet uses thin coa- cable that is cheaper and easier to install than thick
Ethernet coa-. 6n thin ethernet wiring scheme transceiver electronics are built into
N6C and N6C connect directly to network medium. Coa- cable use connector on
N6C. Coa- runs directly to back of each connected computer by *-connector. *he
*-connector directly attaches to N6C.
6o" can +"itched Eirtual Net"ork !e esta!lishedG
2ost networks offer dynamic connections that last for a relatively short time.
A*2 can dynamically establish a switched virtual circuit ,1C that allows it as long as
necessary and then terminate it. *he computer sends a connection request to the switch to
which it is attached. ,oftware in the switch finds a path to the destination and sends with
the connection request. Each pair of switches in the path communicates to choose a
14651C6 for their tables. ;nce the connection is established by the destination than a
message is given back to the originating computer to indicate the ,1C is ready.
0escri!e permanent &irtual circuits (PE5)'
A*2 can provide the virtual circuits that look like traditional leased digital
circuits. *he permanent virtual circuits 41C works as long as the customer pays the
periodic fee for its use. *he forwarding table enter configured the terms used by *elco
4rovisioning requires two steps. *o determine a complete path.
*o choose appropriate 14651C6 for each step in the path and configures each adDacent
pair of switches.
1hat are deault routes> dra" the ta!le'
"outing table entries can collapse with a default route. 6f destination doesnKt have
in e-plicit routing table entry and then it use a default route. 6t is shown in the below
table.
Destination Ne-t
hop
Destination Ne-t
hop
Destination Ne-t
hop
Destination Ne-t
hop
& - ) - & 3!& ) $!)
V &!3 $ )!$ ) 3!) $ -
V )!3 3 - V $!3
$ 3!$
Node & Node ) Node 3 Node $
Question No: 1? ( Marks: ( )
1h) 18-!ase T "irin% scheme is called star shaped !us "irin% scheme'
*he main feature of twisted pair Ethernet is that it forms a classic star topology
however functions like a bus. &'(ase-* Ethernet is often called a star shaped bus.
Guestion NoJ )' / 2arksJ % 0
9hat are the main factors due to which mechanism of error detections schemes differ:
Guestion NoJ )& / 2arksJ &' 0
=ow much data can be present on an original Ethernet segment at one time: *o find out!
compute the delay-throughput product. *he original Ethernet operate at &' mega bits per
second! and a segment was limited to %'' meters. Assume the signals propagate down the
cable at HH percent of the speed of light.W
;ne Ethernet cable is sometimes called a segment. *his segment is limited to %''
meters in length. *he minimum separation between connections is 3 meters.
#1hich t)pe o inormation is o!tained rom net"ork snier and in "hich mode
Net"ork snier operatesG
,olutionJ
A network analy>er also called network monitor or a network sniffer is used to
e-amine the performance of or debug a network. 6t can report statistics such as capacity
utili>ation! distribution of frame si>e! collision rate or token circulation time
2ost installations still use D6< Ethernet encoding in which there is no ..C5,NA4
header in the frame. A network analy>er can tell from the values in the type field /small
values are lengths! which mean an ..C5,NA4 header is located in the first octets of the
data areaN large values are types! which mean no ..C5,NA4 header is included0.
*he operation of network analy>er is a computer with a network interface that
receives all frames! which is called promiscuous mode. ,o many desktop computers have
interface that can be configured for promiscuous mode. 9hen combined with software
computer can e-amine any frame on .AN. 6n this way the communication across .AN is
guaranteed to be private. Computer receives and displays frames on the .AN. Network
analy>er can be configured to filter and process frames. 6t can count frames of specific
type of si>e. 6t displays only frames from or to specific computers.
################################################
Thick ;thernet> Thin ;thernet and T"isted pair ;thernet'
,olutionJ-
Thick ;thernet:
*hick Ethernet! officially known as &' (ase-%! is the oldest form of Ethernet.
;ne form of cabling supported by Ethernet is low-loss %' ;hm coa-ial cable as shown in
the figure below. *his type of cable is '.%A diameter /usually supplied with a yellow outer
41C coating0 and rather infle-ible. 6t has become known in the communications industry
as A*hick EthernetA. *he official name for this cable is &' (aseband% /&'(%0! indicating
that it is specified for baseband communications at &' 2bps over distances up to %''m.
Thin ;thernet:
*hin Ethernet! officially called &' (ase-)! is a less e-pensive version of &' (ase-
% /*hick Ethernet0 technologies. 6t uses a lighter and thinner coa-ial cable and dispenses
with the e-ternal transceivers used with &' (ase-%.
&' (ase-) uses an "8-%MA57 coa-ial cable and is wired in a bus topology. Each device
on the network is connected to the bus through a (NC A*A adapter! and each end of the
bus must have a %' ;hm terminator attached. Each node on the bus must be a minimum
of '.% meters /&.% feet0 apart! and the overall length of the bus must be less than &M%
meters /H'H feet0.
T"isted Pair ;thernetJ
*wisted 4air Ethernet /&'base*0! sometime also called A7*4A from A7nshielded
*wisted 4airA! is based on using a cable similar to phone-wiring. *he cable is connected
via "#-$% connectors to the network card installed in the 4C.
9hat is the difference between .AN and 9AN:
.ocal area network /.AN0
.AN is small in si>e covers the area within a room! building or cities.
9ide area network /9AN0
9AN is large in si>e and covers the area cities! countries and continents.
Define the term #itter.
*he term #itter is used for variance in transmission delays. #itter is significance for voice!
video and data. #itter can occur when a packet is delayed because the network is busy.
86ve a comparision of wiring ,chemes.
*hick Ethernet wiring scheme.
*his uses thick coa- cable. A76 cable or transceiver or drop cable connects from N6C to
transceiver. A76 cable carries digital signal from N6C to transceiver. *he transceiver
generates analog signal on coa- cable. *he wires in A76 carry digital signals power and
other control signals. *hick Ethernet also requires terminators to avoid signal reflectance.
*hin Ethernet wiring scheme.
*hin Ethernet uses thin coa- cable that is cheaper and easier to install than thick Ethernet
coa-. 6n thin ethernet wiring scheme transceiver electronics are built into N6C and N6C
connect directly to network medium. Coa- cable use connector on N6C. Coa- runs
directly to back of each connected computer by *-connector. *he *-connector directly
attaches to N6C.
=ow can ,witched 1irtual Network be established:
2ost networks offer dynamic connections that last for a relatively short time. A*2 can
dynamically establish a switched virtual circuit ,1C that allows it as long as necessary
and then terminate it. *he computer sends a connection request to the switch to which it
is attached. ,oftware in the switch finds a path to the destination and sends with the
connection request. Each pair of switches in the path communicates to choose a 14651C6
for their tables. ;nce the connection is established by the destination than a message is
given back to the originating computer to indicate the ,1C is ready.
Describe permanent virtual circuits /41C0.
A*2 can provide the virtual circuits that look like traditional leased digital circuits. *he
permanent virtual circuits 41C works as long as the customer pays the periodic fee for its
use. *he forwarding table enter configured the terms used by *elco 4rovisioning requires
two steps.
*o determine a complete path.
*o choose appropriate 14651C6 for each step in the path and configures each adDacent
pair of switches.
9hat are default routes! draw the table.
"outing table entries can collapse with a default route. 6f destination doesnKt have in
e-plicit routing table entry and then it use a default route. 6t is shown in the below table.
Destination Ne-t
hop
Destination Ne-t
hop
Destination Ne-t
hop
Destination Ne-t
hop
& - ) - & 3!& ) $!)
V &!3 $ )!$ ) 3!) $ -
V )!3 3 - V $!3
$ 3!$
Node & Node ) Node 3 Node $
Z9hich type of information is obtained from network sniffer and in which mode Network
sniffer operates:
+olution:
A network analy>er also called network monitor or a network sniffer is used to e-amine
the performance of or debug a network. 6t can report statistics such as capacity utili>ation!
distribution of frame si>e! collision rate or token circulation time
2ost installations still use D6< Ethernet encoding in which there is no ..C5,NA4
header in the frame. A network analy>er can tell from the values in the type field /small
values are lengths! which mean an ..C5,NA4 header is located in the first octets of the
data areaN large values are types! which mean no ..C5,NA4 header is included0.
*he operation of network analy>er is a computer with a network interface that receives all
frames! which is called promiscuous mode. ,o many desktop computers have interface
that can be configured for promiscuous mode. 9hen combined with software computer
can e-amine any frame on .AN. 6n this way the communication across .AN is
guaranteed to be private. Computer receives and displays frames on the .AN.
Network analy>er can be configured to filter and process frames. 6t can count frames of
specific type of si>e. 6t displays only frames from or to specific computers.
Z Z Z Z Z Z Z Z Z Z*hick Ethernet!
*hin Ethernet and *wisted pair Ethernet.
+olution:-
Thick ;thernet:
*hick Ethernet! officially known as &' (ase-%! is the oldest form of Ethernet.
;ne form of cabling supported by Ethernet is low-loss %' ;hm coa-ial cable as shown in
the figure below. *his type of cable is '.%A diameter /usually supplied with a yellow outer
41C coating0 and rather infle-ible. 6t has become known in the communications industry
as A*hick EthernetA. *he official name for this cable is &' (aseband% /&'(%0! indicating
that it is specified for baseband communications at &' 2bps over distances up to %''m.
Thin ;thernet:
*hin Ethernet! officially called &' (ase-)! is a less e-pensive version of &' (ase-% /*hick
Ethernet0 technologies. 6t uses a lighter and thinner coa-ial cable and dispenses with the
e-ternal transceivers used with &' (ase-%.
&' (ase-) uses an "8-%MA57 coa-ial cable and is wired in a bus topology. Each device
on the network is connected to the bus through a (NC A*A adapter! and each end of the
bus must have a %' ;hm terminator attached. Each node on the bus must be a minimum
of '.% meters /&.% feet0 apart! and the overall length of the bus must be less than &M%
meters /H'H feet0.
T"isted Pair ;thernet:
*wisted 4air Ethernet /&'base*0! sometime also called A7*4A from A7nshielded *wisted
4airA! is based on using a cable similar to phone-wiring. *he cable is connected via "#-$%
connectors to the network card installed in the 4C.
SubCect" routing
&outing o0 a packet 0rom source to !estination !oes not !epen! on source a!!ress o0 a packet. Sir, what
whoul! be the a!vantages o0 this in#!epen!ency. 5
@
#
Answer"#
.et hop to !estination !oes not !epen! on source o0 packet. This phenomenon is calle! OSource
%n!epen!enceI. %t has several bene0its. %t allows 0ast an! e00icient routing.
'acket switch nee! not hove complete in0ormation about all !estinations in spite it Cust has net hop so
re!uces total in0ormation an! increases !ynamic robustness. The network can continue to 0unction even i0
topology changes without noti0ying entire network.
SubCect" multicast
why the internet multicast routing is !i00icult5
@
#
Answer"#
%nternet multicast routing is !i00icult because internet multicast allows arbitrary computer to Coin multicast
group at any time. %t allows arbitrary member to leave multicast group at any time. %t also allows arbitrary
computer to sen! message to a group <even i0 not a member=.
Question"#"
SubCect" collisions in network
Sir, can network be totally protecte! 0rom collisions with the help o0 eponential back o005
@
#
Answer"#
EL'F.E.T%A- HA() F++
%t re!uces likely hoo! o0 seAuence o0 collision.
SubCect" tcp7ip
T('7%' supports !i00erent approaches o0 a!!ress resolution algorithm in a real environment. Sir, what are
their names5
@
#
Answer"#
A!!ress &esolution TechniAues
A!!ress resolution algorithms can be groupe! into three basic categories"
P Table lookup
P (lose!#0orm computation
P Message Echange
Question"#"
SubCect" .AT
Suppose an organization wants to share the transmission o0 multiple !evices o0 its network with single
publicly routable %' a!!ress. To achieve this goal it uses .AT. Sir it is reAueste! to tell what woul! be the
alternative o0 .AT. 55
@
#
Answer"#
.A'T <.etwork A!!ress an! 'ort Translation= or T(' Slicing
T/%(E .AT
(AT
Question"#"
SubCect" gateway
&eliability is the base nee! o0 communication systems but some gateway protocols are consi!ere!
unreliable. Sir it is reAueste! to convey us which gateway protocol is unreliable protocol 0or transportation o0
messages5
@
Answer"#
/e have unreliable transmission in &outing %n0ormation 'rotocol <&%'=.
Question"#"
SubCect" A&'
Suppose in a computer network o0 multinational company, network a!ministratorIs system receives some
A&' messages while communication with other system. (onsi!ering this scenario Sir it is reAueste! to to tell
how !oes system !eal these incoming A&' messages5
@
Answer"#
/hen an A&' message arrives, the protocol speci0ies that the receiver must per0orm two basic steps.
+irst the receiver etracts the sen!erIs a!!resses bin!ing an! checks to see i0 it is present in the cache. %0 not,
it up!ates the cache.
The receiver eamines the operation 0iel! o0 the message to !etermine whether the message is a reAuest or
a response. %0 the message is a reAuest, the receiver compares the 0iel! TA&6ET 'ABB& with the local
protocol a!!ress. %0 the two are i!entical, the computer is the target o0 the reAuest an! must sen! an A&'
response.
Question"#"
SubCect" multicast
#
Answer"#
Several multicast protocols eist. Some o0 the propose! protocols are"
Bistance ?ector Multicast &outing 'rotocol <B?M&'=
(ore Hase! Trees <(HT=
'rotocol %n!epen!ent Multicast8 Sparse Mo!e <'%M#SM=
'rotocol %n!epen!ent Multicast 8 Bense Mo!e <'%M#BM=
Multicast Etensions to the Fpen Shortest 'ath +irst 'rotocol <MFS'+=
Question"#" >;
SubCect" MG-T%(AST%.6
.
@
Answer"#
Question"#" >:
SubCect" &FGT%.6
&outing is a key 0eature o0 networking because it can per0orm more comple analysis to !etermine the
optimal path 0or the packet an! eventually reach the target machine. /hat is meant o0 source in!epen!ence
in routing an! how it can be valuable 0or routing5
@
Answer"#
.et hop to !estination !oes not !epen! on source o0 packet. This phenomenon is calle! OSource
%n!epen!enceI. %t has several bene0its. %t allows 0ast an! e00icient routing.
'acket switch nee! not hove complete in0ormation about all !estinations in spite it Cust has net hop so
re!uces total in0ormation an! increases !ynamic robustness. The network can continue to 0unction even i0
topology changes without noti0ying entire network.
Question"#" >4
SubCect" MG-T%'-E TE(1F-F6%ES
write multiple technologies in networking 0iel! where change in routing table can happen 0reAuentlyN !oes a
router in the global %nternet can still use static routing5
@
Answer"#
%magine a small organization that is a customer o0 only an %S'. <.ot have multiple internet connections=, All
tra00ic leaving the customerIs site through router must travel to the %S'. Hecause route never changes, the
routing table in router o0 customer can be static.
Question"#"
SubCect" %' BATA6&AM
%' !atagram 0ormat is same as a har!ware 0rame 0ormat. (an network engineer change the size o0 %'
!atagram hea!er5<
@
Answer"#
.o, %' !atagram 0ormat is not same as har!ware 0rame 0ormat. .etwork engineer canIt change the size o0
hea!er because hea!er area is usually 0ie! size.
Question"#" >3
SubCect" (-%E.T SE&?E&
%n (lient#Server interaction, i0 no signal is given, how cans an application has arrive!5
@
#
Answer"#
%nstea! 0or waiting 0or an arbitrary message to arrive, an application that accepts communication must
interact with protocol so0tware be0ore an eternal source attempts to communicate.
Question"#" >9
SubCect" '&FTF(F-
/hich protocol is use! that can hol! !ata in bu00er in both !irections sent an! receive! both5
@
#
Answer"#
This service is provi!e! by Transmission (ontrol 'rotocol <T('=. %n T(' a connection can be use! to carry !ata
in both !irections, that is, it is M0ull !upleM.
Question"#" >2
SubCect" MG-T%(AST &FGT%.6
/hat are multicast routing protocols5
@
#
Answer"#
A stan!ar! protocol eists that allows a host to in0orm a nearby router whenever the host nee!s to Coin or
leave a particular multicast group known as %nternet 6roup Multicast 'rotocol <%6M'=.
Question"#" >1
SubCect" %'?4
/hat is Etension 1ea!er in %pv4 an! why they use5
@
#
Answer"#
The control in0ormation in %'v4 packets is sub!ivi!e! into a man!atory 0ie! hea!er an! optional etension
hea!ers. Etension hea!ers carry optional %nternet -ayer in0ormation, an! are place! between the 0ie!
hea!er an! the upper#layer protocol hea!er.
Question"#" ;>
SubCect" MG-T%(AST &FGT%.6
why the %nternet Multicast &outing is !i00icult 5
@
#
Answer"#
%nternet multicast routing is !i00icult because internet multicast allows arbitrary computer to Coin multicast
group at any time. %t allows arbitrary member to leave multicast group at any time. %t also allows arbitrary
computer to sen! message to a group <even i0 not a member=.
Hottom o0 +orm
tu!entQs Message" ;;
SubCect" MTG
%0 %' !atagrams are larger than MTG which mechanism will be use! to han!le it by the routers5
@
#
Answer"#
%' uses 0ragmentation i.e. !atagrams can be split into pieces to 0it in network with small MTG.
&outer !etects !atagram larger than network MTG an! then it splits into pieces an! each piece is smaller
than outboun! network MTG. &outer has local MTG to compute size o0 each 0ragment. %t puts part o0 !ata
0rom original !atagram in each 0ragment an! puts other in0ormation into hea!er.
Question"#" ;:
SubCect" ip hea!er
/hich 0iel! is use! to a!! options into %' hea!er5
@
#
Answer"#
Several options can be a!!e! in %' options 0iel!.
Question"#" ;4
SubCect" protocol
/hich protocol is use! that can hol! !ata in bu00er in both !irections sent an! receive! both5 2
@
#
Answer"#
T(' uses win!ow mechanism to control the 0low o0 !ata. The amount o0 bu00er space available at any time is
calle! the win!ow an! a noti0ication that speci0ies the size is calle! the win!ow a!vertisement.
Question"#" ;5
SubCect" tcp
/hat T(' mechanism will be use! 0or reliable transmission an! which term is use! to manage lost packets5
@
#
Answer"#
T(' achieves reliability by retransmission. An acknowle!gement is use! to veri0y that !ata has arrive!
success0ully. %0 acknowle!gement !oes not arrive, the previous !ata is retransmitte!.
Question"#" ;3
SubCect" tcp
/hich T(' process will be use! to troubleshoot the network having remote sit connecte! to multiple sites5
@
#
Answer"#
The %nternet (ontrol Message 'rotocol <%(M'= is one o0 the core protocols o0 the %nternet 'rotocol Suite. %t is
use! by the operating systems o0 networke! computers to sen! error messages in!icating, 0or eample, that
a reAueste! service is not available or that a host or router coul! not be reache!. %(M' can also be use! to
test !i00erent tools. An %nternet host A, is reachable 0rom another host H, i0 !atagrams can be !elivere! 0rom
A to H. 'ing program tests reachability. %t sen!s !atagram 0rom H to A, which echoes back to H. it uses %(M'
echo reAuest an! echo reply messages. %nternet layer inclu!es co!e to reply to incoming %(M' echo reAuest
messages.
Question"#" ;9
SubCect" T&FGH-ES1FT%.6
S%&,
/1%(1 TF'F-F6E %S HETTE& +F& AGTFMAT%( T&FGH-ES1FFT%.655
@
#
Answer"#
+BB% <+iber Bistribute! Bata %nterconnect= is better 0or automatic troubleshooting.
Question"#" ;2
SubCect" T&FGH-ES1FTT%.6
/hat protocol is use! 0or .etwork Troubleshooting. 5
@
#
Answer"#
%(M' is use! 0or this purpose.
Question"#" ;1
SubCect" &FGT%.6 TAH-E
/hy E6' !oes not use &outing Matric5
@
#
Answer"#
E6's !o not use routing matrices because
E6' !oes not attempt to choose an optimal path.
The E6' Cust 0in!s path.
An E6' cannot make meaning0ul comparison 0or optimal route.
Question"#" ;@
SubCect" -A.7/A.
%0 systems are 0ar away then what is best choice <-A.7/A.=. 5
@
#
Answer"#
/A. is the best choice in this case.
Question"#" :>
SubCect" GB'
/hat is the main purpose o0 GB' with a real time eample.
@
#
Answer"#
GB' is the 0irst o0 the transport protocols in T('7%' protocol suite. GB' protocol allows applications on the
computers to sen! an! receive !atagrams. GB' has a packet 0ormat. %t uses best#e00ort !elivery service.
Gser Batagram 'rotocol <GB'= is a protocol use! 0or transport o0 !ata across an %nternet 'rotocol <%'= base!
network. Gser Batagram 'rotocol <GB'= !oes not per0orm han!shaking as T(' !oes, or check 0or errors, or
even to see i0 the transmitte! !ata was receive!, so Gser Batagram 'rotocol <GB'= is re0erre! to as an
unreliable, connectionless protocol. 1owever, because Gser Batagram 'rotocol <GB'= skips the han!shaking
an! is 0ocuse! on pure transmission, Gser Batagram 'rotocol <GB'= has lower overhea! an! is thus 0aster
than T('. GB' will provi!e better throughput on a network where the physical an! !atalink layer protocols
are reliable.
Bomain .ame Service, Trivial +ile Trans0er 'rotocol an! Simple .etwork Management 'rotocol all use Gser
Batagram 'rotocol <GB'=.
A Gser Batagram 'rotocol <GB'= !atagram is encapsulate! within an %' !atagram an! there0ore is pre0ie!
with %' hea!er in0ormation.
@ : ; 15 14 29 23 91
R########R########R########R########R
S Source S Bestination S
S 'ort S 'ort S
R########R########R########R########R
S S S
S -ength S (hecksum S
R########R########R########R########R
S
S !ata octets ...
R################ ...
Question"#" :;
SubCect" E6'
/hat gateway protocol mostly use! as E6' with some properties.
@
#
Hor!er 6ateway 'rotocol <H6'= is most popular Eterior 6ateway 'rotocol in %nternet. %t has 0ollowing
characteristics"
P %t provi!es routing among autonomous systems <E6'=.
P %t provi!es policies to control routes a!vertise!.
P %t uses reliable transport <T('=.
P %t gives path o0 autonomous systems 0or each !estination.
P (urrently the E6' is o0 choice in the %nternet.
P %t provi!es 0acilities 0or Transit &outing.
Question"#" ::
SubCect" BE-AE
/hat type o0 Transport 'rotocol is use! when 'acket !ropping is pro00ere! than Belay.
@
#
Answer"#
GB' <Gser !atagram protocol= is use! in this case.
Question"#" :4
SubCect" %' BATA6&AM
/hat is the right place in %' Batagram 1ea!er to a!! etra options5
@
#
Answer"#
Several options can be a!!e! in %' options 0iel!.
SubCect" BE-AE
.etworking (omponents take sometime while 0orwar!ing !ata over network me!ium. %!enti0y the type o0
!elay
@
#
Answer"#
There are 0ollowing types o0 !elay"
'&F'A6AT%F. BE-AE"
%t !e0ine! as the time to travel across me!ium.
S/%T(1%.6 BE-AE"
%t is the time reAuire! 0or network component <hub, bri!ge, packet switch= to 0orwar! !ata.
A((ESS BE-AE"
%t is the time reAuire! to get control o0 me!ium <(SMA7(B, token=.
QGEG%.6 BE-AE"
%t is the time enAuire! in packet switches.
Question"#" :3
SubCect" FS'+
/hich characteristics FS'+ have5
@
#
Answer"#
+ollowing are the characteristics o0 Fpen Shortest 'ath +irst <FS'+="
1. To satis0y !eman! 0or a routing protocol that can scale to large organizations, the %ET+ !evise! an %6'
known as the Fpen Shortest 'ath
+irst 'rotocol <FS'+=.
2. FS'+ allows sub!ivision o0 Autonomous System into areas.
9. The link status in0ormation is propagate! within an area.
3. The routes are summarize! be0ore being propagate! to another area.
5. %t re!uces overhea! <less broa!cast tra00ic=.
4. Hecause it allows a manager to partition the routers an! networks in an autonomous system into multiple
areas
:. FS'+ can scale to han!le a larger number o0 routers than other %6's.
Question"#" :9
SubCect" A&'
.etwork a!ministrator receives some messages on his system. 1ow !oes computer !eal this incoming A&'
messages5<
@
#
Answer"#
+ollowing seAuence o0 steps will be per0orme!"
1. +irst the receiver etracts the sen!erIs a!!resses bin!ing an! checks to see i0 it is present in the cache.
2. %0 not, it up!ates the cache.
9. The receiver eamines the operation 0iel! o0 the message to !etermine whether the message is a reAuest
or a response.
3. %0 the message is a reAuest, the receiver compares the 0iel! TA&6ET 'ABB& with the local protocol
a!!ress.
5. %0 the two are i!entical, the computer is the target o0 the reAuest an! must sen! an A&' response.
Question"#" :2
SubCect" tcp
1ow congestion is controlle! by T('5<
@
#
Answer"#
T(' uses a number o0 mechanisms to achieve high per0ormance an! avoi! congestion collapse, where
network per0ormance can 0all by several or!ers o0 magnitu!e. These mechanisms control the rate o0 !ata
entering the network, keeping the !ata 0low below a rate that woul! trigger collapse. They also yiel! an
approimately ma#min 0air allocation between 0lows.
Acknowle!gments 0or !ata sent, or lack o0 acknowle!gments, are use! by sen!ers to in0er network
con!itions between the T(' sen!er an! receiver. (ouple! with timers, T(' sen!ers an! receivers can alter
the behavior o0 the 0low o0 !ata. This is more generally re0erre! to as congestion control an!7or network
congestion avoi!ance.
Mo!ern implementations o0 T(' contain 0our intertwine! algorithms" Slow#start, congestion avoi!ance, 0ast
retransmit, an! 0ast recovery <&+( 54;1=.
Question"#" :1
SubCect" snu00er
/hat are the operations o0 network snu00er
@
#
Answer"#
The basic i!ea behin! the operation o0 network analyzer <.etwork Sni00er= is a computer with a network
inter0ace that receives all 0rames, which is calle! promiscuous mo!e. Many !esktop computers have
inter0ace that can be con0igure! 0or promiscuous mo!e. /hen combine! with so0tware computer can
eamine any 0rame on -A.. %n this way the communication across -A. is guarantee! to be private. This
computer receives an! !isplays <but !oes not respon! to= 0rames on the -A.. .etwork analyzer can be
con0igure! to 0ilter an! process 0rames. %t can count 0rames o0 speci0ic type o0 size. %t !isplays only 0rames
0rom or to speci0ic computers. %n general it can be con0igure! to match any value o0 any 0iel! an! capture
only these 0rames meeting the 0ilter speci0ications.
Question"#" :@
SubCect" reachbility
1ow can we test any website 0or eample www.vu.edu.$k is reachable or not5
@
#
Answer"#
This is !one through '%.6 comman! 0or probing the %nternet.
Question"#" 4>
SubCect" protocol
which protocol is use! within organization.5 /hich protocol is use! to han!le tra00ic in computer network
over countries5
@
Answer"#
An autonomous system can be thought o0 as a set o0 networks an! routers un!er one a!ministrative
authority <organization=. %nterior 6ateway 'rotocol <%6'= is use! among routers within autonomous system
<organization=. +ollowing are the %nternet routing protocols"
Hor!er 6ateway protocol
&outing %n0ormation 'rotocol
Fpen Shortest 'ath +irst 'rotocol
+or secure !ata communication in an organization ?irtual 'rivate .etwork <?'.= is use!.
8ermalink 7e$ly by maria mcs on .uly 2/& 293; at 32!3:$m

(urrent +inal Term 'aper
Total Questions T 52
Total Marks T ;@
Total 1 Mark M(Q T 3@
Total 2 Marks Short Questions T 3
Total 9 Marks Short Questions T 3
Total 5 Marks -ong Questions T 3
1. 888888888888888was especially most concerne! about lack o0 highly powere! computer.
a= A&'A
b= %EEE
c= E%A
!= 'TA
2. 8888888has no way to !etermine the cause o0 problem
a= %(M'
b= A&'
c= 'ing
!= Traceroute
9. Ethernet stan!ar! speci0ies that 0rame was sent using the 88888888888888
a= Manchester enco!ing
b= .on return to zero
c= &eturn to zero
!= Bi00erential Manchester
3. (omputer attache! to Ethernet use 888888 in which a computer waits the other to be i!le be0ore
transmitting a 0rame
a= (SMA7(B
b= (SMA7(A
c= Token ring
2 marks Auestion
31" .etwork classi0ie! by size5
Answer" -A.
/A.
32" As %T stu!ent !o you think that common networking tool such as 'ing will work with %'v45
39" /hich .AT variant 0ails i0 application uses %' A!!ress instea! o0 Bomain5 2 marks
Answer" twice .AT
33" why multicasting 0or internet is !i00icult5 'age 132
Answer" %nternet multicast routing is !i00icult because internet multicast allows arbitrary computer to Coin
multicast group at any time. %t allows arbitrary member to leave multicast group at any time. %t also allows
arbitrary computer to sen! message to a group <even i0 not a member=.
9marks Auestion
35" Make .etwork o0 : computers. /hich is best suitable topology i0 !eman! is that the network must be
centrally manageable5 $usti0y it with 3 possible a!vantages.
34" %'v4 notation5
3:" 'acket lost. 1ow to overcome such tra00ic situation5 (onseAuence 0ace i0 it is not resume! care0ully5 'age
12;
Answer" The goal o0 congestion control is to avoi! a!!ing retransmissions to an alrea!y congeste! network.
&e!ucing the win!ow size Auickly in response to the lost messages !oes it. %t is assume! that loss is !ue to
congestion.
/e have to resume care0ully. Ftherwise the network will swing wil!ly between congestion an! un!er
utilization.
3;" &eason. /hich 6ateway protocol has characteristics o0 unreliable transport5
Answer" &%' has characteristics o0 unreliable transport. An! reason is because it uses GB'. 'age19;
5 marks Auestion
3>" which approach o0 error !etection is able to !etect more errors as compare! to others5 (onsi!ering that
there shoul! be no increase in the size o0 in0ormation being transmitte!. Eplain how it works5
5@" Assume a multinational organization has very large computer network across the country. .etwork
engineer is given a task to con0igure a protocol to manage routing in0ormation in this network. %n this
scenario which protocol will be con0igure!5 Hrie0ly eplain proper reason.
Answer" H6' is best 0or large network across country. &easons are its characteristics. 'age 19;
51" %n real worl!, usually private %' a!!ress interacts with global internet. %n this situation, !iscuss which type
o0 !evice will be use! to han!le the tra00ic. Eplain working with proper steps.
52" &eliability is responsibility o0 which layer in T('7%'. /hich protocol is !esigne! to provi!e reliable
transport service an! why reliability is nee!e!5 'age 129
Answer" T1E .EEB +F& &E-%AH-E T&A.S'F&T"
&eliability is 0un!amental in a computer system. So0tware in the %nternet must provi!e the same level o0
reliability as a computer system. So0tware must guarantee prompt an! reliable communication without any
loss, !uplication, an! change in the or!er.
T&A.SM%SS%F. (F.T&F- '&FTF(F-"
&eliability is the responsibility o0 the Transport layer. %n T('7%', T(' provi!es reliable transport service. Most
%nternet applications use T(' as no other protocol has prove! to work better.
SE&?%(E '&F?%BEB HE T('"
+ollowing are the services provi!e! by T('"
P (onnection#oriente! service
P 'oint#to#point
P (omplete reliability
P +ull#!uple communication
P Stream inter0ace
P &eliable connection startup
P 6race0ul connection shut!own
Question" /hat is 1@base T5
Solution"
An Ethernet stan!ar! 0or cable. The 1@ re0ers to its 1@ Mbps ban!wi!th, the
base to single channel baseban!, an! the T to Twiste! pair. The cable uses
two pairs o0 unshiel!e! twiste! wires
1@HASE#T"
This is another stan!ar! o0 wiring scheme. %t is commonly calle! 1@Hase#T,
Twiste! 'air or T' Ethernet. %t replaces AG% cable with twiste! pair cable
an! thick coa with hub. This makes it cheaper an! that Os why it is most
use0ul technology o0 to!ay. %t is shown in the 0igure below"
Ethernet over twiste! pair re0ers to the use o0 cables that contain insulate!
copper wires twiste! together in pairs 0or the physical layer o0 an Ethernet
networkUthat is, a network in which the Ethernet protocol provi!es the !ata
link layer.
Question" /hat is Multicasting5
Solution"
Multicast is communication between a single sen!er an! multiple receivers
on a network.
%t works like broa!casting however it !oes not 0orwar! 0rames automatically
to the ('G. The inter0ace har!ware is programme! in a!vance to accept
certain 0rames that have multicast a!!ress as the !estination a!!ress. %0 an
application program wishes to receive certain 0rames then it program the
inter0ace har!ware to accept an a!!itional set o0 a!!resses.
Question" /hat is +BB%5
Solution"
+BB%" +iber !istribute! !ata interconnect <+BB%= is another ring technology.
%ts most important 0eatures are"
%t uses 0iber optics between stations an! transmits !ata at 1@@Mbps.
%t uses pair o0 0ibers to 0orm two concentric rings.
The +iber Bistribute! Bata %nter0ace <+BB%= speci0ies a 1@@#Mbps tokenpassing, !ual#ring -A. using 0iber#optic cable.
+BB% is 0reAuently use! as

high#spee! backbone technology because o0 its support 0or high ban!wi!th
an! greater !istances than copper.
+BB% uses a !ual#ring architecture with tra00ic on each ring 0lowing in
opposite !irections <calle!counter#rotating=. The !ual#rings consist o0 a
primary an! a secon!ary ring. Buring normal operation, the primary ring is
use! 0or !ata transmission, an! the secon!ary ring remains i!le.
Question" Be0ine ;@2.11 /ireless lans an! (SMA5
Solution"
;@2.11 an! ;@2.11 re0ers to a 0amily o0 speci0ications !evelope! by
the %EEE0or wireless -A. </-A.= technology. ;@2.11 speci0ies an overthe#air inter0ace between a wireless client an! a
base station or between two
wireless clients.
;@2.11 /%&E-ESS -A.s A.B (SMA7(A" %EEE ;@2.11 is stan!ar!
wireless -A. that uses ra!io signals at 2.361z. %ts !ata rate is 11Mbps. The
ol!er !evices use ra!io signals at >@@M1z an! !ata rate o0 2Mbps.
Hluetooth speci0ies a wireless -A. 0or short !istances. %t uses share!
me!ium an! ra!io waves instea! o0 coaial cable.
(SMA7(A" /ireless uses collision avoi! ness rather than collision
!etection. Transmitting computer sen!s very short message to receiver.
&eceiver respon!s with short message reserving slot 0or transmitter. The
response 0rom receiver is broa!cast, so all potential transmitters receive
reservation.
Question" Be0ine Static V Bynamic &outing 2 Marks
Question" BiCkartQs Algorithm 2 Marks
Solution"
(FM'GT%.6 S1F&TEST 'AT1 %. A 6&A'1"
/hile computing shortest path, 0irst we assume graph representation o0
network at each no!e then we use BCikstraIs algorithm to compute shortest
path 0rom each no!e to every other no!e. Then etract net hop in0ormation
0rom resulting path in0ormation an! insert net hop in0ormation into routing
tables. /E%61TEB 6&A'1"
BCikstraIs algorithm can accommo!ate weights on e!ges in graph. The
shortest path is then the path with lowest total weight <sum o0 the weight
with all e!ges=. %t shoul! be note! that the shortest path is not necessarily
with 0ewest e!ges <or hops=.
Question" /rite note on Hri!ges 5 Marks
Question" Bisa!vantages o0 &epeaters 9 Marks
Solution"
B%SAB?A.TA6ES F+ &E'EATE&S"
&epeaters !o not recognize 0rame 0ormats, they Cust ampli0y an! retransmit
the electrical signal. %0 a collision or error occurs in one segment, repeaters
ampli0y an! retransmit also the error onto the other segments.
Bi00erent b7w (ells an! 'ackets 5 Marks
Solution"
ATM (E--S"
To meet its goals, ATM uses small, 0ie! size! packets calle! cells. Each
cell has 59 octets. ?'%7?(% 0iel!s i!enti0y the cells !estination.
(F.(E'T F+ O'A()ETI"
.etwork systems !ivi!e !ata in small blocks or Cunks calle! packets, which
they sen! in!ivi!ually.
Iuestion No/ 1 = ! 8 1 ) .
In "oint8to8"oint topology there are two topologies.
Star and Tree
Tree and Ring
Star and Ring
Star and Tree
None of the given

1) STAR topology

2) TREE topology
Iuestion No/ 2 = ! 8 1 ) .
888888 "rogra# sends a #essage to a re#ote co#puter and reports whether the
co#puter responds.
Ping
Traceroute
I!"
Non of the given
"ing progra# tests reach a$ility. It sends datagra# fro# % to A& that echoes $ac'
to %. it uses I!" echo re(uest and echo reply #essages.
Iuestion No/ 6 = ! 8 1 ) .
888888 has no way to deter#ine the cause of the pro$le#.
I!"
Ping
Trace route
Non of the given
"ing has no way to deter#ine the cause of the pro$le#. Tracing A Route Networ'
ad#inistrators use another tool& trace route.
Iuestion No/ 5 = ! 8 1 ) .
The ter#88888 8888888 refers to the general concept of a s#all $loc' of data
Pa!&et
)ra#e
*ata
None of the given
"ac'et is a generic ter# that refers to s#all $loc' of data. "ac'et have different
for#at. Each hardware uses different pac'et for#at.
Iuestion No/ : = ! 8 1 ) .
8888888888 sche#e& which is designed to help detect trans#issions errors& send one
e+tra $it of infor#ation with each character

"arity
hec'su#s
R
None of given
A parity sche#e& which is designed to help detect trans#ission errors& sends one
e+tra hit of infor#ation with each character. Although it allows receiver to
deter#ine if a single $it has $een changed parity can not detect trans#ission errors
that change an even nu#$er of $its.
Iuestion No/ 4 = ! 8 1 ) .
,ocal Tal' is a ,AN technology that e#ploys 8888888888888
%us topology
Ring topology
Star topology
None of the given
,-A, TA,./
Apple invented the ,AN technology that uses $us topology. Its interface is included
with all !acintosh co#puters.
Iuestion No/ < = ! 8 1 ) .
!ost ,ANs that e#ploy ring topology use an access #echanis# 'nown as8888888
S!A0*
S!A0A
T-.EN "ASSIN?
None of the given
!ost ,ANs that e#ploy ring technology use an access #echanis# 'nown as token
passing . A to'en ring operates as a single& shared #ediu#. 1hen a co#puter
wants to send data& it #ust wait until it o$tains the to'en& when it is in control of
the ring
www.vu2s.net0
Iuestion No/ 7 = ! 8 1 ) .
Ethernet uses a 888888 $it static addressing sche#e in which each device is assigned
a uni(ue address $y the #anufacturer.
45
57
62
7
Ethernet uses a 578$it static addressing sche#e
Iuestion No/ F = ! 8 1 ) .
)or#ally na#ed RRRRRRRRRR infor#ally 'nown as the thic' wire Ethernet or Thic'
net.
19 %ase 2
19 -ase '
19 %ase T
None of the given
Thick 5thernet& officially known as 39 0ase 4& is the oldest form of 5thernet. It was originally develo$ed
in the late 3=>91s by #igital 5%ui$ment <or$oration& I0)& and Lero& and became an international
standard *I555 292.;- in 3=2;.
Taken from http://www.maznets.com/tech/10base-5.htm
Iuestion No/ 19 = ! 8 1 ) .
)or#ally na#ed RRRRRRRRRR infor#ally 'nown as the twisted pair Ethernet or T"
Ethernet.
19 %ase 2
19 %ase :
19 %ase T
None of the given
)or#ally called 19 %ase ;T
Also twisted pair Ethernet or si#ply T" Ethernet
www.vu2s.net0
Iuestion No/ 11 = ! 8 1 ) .
The #a+i#u# si2e of an Ethernet seg#ent isRRRRRRRRRRR

2:9 #eters
'99 eters
<99 #eters
None of the given
-ne Ethernet ca$le is so#eti#es called a seg#ent. This seg#ent is li#ited to :99
#eters in length. The #ini#u# separation $etween connections is 6 #eters. =">
2<)
Iuestion No/ 12 = ! 8 1 ) .
A %ridge can RRRRRRRR
)ilter a fra#e
)orward a fra#e
E+tend a ,AN
;o all the a$o4e
A $ridge is a hardware device also used to connect two ,AN seg#ents to e+tend a
,AN. It listens to all traffic and recogni2es fra#e for#at. It also forwards only
correct co#plete fra#es and discards the collided and error fra#es.

The #ost i#portant tas' a $ridge perfor#s is fra#e filtering.
Iuestion No/ 16 = ! 8 1 ) .
RRRRRRR co#putes shortest paths in a graph $y using weights on edges as a
#easure of distance.
?reedy algorith#
*istance vector algorith#
*i@'staSs algorith#
Non of the given
*i@'stras algorith# co#putes shortest paths in a graph $y using weights on edg as
a #easure of distance. A path with the fewest nu#$er of edges #ay not $e the
path with least weight. ="> 1<6 e8$oo's)

Iuestion No/ 15 = ! 8 1 ) .
RRRRRRRRRRis used for co#pressed audio and video where the data rate depends
on the level of co#pression that can $e achieved.
onstant %it Rate =%R) service
>aria$le -it ?ate (>-?) ser4i!e
Availa$le %it Rate =A%R) service
None of the given

AARIA%,E %IT RATE =A%R)/

It is used for co#pressed audio and video where the data rate depends on the level
of co#pression that can $e achieved.
www.vu2s.net0
Iuestion No/ 1: = ! 8 1 ) .
%asic ,AN technologies such as Ethernet& To'en Ring& and )**I use a RRRRR.

@onne!tionless ser4i!e paradig
onnection8oriented service paradig#
%oth onnectionless and onnection8oriented service paradig#
None of the given
%asic ,AN technologies such as Ethernet, Token Ring, and FDDI use
a connectionless service paradig#. Although a co#puter needs to wait for access to
a shared #ediu# $efore sending a pac'et
=2h&vu2s&nov19)
Iuestion No/ 14 = ! 8 1 ) .
The product of delay and throughput #easures the RRRRR of data that can
$e present on the networ'.
Area
>olue
,ength
None of the given
*E,AB TCR-D"DT "R-*DT/

It is co#puted as delay ti#e #ultiplied $y effective throughput. It #easures

a#ount of data that can $e present in the networ' ="> 79)
Iuestion No/ 1< = ! 8 1 ) .
A networ' with throughput T and delay * has a total of RRRRRRRR $it in transit at
any ti#e.
T 0 *
T ) ;
T E *
None of the given
A networ' with throughput T and delay * has a total of T + * $its in transit at
any ti#e. =e8$oo's)
Iuestion No/ 17 = ! 8 1 ) .
-ne repeater RRRRRRR& two repeaters RRRRRRRR the #a+i#u# ca$le length
li#itation.
dou$les( triple
s(uare roots& cude roots
and& triple
dou$les& cancel
-ne repeater dou$les& two repeaters triple the #a+i#u# ca$le length li#itation.
="> 5F)
Iuestion No/ 1F = ! 8 1 ) .
A networ' uses a 888888 if all co#puters attach to a central point
Star Topology
Ring Topology
%us Topology
None of the given
STAR T-"-,-?B/
In this topology& all co#puters are attached to a central point& which is so#eti#es
called the GCu$H ="> 2:)
Iuestion No/ 29 = ! 8 1 ) .
o#puters attached to an ethernet use 888888 in which a co#puter waits for the
other to $e idle $efore trans#itting a fra#e.

@SM,A@;
S!A0A
T-.EN "ASSIN?
None of the given
All co#puters attached to the Ethernet use S!A0* to co8ordinate their activities.
A co#puter wishing to trans#it chec's for electrical activity on the ca$le& infor#ally
called a carrier . If there is no carrier& the co#puter can trans#it. If a carrier is
present& the co#puter waits for the sender to finish $efore proceeding.

Cs 610 OBJSUb File

Diunggah oleh

Informasi Dokumen

Judul Asli

Hak Cipta

Format Tersedia

Bagikan dokumen Ini

Bagikan atau Tanam Dokumen

Opsi Berbagi

Apakah menurut Anda dokumen ini bermanfaat?

Apakah konten ini tidak pantas?

Hak Cipta:

Format Tersedia

Cs 610 OBJSUb File

Diunggah oleh

Hak Cipta:

Format Tersedia

Question No: 1 ( M - 1 ) .

In Point-to-Point topology there are two topologies.

of *C4564 layering model! corresponds to basic network hardware.

Question No: 22 ( Marks: 2 )

8ermalink 7e$ly by maria mcs on .uly 2/& 293; at 32!3:$m

Anda mungkin juga menyukai