Q1. Which one of the following is not a client server application?

(A) Internet chat (B) Web browsing (C) E-mail (D)Ping Ans$ D Explanation: Ping is %se& for 'nowing stat%s of a host b( another host$

C !"#"

PHYSICAL LAYER Q2.A serial transmission )i %ses * information bits+ ! start bits+ # stop bit an& # parit( bit foreach character$ A s(nchrono%s transmission )! %ses , eight bit s(nc characters followe& b( ,"eight bit information characters$ If the bit rate is #!"" bits-secon& in both cases+ what are thetransfer rates of )i an& )!? (A) #"" characters-sec+ #., characters-sec (B) *" characters-sec+ #,/ characters-sec (C) #"" characters-sec+ #,/ characters-sec (D)*"characters-sec+#.,characters-sec I)!""0 Ans.C Explanation: in serial transmission * bit of act%al &ata is present in *1!1#1#(2#!) bits of each transmission$ In one secon& #!"" bits are transferre&$ In #!"" bit onl( #!""3(*-#!) bits of act%al &ata is present+ o act%al transfer rate is #!""3(*-#!)2*"" bits 2#"" b(tes2#"" characters$ imilarl( in s(nchrono%s transmission act%al &ata rate is2#!""3(,"-,,) bps2#"4" bps2#,/ b(tes per secon&s$

Q3. $ In the waveform (a) given below+ a bit stream is enco&e& b( 5anchester scheme$ )he same bit stream is enco&e& in &ifferent co&ing scheme in waveform (b)$)he bit stream an& the co&ing scheme are6 (a)

M O C . S N A F R A B B GA
(b)

(a) #""""#"### an& &ifferential 5anchester respectivel($ (b) "####"#""" an& &ifferential 5anchester respectivel($ (c) #""""#"### an& integral 5anchester respectivel($ (&) "####"#""" an& integral 5anchester respectivel($ Ans. a Explanation: in 5anchester # " " " represents # an& " # represents "$ " # # # #

GABBARFANS.COM
o &ata is #""""#"#### an& for this &ifferential 5anchester enco&ing is # " " " " # " # # # #

DATA LINK LAYER Q4. In a &ata lin' protocol+ the frame &elimiter flag is given b( "###$ Ass%ming that bit st%ffing is emplo(e&+ the transmitter sen&s the &ata se7%ence "###"##" as (A) "##"#"## (B) "##"#"##" (C) "###"##"" (D)"##"#"##"" I)!""0 Ans. D Explanation: three consec%tive ones are %se& for &elimiter so whenever in &ata two consec%tive one comes st%ff a 8ero after them$ Data is "###"##" After st%ffing "##"#"##"" Q . Consi&er the following message 5 2 #"#"""##"#$ )he c(clic re&%n&anc( chec' (C9C) for this message %sing the &ivisor pol(nomial :. 1 :0 1 :! 1 # is6 (A) "###" (B) "#"##

(C) #"#"# (D)#"##"

I)!"".

Ans. A Explanation: generator pol(nomial is of &egree . so appen& . "s to the en& of &ata an& then &ivi&e new &ata b( generator pol(nomial$ :. 1 :0 1 :! 1 # 2##"#"# ##"#"#)#"#"""##"#"""""( ##"#"# "###"## ##"#"# ""###"#" ##"#"# ""#####" ##"#"#

GABBARFANS.COM
##"#"# "##""#" ##"#"# """###" 9emain&er is "###" Not!: if generator is divisible by x3+1 then CRC can detect all odd number of errors.

""#"##""

Q". )he message ##""#""# is to be transmitte& %sing the C9C pol(nomial :, 1 # to protect it from errors$ )he message that sho%l& be transmitte& is6 (A) ##""#""#""" (B) ##""#""#"## (C) ##""#"#" (D) ##""#""#""## C !""; Ans. B Explanation: :, 1 # is generator pol(nomial of &egree ,an& :, 1 # 2 #""# A&& three 8eros to the right of &ata+ new &ata is ##""#""#""" <ow &ivi&e new &ata b( generator pol(nomial #""#)##""#""#"""( #""# "#"## #""# ""#""" #""# """##""

GABBARFANS.COM
"#"#" #""# ""## 9emain&er is "##+ a&& this to the new &ata+ 5essage that sho%l& be transmitte& is ##""#""#"##
Common data for the Q7 and Q17 Frames of 1000 bits are sent over a 10^6 bps duplex link between two hosts. The propagation time is 25ms. Frames are to be transmitted into this link to maximall pa!k them in transit "within the link#

#""#

Q#. What is the minim%m n%mber of bits (l) that will be re7%ire& to represent the se7%ence n%mbers &istinctl(? Ass%me that no time gap nee&s to be given between transmissions of two frames$ (A) l2! (B) l2, (C) l20 (D) l2. C !""4 Ans. D Explanation: ):2#"""-#"/ secon&s2# ms 5a:im%m n%mber of frames that can be transmit to ma:imall( pac' them is2():1!)p)-): 2 (!.1#)-#2!/ which is win&ow si8e 5inim%m se7%ence n%mbers re7%ire& 2 !/ 5inim%m n%mber of bits re7%ire& for se7%ence n%mber is .$ Q1#. %ppose that the sli&ing win&ow protocol is %se& with the sen&er win&ow si8e of ! =+ where = is the n%mber of bits i&entifie& in the earlier part an& ac'nowle&gements are alwa(s pigg( bac'e&$ After sen&ing != frames+ what is the minim%m time the sen&er will have to wait before starting transmission of the ne:t frame? (I&entif( the closest choice ignoring the frame processing time$) (A) #/ms (B) #*ms (C) !"ms (D)!!ms C !""4 Ans.C Explanation: given Win&ow si8e is !=2!.2,! 5a:im%m frame that sen&er can transmit in one 9)) is !/+ when it is transmitting !; th frame it will get ac' for #st frame + imilarl( + when it is transmitting ,!th frame it will get ac' for /th frame$ After transmitting ,!th frame +sen&er have to wait %ntil ac'nowle&gement for !/th frame is arrive&$ Which is e7%als to (transmission time of !/ frame - transmission time of / frame)2 !" ms Q$. Consi&er a parit( chec' co&e with three &ata bits an& fo%r parit( chec' bits$ )hree of the co&e wor&s are "#"#"##+ #""##"# an& ###"""#$ Which of the following are also co&e wor&s? I$ ""#"### II$ "##"##" III$ #"##"#" I>$ "###"#" (A) I an& III (B) I+ II an& III (C) II an& I> (D) I+ II+ III an& I> I)!""0 Ans. D )his will be &isc%sse& in C? or DI@I)A= Q%.$ A broa&cast channel has #" no&es an& total capacit( of #" 5bps$ It %ses polling for me&i%m access$ ?nce a no&e finishes transmission+ there is a polling &ela( of *" micro secon&s to poll the ne:t no&e$ Whenever a no&e is polle& + it is allowe& to transmit a ma:im%m of #""" b(tes$ )he ma:im%m thro%ghp%t of broa& cast channel is (a) # 5bps (b) #""-## 5bps (c) #"5bp& (&) #"" 5bps I)!""; Ans. b

GABBARFANS.COM

Explanation: ):2#""" b(tes-#"5bps 2*""As$ Dela( beca%se of polling is 2 *" As Efficienc( of channel + e 2transmission &ela(- (total &ela() 2*""-(*""1*")2 #"-## 5a:im%m thro%ghp%t is 2(#"-##) 3 #" 5bps2 #""-## 5bps

Q1&$Which one of the following statements is BA= E? (A) Pac'et switching lea&s to better %tili8ation of ban&wi&th reso%rces than circ%it switching$ (B) Pac'et switching res%lts in less variation in &ela( than circ%it switching$ (C) Pac'et switching re7%ires more per pac'et processing than circ%it switching$ (D) Pac'et switching can lea& to reor&ering %nli'e in circ%it switching$ I)!""0 Ans. ' Pa()!t s*i(+in,- .!la/ 0a1iation is 2o1! 3!(a4s! o5 t+! sto1! an. 5o1*a1. 2!(+anis2.

GABBARFANS.COM

6lo* Cont1ol 7!(+anis2 in DLL Q11. tation A nee&s to sen& a message consisting of 4 pac'ets to tation B %sing a sli&ing win&ow (win&ow si8e ,) an& go-bac'-n error control strateg($ All pac'ets are rea&( an& imme&iatel( available for transmission$ If ever( .th pac'et that A transmits gets lost (b%t no ac's from B ever get lost)+ then what is the n%mber of pac'ets that A will transmit for sen&ing the message to B? (A) #! (B) #0 (C) #/ (D) #* C !""/ Ans. C Explanation: win&ow si8e is ,+so ma:im%m , pac'ets can be remaine& %nac'nowle&ge&$ In go bac' CnD if ac'nowle&ge for a pac'et is not receive& then pac'ets after that pac'et is also retransmitte&$ Brame se7%ence for 4 frame is shown below$ Brame with bol& se7%ence n%mber gets lost$ 1 2 3 4 " # " # $ % # $ % % Discar&e& pac'ets

Q12. Eost A is sen&ing &ata to host B over a f%ll &%ple: lin'$ A an& B+ are %sing the sli&ing win&ow protocol for flow control$ )he sen& an& receive win&ow si8e are . pac'ets each$ Data pac'ets ( sent onl( from A to B) are all #""" b(tes long an& the transmission time for s%ch a

pac'et is ."As$ Ac'nowle&gement pac'ets are ver( small (sent onl( from B to A) an& re7%ire ver( negligible time$ )he propagation &ela( over the lin' is !"" As$ What is the ma:im%m achievable thro%ghp%t in this comm%nication? (A) ;$/4 : #"/ b(tes per secon& (B) ##$## : #"/ b(tes per secon& / (C) #!$,, : #" b(tes per secon& (D) #.$"" : #"/ b(tes per secon& C !"", Ans$ B Explanation: )ransmission rate + ): is2 #""" b(tes- ." As2*"""bits -." As2#/" 5bps Efficienc(2 .3 ."-(."10"")2!."-0."2.-4 5a:im%m achievable thro%ghp%t2(.-4)3#/" 5bps2**$**5bps2##$## : #"/ b(tes per secon& Q13. Consi&er a #"" 'm long cable r%nning at #$.0 5bps at propagation spee& !C-, (i$e$ C is spee& of light2,3#"* meter-secon&)$ At ma: how man( bits can be fee& into the cable$

Ans$ ;;" bits Explanation6 propagation &ela( is 2 #"" 'm - (!C-,)2#".meter - (!3#"*meter - secon&) 2.3#"0 secon&s 2"$. ms 5a:im%m n%mber of bits(it is also calle& capacit( of a cable) that can be fee& into #"" m long cable is2#$.0 5bps 3"$. ms 2 ;;" bits

Q14. )he ma:im%m win&ow si8e for &ata transmission %sing the selective reFect protocol with n bit frame se7%ence n%mbers is6 (a) !n (b) !n-# (c) !n G # (&) !n-! C !"". Ans. b If the 7%estion is for sli&ing win&ow+ then option a If 7%estion is for @B<+ then option c Q1 . tation A %ses ,! b(te pac'ets to transmit messages to tation B %sing a sli&ing win&ow protocol$ )he ro%n& trip &ela( between A an& B is *" millisecon&s an& the bottlenec' ban&wi&th on the path between A an& B is #!* 'bps$ What is the optimal win&ow si8e that A sho%l& %se? (A) !" (B) 0" (C) #/" (D) ,!" C !""/ Ans. B Explanation: ):2 ,!b(tes- #!*'bps2,!3*-#!* ms2 !ms 9o%n& trip &ela( 2 ! 3 )p 2 *" ms(given) ?ptimal win&ow si8e is 2 ():1!)p)-): 2*! - ! 20#$ ?ption is not given+ closest option is 0"

GABBARFANS.COM

Q1". )he &istance between two stations 5 an& < is = 'ilometers$ All frames are H bits long$ )he propagation &ela( per 'ilometer is t secon&s$ =et 9 bits-secon& be the channel capacit($ Ass%ming that processing &ela( is negligible+ the minim%m n%mber of bits for the se7%ence n%mber fiel& in a frame for ma:im%m %tili8ation+ when the sli&ing win&ow protocol is %se&+ is6 (A) =og!((!=t91!')-') (B) =og!(!=t9-') (C) =og!((!=t91')-') (D) =og!((!=t91')-!') C !""; Ans. A Explanation: 5a:im%m win&ow si8e(Wma:)2 ():1!)p)-):$ Eere )p 2 =t (loo' at the %nits of propagation &ela() ):2 H-9 Wma:2():1!3)p)-): 2 (H-9 1 !=t) - (H-9)2(!=t91')-' =et minim%m n n%mber of bits re7%ire& then !n 2 Wma:2(!=t91!')-' n2log!((!=t91!')-')

Q1$. In a sli&ing win&ow A9I scheme+ the transmitterDs win&ow si8e is < an& the receiverDswin&ow si8e is 5$ )he minim%m n%mber of &istinct se7%ence n%mbers re7%ire& to ens%re correct operation of the A9I scheme is6 (A) min(5+<) (B) ma:(5+<) (C) 51< (D)5< I)!""0 Ans. 51<

Q1%. A !. Hbps satellite lin' has a propagation &ela( of 0"" ms$)he transmitter emplo(s the Jgo bac' n A9IK scheme with n set to #"$ Ass%ming that each frame is #"" b(tes long+ whatis the ma:im%m &ata rate possible? (A) . Hbps (B) #" Hbps (C) #. Hbps (D)!" Hbps I)!""0 Ans. B Explanation: ):2#""3* bits-!.Hbps2,! ms )p 2 0""ms+ a2)p-): 2 0""-,! 2 #!$. Efficienc( of @B< 2 W-(#1!a)+ where w2 win&ow si8e 2 #" 2 #"-(#1!.) 2 #"-!/ BW %tili8ation or thro%ghp%t or ma: &atarate 2 efficienc( 3 BW 2 (#"-!/) 3 !. It is nearl( #" Hbps Q2&. A channel has a bit rate of 0 'bps an& one-wa( propagation &ela( of !" ms$ )he channel%ses stop an& wait protocol$ )he transmission time of the ac'nowle&gement frame is negligible$ )o get a channel efficienc( of at least ."L+ the minim%m frame si8e sho%l& be (A) *" b(tes (B) *" bits

GABBARFANS.COM

(C) #/" b(tes (D) #/" bits

I)!"".

Ans. D Explanation: Efficienc( of stop an& wait 2 #-(#1!a) If #-(#1!a) 2 "$. 2M !3)p 2 ):$ 2M = 2 !3B3)p 2#/" bits Q21. ?n a wireless lin'+ the probabilit( of pac'et error is "$!$ a stop an& wait protocol is %se& to transfer &ata across the lin'$ )he channel con&ition is ass%me& to be in&epen&ent from transmission to transmission$ What is the average n%mber of transmission attempts re7%ires to transfer #"" pac'ets? (a) #"" (b) #!. (c) #." (&)!"" I)!""/ Ans. b Explanation: error rate "$! + In stop an& wait protocol sen&er will transmits #""3(#1"$!1"$!! 1"$!, 1"$!0 1NNNNN) pac'ets 2 #"" 3(#-(#-$"!))2#""-"$* 2 #!. (s%m of infinite @$P$ is a-(a-r))

7AC S43la/!1

GABBARFANS.COM

Q22. Which of the following is <?) tr%e with respect to a transparent bri&ge an& a ro%ter? (a) Both bri&ge an& ro%ter selectivel( forwar& &ata pac'ets (b) A bri&ge %ses IP a&&resses while a ro%ter %ses 5AC a&&resses (c) A bri&ge b%il&s %p its ro%ting table b( inspecting incoming pac'ets (&)A ro%ter can connect between a =A< an& a WA< C !""0 Ans. B Explanation: A bri&ge %se 5AC a&&resses(D== la(er) an& ro%ter %ses IP a&&resses (networ' la(er)$ Q23.Which of the following statements is BA= E regar&ing a bri&ge (A) Bri&ge is a la(er ! &evice (B) Bri&ge re&%ces collision &omain (C) Bri&ge is %se& to connect two or more =A< segments

(D) I)!"".

Bri&ge

re&%ces

broa&cast

&omain

Ans. D Bri&ge will not &iscar& D== broa&cast pac'ets+ so it cannot re&%ce BC &omain$ Q24. In a )D5 me&i%m access control b%s =A<+ each station is assigne& one time slot per c(cle for transmission$ Ass%me that the length of each time slot is the time to transmit #"" bits pl%s the en&-to-en& propagation &ela($ Ass%me a propagation spee& of !:#"*m-sec$ )he length of the =A< is # 'm with a ban&wi&th of #" 5bps$ )he ma:im%m n%mber of stations that can be allowe& in the =A< so that the thro%ghp%t of each station can be !-, 5bps is6 (A) , (B) . (C) #" (D)!" I)!"". Ans. C Explanation: Each slot is e7%als to transmission time of #"" bits 1 propagation &ela($ Propagation &ela(2#'m-!3#"*ms2 .As$ ): 2#""-#" 5bps2#"As$ =et there are ma:im%m < n%mber of station then =ength of c(cle is2<3(#"1.)2#.< As$ An& in a whole c(cle each %ser transmit for onl( #"As$ )herefore efficienc( is (#"-#.<) o thro%ghp%t of each station is (#"-#.<)3#"5bps which is given as !-, 5bps <2(#"3#"3,) - (#. 3!)2#"

Q2 . )here are n stations in a slotte& =A<$ Each station attempts to transmit with a probabilit( p in each time slot$ What is the probabilit( that ?<=O one station transmits in a given time slot? (A) np(#-p)n-# (B) (#-p)n-# (C)p (#-p)n-# (D)#- (#-p)n-# C !""; Ans. A Explanation: A station can transmit onl( when all other stations(n-# stations) are i&le$ Each station attempts with probabilit( 2p Probabilit( of a station for not attempting to transmit is 2#-p Probabilit( when n-# station are not transmitting2 (#-p)n-# Probabilit( when all other n-# station are not transmitting an& one partic%lar station is transmitting2 p(#-p)n-# )his probabilit( is for all n station$ )he probabilit( that ?<=O one station(an( station co%l& be the l%c'( one) transmits in a given time slot is 2 np(#-p)n-# Q2"$ Consi&er a simplifie& time slotte& 5AC protocol+ where each host alwa(s has &ata to sen& an& transmits with probabilit( p2"$! in ever( slot$ )here is no bac' off an& one frame can be transmitte& in one slot$ If more than one host transmits in the same slot+ then the transmissions are %ns%ccessf%l &%e to collision$ What is the ma:im%m n%mber of hosts

GABBARFANS.COM

whichthis protocol can s%pport+ if each host has to be provi&e& a minim%m thro%ghp%t of "$#/ frames per time slot? (A) # (B) ! (C) , (D)0 I)!""0 Ans. B Explanation: each host have thro%ghp%t of $#/ frames per time slot$ If there are n host then total thro%ghp%t will be "$#/n + which is probabilit( at which a frame can transmit s%ccessf%ll($ o b( the form%la in previo%s 7%estion np(#-p)n-# 2"$#/n n 3 "$! 3 ("$*)n-# 2"$#/n n2! satisf( above con&ition$ Q2#.)he minim%m frame si8e re7%ire& for C 5A-CD base comp%ter networ' r%nning at # @bps on !"" m cable with a lin' spee& of ! : #"* m-s is (a) #!. b(tes (b) !." b(tes (c) ."" b(tes (&) none of these I)!""* Ans. b Explanation: Pse ):2!)p

Q.2$A an& B are the onl( two stations on an Ethernet$ Each has a stea&( 7%e%e of frames to sen&$ Both A an& B attempt to transmit a frame+ colli&e+ an& A wins the first bac'off race$ Atthe en& of this s%ccessf%l transmission b( A+ both A an& B attempt to transmit an& colli&e$ )he probabilit( that A wins the secon& bac'off race is (a) "$. (b) "$/!. (c) "$;. (&)#$" C !""0 Ans. b Explanation: Sol0!. it in t+! (lass. Q2%. # 'm long #" 5bps C 5A-CD =A< has propagation spee& !""m-As+ &ata frame is !./ bit long incl%&ing ,! bits of hea&er +chec's%m an& other$ )he first big slot after s%ccessf%l transmission is reserve for a receiver to capt%re channel an& to sen& ,! bit of ac'nowle&gement $ What is effective &ata rate e:cl%&ing overhea& an& ass%ming there is no collision$ Ans6 olve it if (o% can+ else forget it$ Hee&a hai$ <ot a @A)E 7%estion Q3&. A networ' with C 5A-CD protocol in the 5AC la(er is r%nning at # @bps over a # 'm cable with no repeaters$ )he signal spee& in the cable is !:#"*m-sec$ )he minim%m frame si8e for this networ' sho%l& be

GABBARFANS.COM

(A) #"""" bits (B) #"""" b(tes (C) .""" bits (D).""" b(tes

I)!"".

Ans. A Explanation: )p2(#'m)-( ! : #"*m-s)2.: #"-/ econ&s =et is minim%m pac'et si8e 5inim%m frame si8e can be fo%n& b( form%la ):2!)p -#@bps 2 !3.3#"-/ 2#"4 : #"-. 2#"0 bits

Q31. A !'m long =A< has #"; bps ban&wi&th an& %sers C 5A-CD$ )he signal travels along the wire at ! : #"* m-s$ What is the minim%m pac'et si8e that can be %se& on this networ'? (A) ." b(tes (B) #"" b(tes (C) !"" b(tes (D) none of the above C !"", Ans. D Explanation: minim%m pac'et si8e for a C 5A-CD =A< is is the frame which cover whole 9))(ro%n& trip time)$i$e$ ):2!)p )p2! : #",-(! : #"*) secon&s2 #"-. secon&s =et = bits be minim%m si8e of frame+ then ):2 -#"; secon&s ):2!)p -#"; 2 ! : #"-. 2!"" bits 2(!"" - *) b(tes Q32. %ppose the ro%n& trip propagation &ela( for a #" 5bps Ethernet having 0*-bit Famming signal is 0/$0 ms$ )he minim%m frame si8e is6 (a) 40 (b) 0#/ (c) 0/0 (&) .#! C !"". Ans. c Explanation: 9o%n& trip propagation &ela( is !3)p 5inim%m frame si8e of Ethernet can be fo%n& b( %sing form%la ):2!3)p$ =et = is minim%m frame si8e then =-#"5bps 2 0/$0 ms 20/0 Hbits It has nothing to &o with Famming signal$$

GABBARFANS.COM

Q33. Consi&er a 05bps to'en ring having to'en hol&ing time #"ms$ What is the si8e of longest frame that can be sen& on ring$ is write ans Ans. 0"Hbits 4000 bits Explanation: if to'en hol&ing time is #"ms then a %ser can transmit onl( for #" ms+ ma:im%m time till it can hol& to'en$ In # ms a %ser can transmit 05bps3 #"ms203#"/bits per secon&3 #"3#"-, secon&s2 03#"0 bits20" Hbits$ Q34. Consi&er a . 5bps to'en ring with propagation spee& !"" m-As$ Eow m%ch length of cable is occ%pie& b( # bit$ Ans. 0" meter Explanation: convert bit to meters$$ &ivi&e b( ban&wi&th an& m%ltipl( with velocit( Q3 . Consi&er a #" 5bps to'en ring =A< with a ring latenc( of 0""As$ A host that nee&s to transmit sei8es the to'en$ )hen it sen&s a frame of #""" b(tes+ removes the frame after it has circ%late& all aro%n& the ring+ an& finall( releases the to'en$ )his process is repeate& for ever( frame$ Ass%ming that onl( a single host wishes to transmit+ the effective &ata rate is6 (A) # 5bps (B) ! 5bps (C) . 5bps (D)/ 5bps I)!""0 Ans.C Explanation: in this 7%estion &ela(e& to'en reinsertion strateg( is %se& $ ):2#""" b(te -#" 5bps 2*""As 9ing latenc( 2 0"" As (=et %s ass%me )p 2 9=+since no other info is given) )herefore+ efficienc( in &ela( to'en reinsertion is #-(#1 (<1#)a-<) Where+ a 2 )p-): 2 #-! It is given that onl( one host is present$ )herefore+ < 2#$ )herefore efficienc( 2 #-#1!a 2 Q Effective &ata rate 2 efficienc( 3 BW 2 #"-!2 . 5bps

GABBARFANS.COM

Q3". Consi&er a to'en ring with the latenc( of .""As$ Ass%me that there are s%fficientl( man( host transmitting so that time spent in a&vancing the to'en can be ignore&$ Pac'et si8e is #."" b(tes$ 9ing has ban&wi&th of ,5bps$ What is effective thro%ghp%t rate that can be achieve& (#) if Dela(e& to'en release strateg( is %se& an& if there is sin,l! %ser in the ring$ (!) if Dela(e& to'en release strateg( is %se& an& if there are 2an/ %sers in the ring$ (,)if earl( to'en release strateg( is %se& an& if there is single %ser in the ring$ (0)if earl( to'en release strateg( is %se& an& if there are man( %sers in the ring$ Ans. )a'e <2#" an& solve it$ Bin& ): an& 9ing latenc( is given+ ta'e it as )p$

Q3#. In a to'en ring networ' the transmission spee& is #"; bps an& the propagation spee& is !"" meters-As$ )he #-bit &ela( in this networ' is e7%ivalent to6 (A) ."" meters of cable$ (B) !"" meters of cable$ (C) !" meters of cable$ (D) ." meters of cable$ C !""; Ans. C Explanation: We solve& one s%ch mo&el in the previo%s 7%estions$ Q3$. Which of the following statements is )9PE abo%t C 5A-CD? (A) IEEE *"!$## wireless =A< r%ns C 5A-CD protocol (B) Ethernet is not base& on C 5A-CD protocol (C) C 5A-CD is not s%itable for a high propagation &ela( networ' li'e satellite networ'$ (D) )here is no contention in a C 5A-CD networ' I)!"". Ans. C Q3%.I$ A ro%ter ha f%ll &%ple: Ethernet interfaces each operating at #"" 5bps$ Ethernet frames are at least *0 b(tes long (incl%&ing the preamble an& inter pac'et gap)$ )he ma:im%m pac'et processing time at the ro%ter for wirespee& forwar&ing to be possible is(in micro secon&s) (a) "$"# (b) ,$,/ (c) /$;! (&) * I)!""/ Ans. c Explanation: here other information is not given so transmission time can be ta'en as processing time$ ):2*0 b(tes-#""5bps 2(*03*-#"") As 2 /$;! As$

GABBARFANS.COM
(&) "$4/#

Stat!2!nt 5o1 Lin)!. Ans*!1 Q4!stions 4& an. 41 : Consi&er a to'en ring topolog( with < stations (n%mbere& # to <) r%nning to'en ring protocol where the stations are e7%all( space&$ When a stationgets the to'en it is allowe& to sen& one frame of fi:e& si8e$ 9ing latenc( is tp+while the transmission time of frame is t:$ all other latencies can be neglecte& Q4&.ma:im%m %tili8ation of the to'en ring when t:2, ms+ tp 2 . ms+ <2#" is (a) "$.0. (b) "$/ (c) "$*.; I)!"";

Ans. c Explanation: If nothing is given abo%t the strateg(+ earl( to'en reinsertion sho%l& be %se&+as it gives ma: efficienc($ )hen efficienc( 2 #-(#1a-<)2 "$*.;

$ Q41.)he ma:im%m %tili8ation of the to'en ring when t:2. ms+ tp 2 , ms+ <2#. is (a) "$.0. (b) "$/.. (c) "$4,;. I)!""; Ans. & Explanation: ame as the above 7%estion Stat!2!nt 5o1 Lin)!. Ans*!1 Q4!stions 42 8 43 : Consi&er the &iagram shown below where a n%mber of =A<s are connecte& b( (transparent) bri&ges$ In or&er to avoi& pac'ets looping thro%gh circ%its in the graph+ the bri&ges organi8e themselves in a spanning tree$ Birst+ the root bri&ge is i&entifie& as the bri&ge with the least serial n%mber$ <e:t+ the root sen&s o%t (one or more) &ata %nits to enable the setting %p of the spanning tree of shortest paths from the root bri&ge to each bri&ge$ Each bri&ge i&entifies a port (the root port) thro%gh which it will forwar& frames to the root bri&ge$ Port conflicts are alwa(s resolve& in favor of the port with the lower in&e: val%e$ When there is a possibilit( of m%ltiple bri&ges forwar&ing to the same =A< (b%t not thro%ghthe root port)+ ties are bro'en as follows6 bri&ges closest to the root get preference an& between s%ch bri&ges+ the one with the lowest serial n%mber is preferre&$ Q42. Bor the given connection of =A<s b( bri&ges+ which one of the following choices represents the &epth first traversal of the spanning tree of bri&ges? (A) B#+ B.+ B,+ B0+ B! (B) B#+ B,+ B.+ B!+ B0 (C) B#+ B.+ B!+ B,+ B0 (D) B#+ B,+ B0+ B.+ B! C !""/ Ans. C Explanation: tart Depth Birst traversal from B# $ B. is connecte& to port # of B# so B. will be traverse& after B#$ Port# of B. is connecte& to port# of B! an& port! of B,$ B! is connecte& with lower in&e: port so B! is traverse& ne:t$ Port ! Both B, an& B0 is connecte& with port# of B!+ b%t B, is Closer to root so B, will be traverse& ne:t$ (&) "$4/#

GABBARFANS.COM

Depth Birst traversal is B#+B.+B!+B,+B0$ Q43$ Consi&er the correct spanning tree for the previo%s 7%estion$ =et host E# sen& o%t a broa&cast ping pac'et$ Which of the following options represents the correct forwar&ing tableon B,? (A) E? ) E#+ E!+ E,+ E0 E.+E/+ E4+E#? E;+E*+E##+E#! (B) E? ) E#+ E! E,+E0 E.+E/ E;+E*$E4$E#"+E##+E#! (D) E? ) E#+ E!+ E,+E0 E.+E;+ E4+E#? E;+E* E##+E#!

P?9) , # !

P?9) 0 , # !

(C) E? ) E,+ E0 E.+E/+ E4+E#? E#+E! E;+E*+E##+E#! C !""/

P?9) , # 0 !

P?9) , # 0

Ans. C Explanation: Pse panning tree generate& in previo%s 7%estion$

GABBARFANS.COM

NET9:RK LAYER Q44. Which of the following assertion is BA= E abo%t the Internal Protocol (IP) ? (A) It is possible for a comp%ter to have m%ltiple IP a&&ress$ (B) IP pac'ets from the same so%rce to the same &estination ta'e &ifferent ro%tes in the networ'$ (C) IP ens%res a pac'et is &iscar&e& if it is %nable to reach its &estination within a given n%mber of hopes$ (D) pac'et so%rce cannot set ro%te of o%tgoing pac'etsR the ro%te is &etermine& onl( b( ro%ting tables in the ro%ters on the wa($ C !"", Ans. D

Explanation: strict source routing Q4 . )he a&&ress resol%tion protocol (A9P) is %se& for6 (a) Bin&ing the IP a&&ress from the D< (b) Bin&ing the IP a&&ress of the &efa%lt gatewa( (c) Bin&ing the IP a&&ress that correspon&s to a 5AC a&&ress (&) Bin&ing the 5AC a&&ress that correspon&s to an IP a&&ress Ans. C Q4"$ In a networ' of =A<s connecte& b( bri&ges+ pac'ets are sent from one =A< to another thro%gh interme&iate bri&ges$ ince more than one path ma( e:ist between two =A<s+ pac'ets ma( have to be ro%te& thro%gh m%ltiple bri&ges$ Wh( is the spanning tree algorithm %se& for bri&ge-ro%ting? (a) Bor shortest path ro%ting between =A<s (b) Bor avoi&ing loops in the ro%ting paths (c) Bor fa%lt tolerance (&)Bor minimi8ing collisions C !"". Ans. b

C !"".

Q4#. A comp%ter on a #"5bps networ' is reg%late& b( a to'en b%c'et$ )he to'en b%c'et is fille& at a rate of !5bps$ It is initiall( fille& to capacit( with #/5egabits$ What is the ma:im%m &%ration for which the comp%ter can transmit at the f%ll #"5bps? (A) #$/ secon&s (B) ! secon&s (C) . secon&s (D) * secon&s C !""* Ans$ B D%ration 2 C-:-(+ where C is the initial capacit(+ : is o%tgoing rate an& ( is incoming rate$

GABBARFANS.COM

N!t*o1) La/!1; Int!1n!t*o1)in, Q4$. )he s%bnet mas' for a partic%lar networ' is !..$!..$,#$"$ Which of the following pairs of IP a&&resses co%l& belong to this networ'? (A) #;!$.;$**$/! an& #;!$./$*;$!,, (B) #"$,.$!*$! an& #"$,.$!4$0 (C) #4#$!",$,#$*; an& #4#$!,0$,#$** (D) #!*$*$#!4$0, an& #!*$*$#/#$.. C !"", Ans.D

Explanation: )o fin& whether hosts belong to sane networ' or not + we have to fin& their net i&+ if net i& is same then hosts belong to same networ' an& net i& can be fin& b( A<Ding s%bnet mas' an& IP a&&ress$ Not!: !.. means all * bits #$ o A<Ding with !.. res%lts same$ e$g$ #;! A<D !.. 2#;! imilarl(+ " means all * bit "$ o A<Ding with " res%lts "$ e$g$ #;! A<D " 2" In above 7%estion + first two octet(B(tes) of s%bnet mas' is !..+ A<Ding with first two octet of IP a&&ress res%lts same octets$ ?nl( in option B an& D first two octet are same$ o option A an& C can be &iscar&e&$ Bo%rth octet of s%bnet mas' is "+ A<Ding with " res%lts " + this &oes not create &ifference$ <ow+ consi&er thir& octet of s%bnet mas' an& IP a&&resses ,#2"""##### (B) !* 2 2 """###"# ,# 2 ,#2 """##### A<D """###"" 2!* Both res%lts are &ifferent+ ?ption B is incorrect$ (D) #!4 2 #/# 2 ##"""""# ,# 2 ,#2 """##### A<D """""""# 2# Both res%lts are same+ ?ption D is correct$ """###"" """##### """###"# #""""""# """##### """""""# 2# A<D 2!4 !4 A<D

Q4%. An organi8ation has a class B networ' an& wishes to form s%bnets for /0 &epartments$ )he s%bnet mas' wo%l& be6 (a) !..$!..$"$" (b) !..$!..$/0$" (c) !..$!..$#!*$" (&) !..$!..$!.!$" C !"".

GABBARFANS.COM

Ans. . Explanation: ?rgani8ation have /0 &epartments+ an& to assign /0 s%bnet we nee& / bits for s%bnet$ In Class B networ' first two octet are reserve& for net i&+ so we ta'e first / bit of thir& octet for s%bnets an& s%bnet mas' sho%l& be !..$!..$######""$"""""""" 2 !..$!..$!.!$"

Q &. )he ro%ting table of a ro%ter is shown below6 D!stination S43n!t 7as) #!*$;.$0,$" !..$!..$!..$" #!*$;.$0,$" !..$!..$!..$#!* #4!$#!$#;$. !..$!..$!..$!.. Defa%lt

Int!15a(! Eth" Eth# Eth, Eth!

?n which interface will the ro%ter forwar& pac'ets a&&resse& to &estinations #!*$;.$0,$#/ an& #4!$#!$#;$#" respectivel(? (a) Eth# an& Eth! (b) Eth" an& Eth! (c) Eth" an& Eth, (&) Eth# an& Eth, C !""0 Ans. A Explanation: 9o%ter &eci&es ro%te for pac'et b( A<Ding s%bnet mas' an& ip a&&ress$ If res%lts of A<Ding s%bnet mas's an& ip a&&ress are same then s%bnet mas' with higher n%mber of #s is preferre&$ IP a&&ress #!*$;.$0,$#/ is A<D with !..$!..$!..$" res%lts #!*$;.$0,$" net i& which is similar to &estination of this mas'+ b%t A<Ding #!*$;.$0,$#/ with !..$!..$!..$#!* also res%lts same &estination$ o+ here+ mas' with higher n%mber of one is consi&ere& an& ro%ter will forwar& pac'et to Eth#$ A<Ding #4!$#!$#;$#" with three s%bnet mas' in table &oes not res%lt in &estination net i& so ro%ter will forwar& this pac'et to &efa%lt networ' via Eth!$

Q 1. A compan( has a class C networ' a&&ress of !"0$!"0$!"0$"$ It wishes to have threes%bnets+ one with #"" hosts an& two with ." hosts each$ Which one of the following optionsrepresents a feasible set of s%bnet a&&ress-s%bnet mas' pairs? (A) !"0$!"0$!"0$#!*-!..$!..$!..$#4! !"0$!"0$!"0$"-!..$!..$!..$#!* !"0$!"0$!"0$/0-!..$!..$!..$#!* (C) !"0$!"0$!"0$#!*-!..$!..$!..$#!* !"0$!"0$!"0$#4!-!..$!..$!..$#4! !"0$!"0$!"0$!!0-!..$!..$!..$#4! I)!"". B) !"0$!"0$!"0$"-!..$!..$!..$#4! !"0$!"0$!"0$#4!-!..$!..$!..$#!* !"0$!"0$!"0$/0-!..$!..$!..$#!* (D) !"0$!"0$!"0$#!*-!..$!..$!..$#!* !"0$!"0$!"0$/0-!..$!..$!..$#4! !"0$!"0$!"0$"-!..$!..$!..$#4!

GABBARFANS.COM

Ans. D Explanation: in Class C networ' first three octet are reserve& for net i&+ so we have total * bits for host an& s%bnets$ If we want to &istrib%te a&&resses in s%bnets so first we sho%l& consi&er the s%bnet with ma:im%m host+ here which is s%bnet with #"" hosts$ Bor #"" hosts we re7%ire ; bits for host i& + one bit remains for s%bnet+ which we fi: to # for this s%bnet + now s%bnet mas' for this s%bnet is !..$!..$!..$#""""""" 2!..$!..$!..$#!* an& s%bnet a&&ress is !"0$!"0$!"0$#!* Bor first s%bnet we have fi:e& #;th bit to # now for secon& an& thir& s%bnet #;th bit will be "$ ." host re7%ire / bit for host i& + two bit remain for s%bnet i& in which one bit is alrea&( fi:e& to 8eroR we can config%re #*th bit onl( for these s%bnets R for secon& s%bnet we fi: #*th bit to # an&

for thir& s%bnet to "$ %bnet mas' for secon& an& thir& s%bnet is !..$!..$!..$##""""""2!..$!..$!..$#4! s%bnet a&&ress for secon& s%bnet is !"0$!"0$!"0$/0 an& s%bnet a&&ress for thir& s%bnet is !"0$!"0$!"0$"

Q 2.A s%bnette& class B networ' has the following broa&cast a&&ress6#00$#/$4.$!..$ Its s%bnet mas' (a) is necessaril( !..$!..$!!0$" (b) is necessaril( !..$!..$!0"$" (c) is necessaril( !..$!..$!0*$" (&) co%l& be an( one of !..$!..$!!0$"+ !..$!..$!0"$"+ !..$!..$!0*$" I)!""/ Ans. & E:planation6 #00$#/$4.$!.. 2 #00$#/$"#"#####$######## ince last #, bits are one so it co%l& be broa&cast a&&ress for an( of s%bnets with mas' !..$!..$!!0$" (with #, bit for host i&)+ !..$!..$!0"$"(with #! bit for host i&)+ !..$!..$!0*$"(with ## bits for host i&)$

Q 3.)wo comp%ters Cl an& C! are config%re& as follows$ Cl has IP a&&ress !",$#4;$!$., an& netmas' !..$!..$#!*$"$ C! has IP a&&ress !",$#4;$;.$!"# an& netmas' !..$!..$#4!$"$ which one of the following statements is tr%e? (A) Cl an& C! both ass%me the( are on the same networ' (B) C! ass%mes Cl is on same networ'+ b%t Cl ass%mes C! is on a &ifferent networ' (C) Cl ass%mes C! is on same networ'+ b%t C! ass%mes Cl is on a &ifferent networ' (D) Cl an& C! both ass%me the( are on &ifferent networ's$ C !""/ Ans.C Explanation: If C# wants to chec' whether C! is in same networ' or in &ifferent networ' then C# A<Ds IP a&&ress of C! with C#Ds s%bnet mas' + if res%lt is same as net i& of C# then C# ass%mes that C! is in same <etwor'$ AND 2 .2 .12$.&<s43n!t 2as) o5 2 .2 .1%2.&<s43n!t 2as) o5 C2= C1= 2&3.1%#.2. 3 !",$#4;$"$" !",$#4;$"$" 2&3.1%#.# .2&1 !",$#4;$"$" !",$#4;$/0 o C# ass%mes that C! is in same networ' b%t C! ass%mes C# is on &ifferent networ'$ Q 4. )he a&&ress of a class B host is to be split into s%bnets with a /-bit s%bnet n%mber$ What is the ma:im%m n%mber of s%bnets an& the ma:im%m n%mber of hosts in each s%bnet? (A) /! s%bnets an& !/!#0! hosts$ (B) /0 s%bnets an& !/!#0! hosts$ (C) /! s%bnets an& #"!! hosts$ (D) /0 s%bnets an& #"!0 hosts$ C !"";

GABBARFANS.COM

Ans$ Wrong options$$Aag laga &o$$ Explanation: in class B a&&ress first two octets are reserve& for net i&$ Birst / bit of thir& octet can be %se for s%bnet an& remaining #" bits can be %se& for host i&$ If n bits are %se& for s%bnet i& then ma:im%m n%mber of s%bnets is !n $ imilarl(+ If n bits are %se& for host i& then ma:im%m n%mber of host is !n-!$ Q . If a class B networ' on the Internet has a s%bnet mas' of !..$!..$!0*$"+ what is the ma:im%m n%mber of hosts per s%bnet? (A) #"!! (B) #"!, (C) !"0/ (D) !"0; C !""* Ans. C Explanation: !..$!..$!0*$" can be written as ########$########$#####"""$"""""""" <%mber of bits assigne& for host i& is the n%mber of 8eros in s%bnet mas'$ Eere ## bits are %se& for host i& so ma:im%m possible hosts are2 !##-!2!"0/ Q ". A host is connecte& to a Department networ' which is part of a Pniversit( networ'$ )hePniversit( networ'+ in t%rn+ is part of the Internet$ )he largest networ' in which the Ethernet a&&ress of the host is %ni7%e is6 (A) the s%bnet to which the host belongs (B) the Department networ' (C) the Pniversit( networ' (D)theInternet I)!""0 Ans. D Ethernet a&&ress is %ni7%e globall($$

GABBARFANS.COM

Q #$ A s%bnet has been assigne& a s%bnet mas' of !..$!..$!..$#4!$ What is the ma:im%m n%mber of hosts that can belong to this s%bnet? (A) #0 (B) ," (C) /! (D)#!/ I)!""0 Ans. C Explanation6 n%mber of bits for host i& is /+ o ma:im%m n%mber of host2!/-!2/! Q $. %ppose a s%bnet S has a s%bnet mas' !..$!..$!..$#4! an& a s(stem A has ip #,"$#!;$0*$#,"$ Which of the following belongs to same s%bnet as A ?
(A) #,"$#!;$0*$#!" (B) #,"$#!;$0*$#*; (C) Both (a) an& (b)

(D) none of these

ANS. B Q %.A ro%ter %ses the following ro%ting table6 Destination 5as' Interface #00$#/$"$" !..$!..$"$" Eth" #00$#/$/0$" !..$!..$!!0$" Eth# #00$#/$/*$" !..$!..$!..$" Eth! #00$#/$/*$/0 !..$!..$!..$!! Eth, 0 A pac'et bearing a &estination a&&ress #00$#/$/*$##; arrives at the ro%ter$ ?n which interface will it be forwar&e&? (a) Eth" I)!""/ ANS. C Q"&.Bor each of the following given IP an& s%bnet mas' (sm) fin&
i) ii)

(b) Eth#

(c) Eth!

(&)

Eth,

<%mber of s%bnets available %bnet i&s

iii) <%mber of hosts available in each s%bnet iv) Direct Broa&cast A&&ress for each s%bnet

a) IP 6 #4!$#4!$#4!$!"" sm6 !..$!..$!..$#!*

b) IP6 #4!$#4!$#4!$!"" sm6 !..$!..$!..$!0"

GABBARFANS.COM

c) IP6 #4!$#4!$#4!$!"" sm6 !..$!..$!..$#.

&) IP6 #."$#""$#""$#"" sm6 !..$!..$!..$"

e) IP6 #."$#""$#""$#""

sm6

!..$!..$#!*$#!*

f) IP6 #4!$..$#!$#!" sm6 !..$!..$!..$!0"

g) IP6 #!*$#!$,0$;# sm6 !..$!..$!..$"

A< $ A) #$ <o$ of s%bnet 2 ! !$ s%bnet i& 2 #4!$#4!$#4!$" + #4!$#4!$#4!$#!* ,$ no$ of host 2 " 0$ DBA 2 #4!$#4!$#4!$!.. B) #$ #/ !$ #4!$#4!$#4!$#!*-/0-,!-#/ ,$ #0 E? )- PB<E) 0$ DBA 2 #4!$#4!$#4!$#.NN$#4!$#4!$#4!$!.. C) <?$ ?B PB<E) 2 #/ E? ) 2 #0 D) <?$ ?B PB<E) 2 !./ E? ) 2 !.0 E) <?$ ?B PB<E) 2 0 E? ) 2 ! B) <?$ ?B PB<E) 2 #/ E? ) 2 #0 @) <?$ ?B PB<E) 2 !./ E? ) 2 !.0

GABBARFANS.COM

Q"1. In an organi8ation that %ses class C n-w+ re7%ire #0 s%bnets each with #" s(stems$ Propose a s%itable s%bnet mas'$ ANS. !..$!..$!..$!0" or !..$!..$!..$#. an& man( more$

Q"2.=et comp%ter A an& B have ip a&&ress #"$#".$#$##, an& #"$#".$#$4# respectivel( an& both %ses same s%bnet mas' <+ then which of the following val%es of < sho%l& not be %se& if A an& B are in same n-w$
(A) !..$!..$!..$" (B) !..$!..$!..$#!* (C) !..$!..$!..$#4! (D) !..$!..$!..$!!0

A< $ (D)

GABBARFANS.COM

Q"3. An organi8ation %ses class C an& re7%ires , s%bnets with /"+ /" an& #!" s(stems respectivel($ Propose s%itable s%bnet mas'$ A< $ !..$!..$!..$#4!+ #..$!..$!..$#4!+ !..$!..$!..$#!*$
In the ipv4 addressing format the number of networks allowed under class C address is a)2^14 b)2^7 c)2^21 d)2^24 CS2 12 !"S# c $ %4##!n internet service provider has the following chunk of cidr based ip address available with it&24'#24(#12(# )2 #the IS* wants to give half of this chunk of address to organi+ation ! and a ,uarter to organi+ation - while retaining the remaining with itself#which of the following is a valid allocation of address to ! and -. a)24'#24(#1/%# )21 and 24'#24(#12(# )22 b)24'#24(#12(# )21 and 24'#24(#12(# )22 c)24'#24(#1/%# )22 and 24'#24(#1/2# )21 d)24'#24(#1/%# )24 and 24'#24(#1/2# )21 CS 2 12 !"S# !

Q" . Consi&er the following IP correspon&ing s%bnet mas' IP 6 #;!$/"$."$! %bnet 5as' 6 !..$!..$!00$" Bin& the range of assignable IP a&&ress o the s%bnet on which the host belongs$ A< 6 #;!$/"$."$! #;!$ /"$ ""##""#"$ """"""#" !..$ !..$ ####"#""$ """"""""

#;!$ /"$ ""##"""$ """""""" ""##""" $ """""""" 2 0* (range of assignable IP) Q"". An organi8ation has a classical n-w an& wants to form s%bnet for 0 &epartments with hosts as follows A B C D ;! ,. !" #*

GABBARFANS.COM

What are the possible arrangements of s%bnets? a) Bor A G !..$!..$!..$#!* Bor B G !..$!..$!..$#4! Bor C T D G !..$!..$!..$!!0 b) Bor A G !..$!..$!..$!!0 Bor B G !..$!..$!..$#4! Bor C T D G !..$!..$!..$#!* c) Bor A G !..$!..$!..$#4! Bor B G !..$!..$!..$#!* Bor C T D G !..$!..$!..$!!0 &) Bor A G !..$!..$!..$#4! Bor B+ C T D G !..$!..$!..$!!0 ANS: Bor A6 !..$!..$!..$#!* Bor B 6 !..$!..$!..$#4! Bor C T D6 !..$!..$!..$!!0

Int!1n!t P1oto(ol 6ollo*in, in5o12ation p!1tains to Q"% an. Q#&

$Consi&er three IP networ's A+ B an& C$ Eost EA in networ's A sen&s messages each containing #*" b(tes of application &ata to a host EC in networ' C$ )he )CP la(er prefi:es a !" b(te hea&er to the message$ )his passes thro%gh an interme&iate networ' B$ the ma:im%m pac'et si8e+ incl%&ing !" b(te IP hea&er+ in each networ' is6 A 6 #""" b(tes B 6 #"" b(tes C 6 #""" b(tes )he networ' A an& B are connecte& thro%gh a # 5bps lin'+ while B an& C are connecte& b( a .#! Hbps lin' (bps 2 bits per secon&)$ # 5bps .#! Hbps

Network A

Network B

Network C

Q"%. Ass%ming that the pac'ets are correctl( &elivere&+ how man( b(tes+ incl%&ing hea&ers+ are &elivere& to the IP la(er at the &estination for one application message+ in the best case? Consi&er onl( &ata pac'ets$ (a) !"" (b) !!" (c) !0" (&) !/" C !""0

GABBARFANS.COM

Ans. & Explanation: Application &ata is #*" b(tes$ )CP la(er a&& !" b(tes to it an& passes to IP la(er+ &ata for IP la(er becomes !"" b(te$ EA sen& pac'et b( a&&ing !" b(te of ip hea&er+ o total si8e of IP pac'et is !!" b(tes$ ince+ ma:im%m pac'et si8e for pac'et in networ' A is #""" b(tes + there will be no fragmentation at networ' A$ IP =a(er at <etwor' B removes IP hea&er an& receive !"" b(tes of &ata$ <etwor' B has 5a:im%m pac'et si8e #"" b(tes incl%&ing !" b(te ip hea&er+ networ' B &ivi&e &ata in *" b(tes fragments an& a&& !" b(te of IP hea&er to it$ Data will be &ivi&e& in three pac'ets as$ Birst pac'et6 *" b(tes 1 !" b(te of hea&er econ& pac'et6 *" b(tes 1 !" b(te of hea&er )hir& pac'et6 0" b(tes 1 !" b(te of hea&er <ote 6 Defragmentaion(gro%ping of fragments) is &one onl( at &estination$ EC will receive total !/" b(tes incl%&ing hea&er$ Q#&. What is the rate at which application &ata is transferre& to host E? Ignore errors+ ac'nowle&gements+ an& other overhea&s$ (a) ,!.$. Hbps (b) ,.0$. Hbps (c) 0"4$/ Hbps

(&).#!$"Hbps C !""0 Ans. b Explanation: EC will receive !/" b(tes in which onl( #*" b(tes are of application &ata$ Application &ata is transferre& at rate of (#*"-!/") : .#! Hbps2,.0$0/ Hbps Q"$. )race-ro%te reports a possible ro%te that is ta'en b( pac'ets moving from some host A to some other host B$ which of the following options represents the techni7%e %se& b( tracero%te to i&entif( these hosts? (A) B( progressivel( 7%er(ing ro%ters abo%t the ne:t ro%ter on the path to B %sing IC5P pac'ets+ starting with the first ro%ter$ (B) B( re7%iring each ro%ter to appen& the a&&ress to the IC5P pac'et as it is forwar&e& to B$)he list of all ro%ters en-ro%te to B is ret%rne& b( B in an IC5P repl( pac'et$ (C) B( ens%ring that an IC5P repl( pac'et is ret%rne& to A b( each ro%ter en- ro%te to B+ in the ascen&ing or&er of their hop &istance from A (D) B( locall( comp%ting the shortest path from A to B I)!"". Ans. B Ans is C not B

GABBARFANS.COM

Q#1. Bor which one of the following reasons &oes Internet Protocol (IP) %se the time-to-live ())=) fiel& in the IP &atagram hea&er? (A) Ens%re pac'ets reach &estination within that time (B) Discar& pac'ets that reach later than that time (C) Prevent pac'ets from looping in&efinitel( (D) =imit the time for which a pac'et gets 7%e%e& in interme&iate ro%ters$ C !""/ A< $ C Q#2. In a pac'et switching networ'+ pac'ets are ro%te& from so%rce to &estination along a single path having two interme&iate no&es$ If the message si8e is !0 b(tes an& each pac'et contains a hea&er of , b(tes+ then the optim%m pac'et si8e is6 (a) 0 (b) / (c) ; (&) 4 C !"". Ans. & Explanation: Pac'et si8e 0 / ; 4

Data in Pac'et re7%ire to pac'ets transmit !0 b(te of &ata 0-,2# !0 /-,2, * ;-,20 / 4-,2/ 0

)otal hea&er overhea& !03,2;! b(tes *3,2!0 b(tes /3,2#* b(tes 03,2#! b(tes

Pac'et si8e 4 have minim%m hea&er overhea&$ Q#3. ?ne of the hea&er fiel&s in an IP &atagram is the )ime to =ive ())=) fiel&$ Which of the following statements best e:plains the nee& for this fiel&? (A) It can be %se& to prioriti8e pac'ets (B) It can be %se& to re&%ce &ela(s (C) It can be %se& to optimi8e thro%ghp%t (D) It can be %se& to prevent pac'et looping C !"#" A< $ D Q#4.which of the following statements is tr%e? (a) Both Ethernet frame an& IP pac'et incl%&e chec's%m fiel&$ (b) Ethernet frame incl%&e a chec's%m fiel& an& IP pac'et incl%&es a C9C fiel& (c) Ethernet frame incl%&e a C9C fiel& an& IP pac'et incl%&es a chec's%m fiel&$ (d) Both Ethernet frame an& IP pac'et incl%&e C9C fiel&s$ A< $ C

Q# $ A gro%p of #. ro%ters are interconnecte& in a centrali8e& complete binar( tree with a ro%ter at each tree no&e$ 9o%ter i comm%nicate with ro%ter F b( sen&ing a message to the root of the tree$ )he root then sen&s the message bac' &own to ro%ter F$ )he mean n%mber of hops per message+ ass%ming all possible ro%ter pairs are e7%all( li'el( is (a) , (b) 0$!/ (c) 0$., (&) .$!/ I)-!""; Ans. c Explanation: Consi&er Complete tree in Big%re

GABBARFANS.COM

If E wants to comm%nicate with ro%ter at level , then it first sen&s pac'et to no&e A+ then A forwar& pac'et to the ro%ter at =evel ,R total / hops are re7%ire& if A wants to comm%nicate with an( level , no&e$ imilarl(+ . hops are re7%ire& if E wants to comm%nicate with an( level ! no&e + 0 hops are re7%ire& if E wants to comm%nicate with an( level # no&e an& , hops are re7%ire& if E wants to comm%nicate with an( level " no&e $ Eops re7%ire& if E wants to comm%nicates with all other no&es 2 (*-#)3/ 1 03.1!30 1#3, 2 ;, If all * level , no&es comm%nicates with all other no&es then hops re7%ire&2;,3*2.*0 imilarl(+

Eops re7%ire& if D wants to comm%nicates with all other no&es 2 *3. 1 (0-#)301!3, 1#3! 2 /" If all 0 level ! no&es comm%nicates with all other no&es then hops re7%ire&2/"302!0" Eops re7%ire& if B wants to comm%nicates with all other no&es 2 *30 1 03,1(!-#)3! 1#3# 2 0; If all 0 level ! no&es comm%nicates with all other no&es then hops re7%ire&20;3!240 Eops re7%ire& if A wants to comm%nicates with all other no&es 2 *3, 1 03!1!3# 2 ,0 )otal hops re7%ire& when all no&es comm%nicate with all other no&es2.*01!0"1401,02 4.! )otal n%mber of message is ! 3 #.C! 2! 3 (#.3#0-!)2!3#".2!#" Eere ! is m%ltiplie& with #.C! beca%se in comm%nication between A an& B+ A sen&s message to B an& B sen&s message to A$ )he mean n%mber of hops per message2 4.!-!#"2 0$.,

Ro4tin, Al,o1it+2

GABBARFANS.COM
A C E B B D @

Q#". Bor the networ' given in the fig%re below+ the ro%ting table of fo%r no&es A+E+D an& @ are shown$ %ppose that B has estimate& its &ela( to its neighbors A+E+D an& @ as *+ #"+ #! an& / msecs respectivel( an& %p&ates its ro%ting table %sing &istance vector ro%ting techni7%e$

9o%ting table of A A " B 0" C #0 D #; E !# B 4 @ !0 9o%ting table of E

A B C D E B @

!0 !; ; !" " ## !!

9o%ting table of D A !" B * C ," D " E #0 B ; @ !! 9o%ting table of @ A !# B !0 C !! D #4 E !! B #" @ "

which one of the following options represents the %p&ate& ro%ting table of B? (a) (b) (c) A !# B * C ; D #4

(&)

E B @ A B C D E B @ A B C D E B @ A B C D E B @ I)!"";

#0 " !! * !" #; #! #" #/ / * * ; #! #" " / * !" #; #! #" " /

GABBARFANS.COM

I)!""; Ans. a Explanation: B %p&ate its ro%ting table with minim%m &istance to other &estination accor&ing to ro%ting table of A+ E+ D an& @$ Calc%late &istance of stations from to via A+E+D an& @ )o tations >ia A (* ms 1 entries in ro%ting table of A) >ia E (#"ms1 entries in ro%ting table of E) >ia D (#!ms1 entries in ro%ting table of D) >ia @ (/ms1 entries in ro%ting table of @) 5in

A B C D E B @

* 0* !! !. !4 #; ,!

,0 ,; #; ," #" !# ,!

,! !" 0! #! !/ #4 ,0

!; ," !* !. !* #/ /

* !" #; #! #" " (&istance from B to B is ") /

o ro%ting table of B is option a$

Stat!2!nt 5o1 Lin)!. Ans*!1 Q4!stions ## -#$ AND#%: I ;;$Consi&er a simple graph with %nit e&ge costs$ Each no&e in the graph represents a ro%ter$ Each no&e maintains a ro%ting table in&icating the ne:t hop ro%ter to be %se& to rela( a pac'et to its &estination an& the cost of the path to the &estination thro%gh that ro%ter$ Initiall(+ the ro%ting table is empt($ )he ro%ting table is s(nchrono%sl( %p&ate& as follows$ In each %p&ation interval+ three tas's are performe&$ (i) A no&e &etermines whether its neighbors in the graph are accessible$ If so+ it sets the tentative cost to each accessible neighbor as #$ ?therwise+ the cost is set toinfinit( $ (ii) Brom each accessible neighbor+ it gets the costs to rela( to other no&es via thatneighbor (as the ne:t hop) (iii) Each no&e %p&ates its ro%ting table base& on the information receive& in the previo%s two steps b( choosing the minim%m cost$ Q#$.Bor the @raphs given above+ possible ro%ting tables for vario%s no&es after the( have stabili8e&+ are shown in the following options$ I&entif( the correct table$ (A) )able for no&e A (B) )able for no&e C A B B # C C # D B , E C , B C 0 A B C A B # # (C) )able for no&e B (D) )able for no&e D

GABBARFANS.COM

D E B A B C D E B A B C D E B

D E E A C D C D B B C E B

# # , # # # ! ! , # ! # #

GABBARFANS.COM

I)!"". Ans. C Explanation: (A) entr( for D+ E an& B are wrong$ D an& E are at &istance of ! hops from A an& B is at &istance of , hops from A (B) Entr( for B is Wrong$ B is at &istance of ! hops from C via D (D) entries for A an& C are wrong$ Q#%. Contin%ing from the earlier problem+ s%ppose at some time t+ when the costs have stabili8e&+ no&e A goes &own$ )he cost Brom no&e B to no&e A at time(t 1 #"") is (A) M#"" b%t finite (B) infinite (C) , (D) M, an& U#"" I)!"". Ans. A Explanation6 Accor&ing to co%nt to infinit( problem after t1#"" time cost will be M#"" $ It will be finite onl($

Q$1.two pop%lar ro%ting algorithm are &istance vector (D>) an& 'in' state (= ) ro%ting$ Which of the following are tr%e? ( #) Co%nt to infinit( is a problem onl( with D> an& not = ro%ting$ ( !) In = + the shortest path algorithm is r%n onl( at one no&e$ ( ,) In D>+ the shortest path algorithm is r%n onl( at one no&e$ ( 0) D> re7%ire lesser n%mber of networ' messages than = $
(a) (b) (c) (d)

#+ ! an& 0 onl($ #+ , an& 0 onl($ ! an& , onl($ #an& 0onl($ I)!""*

A< $ D Q$2. Co%nt to infinit( is a problem associate& with (A) lin' state ro%ting protocol (B) &istance vector ro%ting protocol (C) D< while resolving host name D))CPfor congestion control A< $ B

Stat!2!nt 5o1 Lin)!. Ans*!1 Q4!stions: Q $3 Q$4 Consi&er a networ' with / ro%ters 9# to 9/ connecte& with lin's having weights as shown in the following &iagram Q$3. All the ro%ters %se the &istance vector base& ro%ting algorithm to %p&ate their ro%ting tables$ Each ro%ter starts with its ro%ting table initiali8e& to contain an entr( for each neighbor with the weight of the respective connecting lin'$ After all the ro%ting tables stabili8e+ how man( lin's in the networ' will never be %se& for carr(ing an( &ata? (A) 0 (B) , (C) ! (D) #

GABBARFANS.COM
I)!"".

C !"#"

Ans. C Explanation: =in' 9#- 9! will not be %se& beca%se its cost is / an& lin' 9#-9,-9! costs . which is lesser than 9#-9! lin'$ imilarl(+ lin' 90-9/ will not be %se&+ instea& this lin' we can %se 90-9.-9/ lin' which costs onl( . %nit$

Q$4. %ppose the weights of all %n%se& lin's in the previo%s 7%estion are change& to ! an& the &istance vector algorithm is %se& again %ntil all ro%ting tables stabili8e$ Eow man( lin's will now remain %n%se&? (A) " (B) # (C) ! (D) , C !"#" Ans. # Explanation: <ow @raph will loo' li'e An& onl( lin' that will be remove& is 9.-9/ lin'$

Linked Data Questions Q.85 and Q.86 CS2011 Consider a network with five nodes,N1 to N5,as shown below: N5-N2= 3 N5-N4= 4 N4-N3= 2 N3-N2=

GABBARFANS.COM

!he network uses a "istance #ector $outing %rotocol& 'nce the routers havestabili(ed,thedistance vectors at different nodes are as following: N1: )*,1,+,,,4N2: )1,*, ,+,3N3: )+, ,*,2, N4: ) ,,+,2,*,4N5:: )4,3, ,4,*-

.ach distance vector is the distance of the best known %ath at that instance to nodes, N1toN5, where the distance to itself is *& /lso, all links are s011etric and also the cost is identical in both directions& 2n each round, all nodes e3change their distance vectorswith their res%ective neighbours& !hen all nodes u%date their distancevectors& 2n between two rounds, an0 change in cost of a link will cause the two incident nodes to change onl0 that entr0 in their distance vectors&

4,5&!he cost of link N2-N3 reduces to 2)in both directions-& /fter the ne3t round of u%dates, what will bethe new distance vector at node, N35 a) )3,2,*,2,5b) )3,2,*,2, c) )+,2,*,2,5d) )+,2,*,2, ANS. /

GABBARFANS.COM

4, &/fter the u%date in the %revious 6uestion, the link N1-N2 goes down& N2 will reflect this change i11ediatel0 in its distance vector as cost infinit0& /fter the N.7! $'8N" of u%date ,what will be the cost to N1 in the distance vector of N35 a) 3 b) 9

c) 1* d) 2nfinit0 /N:& ;ink n1-n2 goes down & N3 has neighbor N2 and N4 &N2 has 1ade entr0 infinit0 N4 has the distance of , to N1, N3 has the distance of 2 to N4& :o, 2<, =1* )C-

TRANSP:RT LAYER

Q$#. Which of the following f%nctionalities m%st be implemente& b( a transport protocol over an& above the networ' protocol? (A) 9ecover( from pac'et losses (B) Detection of &%plicate Pac'ets (C) Pac'et &eliver( in the correct or&er (D) En& to en& Connectivit( C !"", A< $ D

Q$$. 5atch the following6 (P) 5)P (#) Application la(er (I) B@P (!) )ransport la(er (9) )CP (,) Data lin' la(er ( ) PPP (0) <etwor' la(er (.) Ph(sical la(er (A) P - ! I - # 9 - , - . (B) P - # I - 0 9 - ! - , (C) P - # I - 0 9 - ! - . (D)P-!I-09-# G , A< $ B

GABBARFANS.COM
C !"";

TCP Q$%.Consi&er a )CP connection in a state where there are no o%tstan&ing ACHs$ )he sen&er sen&s two segments bac' to bac'$ )he se7%ence n%mbers of the first an& secon& segments are !," an& !4" respectivel($ )he first segment was lost+ b%t the secon& segment was receive&

correctl( b( the receiver$ =et S be the amo%nt of &ata carrie& in the first segment (in b(tes)+ an& O be the ACH n%mber sent b( the receiver$ )he val%e of S an& O(in that or&er) are (a) /" an& !4" (b)!," an& !4# (c)/" an& !,# (&) /" an& !," I)!""; Ans. & Explanation: In )CP se7%ence n%mber is assign to each &ata b(tes$ <%mber of b(tes in first segment is !4"-!,"2 /" b(tes$ In )CP ACH n%mber sen& b( receiver is ne:t e:pecte& se7%ence n%mber which is !," here+ !," is first se7%ence n%mber of first b(te in first segment$ Birst segment is lost an& secon& receive& correctl(+ b%t receiver sen& ACH with se7%ence n%mber of first b(te of first segment %ntil first segment receive& correctl($ Q%&. In )CP+ a %ni7%e se7%ence n%mber is assigne& to each (A) b(te (B) wor& (C) segment (D)message A< $ D Q%1. What is the ma:im%m si8e of &ata that the application la(er can pass on to the )CP la(er below? (A) An( si8e (B) !#/ b(tes-si8e of )CP hea&er (C) !#/ b(tes (D) #."" b(tes C !""* A< $ A
$02#Consider an instance of 1C*2s additive increase multiplicative decrease3!I45)algorithm where the window si+e at the start of the slow start phase is 2 4SS and the threshold at the start of the first transmission is ( 4SS#!ssume that a timeout occurs during the fifth transmission #find the congestion window si+e at the end of the tenth transmission# a)( 4SS b)14 4SS c)7 4SS d)12 4SS

I)!""0

C !"#! A< $ @iven initial threshol& 2 * )ime 2 # &%ring #st trans$ + win&ow si8e 2 ! ( low start) + )ime 2 ! congestion win&ow si8e 2 0 (&o%ble the no$ of ac'$) )ime 2 , congestion win&ow 2 * )ime 2 0 congestion win&ow si8e 2 4+ after threshol&+ increase b( one a&&itive increase$ )ime 2 . transmit #"5 + b%t time o%t occ%r congestion win&oe si8e 2 #" Eence threshol& 2 (congestion win&ow si8e)-! 2 #"-! 2 . )ime 2 / transmit !(since in the 7%estion+ the( are sa(ing ss is starting from !) )ime 2 ; transmit 0 )ime 2 * transmit . )ime 24 transmit / )ime 2#" transmit ;

GABBARFANS.COM

D%ring #"th transmission it transmit ;5

$ (C)

Q%3. In the slow start phase of the )CP congestion control algorithm+ the si8e of the congestion win&ow (A) &oes not increase (B) increases linearl( (C) increases7%a&raticall( (D)increasese:ponentiall( C !""* A< $ D Q%4. ?n a )CP connection+ c%rrent congestion win&ow si8e is Congestion Win&ow 2 0 HB$ )he win&ow si8e a&vertise& b( the receive& is A&vertise Win&ow 2 / HB$ )he last b(te sent b( the sen&er is =astB(te ent 2 #"!0" an& the last b(te ac'nowle&ge& b( the receiver is=astB(teAc'e& 2 *#4!$ )he c%rrent win&ow si8e at the sen&er is6 (A) !"0* b(tes (B) 0"4/ b(tes (C) /#00 b(tes (D)*#4! b(tes I)!"". Ans. B Explanation: C%rrent Win&ow i8e 2min(congestion win&ow+ a&vertise& win&ow) )here is no nee& to thin' abt b(tes sent an& ac'nowle&ge&$ Q% . %ppose that the ma:im%m transmit win&ow si8e for a )CP connection is #!""" b(tes$ Each pac'et consists of !""" b(tes$ At some point of time+ the connection is slow-start phase with a c%rrent transmit win&ow of 0""" b(tes$ %bse7%entl(+ the transmitter receives two ac'nowle&gements$ Ass%me that no pac'ets are lost an& there are no time-o%ts$ What is the ma:im%m possible val%e of the c%rrent transmit win&ow? (A) 0""" b(tes (B) *""" b(tes (C) #"""" b(tes (D) #!""" b(tes I)!""0 Ans. B Explanation: in slow start phase if sen&er receive ac'nowle&gement for a win&ow than it enhances its c%rrent win&ow si8e b( one win&ow$ o+ after two ac'nowle&gement c%rrent win&ow si8e will be 0"""1!"""1!"""2*""" b(tes

Q%". A client process P nee&s to ma'e a )CP connection to a server process $ Consi&er the following sit%ation6 the server process e:ec%tes a soc'et ()+ a bin& () an& a listen () s(stem call in that or&er+ following which it is preempte&$ %bse7%entl(+ the client process P e:ec%tes a soc'et () s(stem call followe& b( connect () s(stem call to connect to the server process $ )he server process has not e:ec%te& an( accept () s(stem call$ Which one of the following events co%l& ta'e place?

(A) connect () s(stem call ret%rns s%ccessf%ll( (B) connect () s(stem call bloc's (C) connect () s(stem call ret%rns an error (D) connect () s(stem call res%lts in a core &%mp

C !""*

Ans. C Explanation: Connect() (stem call is not bloc'ing s(stem call b%t it bloc's %ntil connection is establishe& or reFecte&$ If accept() is not e:ec%te& at server then connection will be reFecte& an& an error statement is ret%rne&$

Q%#. Consi&er the following statements abo%t the timeo%t val%e %se& in )CP$ (#) )he timeo%t val%e is set to the 9)) (9o%n& )rip )ime) meas%re& &%ring )CP connection establishment for the entire &%ration of the connection$ (!) Appropriate 9)) estimation algorithm is %se& to set the timeo%t val%e of )CP connection$ (,) )imeo%t val%e is set to twice the propagation &ela( from the sen&er to receiver Which of the following choice hol&? (a) (#) is false+b%t (!) an& (,) are tr%e (b) (#) an& (,) are false+ b%t (!) is tr%e (c) (#) an& (!) are false+ b%t (,) is tr%e (&)(#) +(!) an& (,) are false I)!"";

GABBARFANS.COM

A< $ B+ we have seen Basic algo an& Vacobsons algo Q%$. While opening a )CP connection+ the initial se7%ence n%mber is to be &erive& %sing a timeof-&a( ()oD) cloc' that 'eeps r%nning even when the host is &own$ )he low or&er ,! bits of the co%nter of the )oD cloc' is to be %se& for the initial se7%ence n%mbers$ )he cloc' co%nter increments once per millisecon&$ )he ma:im%m pac'et lifetime is given to be /0s$ Which one of the choices given below is closest to the minim%m permissible rate at which se7%ence n%mbers %se& for pac'ets of a connection can increase? (A) "$"#.-s (B) "$"/0-s (C) "$#,.-s (D)"$,!;-s C !""4 Ans. B Q%%. In the )CP-IP protocol s%ite+ which one of the following is <?) part of the IP hea&er? (A) Bragment offset (B) o%rce IP a&&ress (C) Destination IP a&&ress (D) Destination port n%mber I)!""0 A< $ D

Q1&&. A )CP message consisting of !#"" b(tes is passe& to IP for &eliver( across two networ's$ )he first networ' can carr( a ma:im%m pa(loa& of #!"" b(tes per frame an& the secon& networ' can carr( a ma:im%m pa(loa& of 0"" b(tes per frame+ e:cl%&ing networ' overhea&$ Ass%me that IP overhea& per pac'et is !" b(tes$ What is the total IP overhea& in the secon& networ' for this transmission? (A) 0" b(tes (B) *" b(tes (C) #!" b(tes (D) #/" b(tes I)!""0 Ans. C Explanation: in 7%estion ma:im%m pa(loa& can be transferre& is given not the ma:im%m pac'et si8e$ o &%ring fragmentation we have to consi&er onl( pa(loa& not hea&ers$ At first networ' !#"" b(te pa(loa& will be &ivi&e& into #!"" b(te an& 4"" b(tes pa(loa&s$ In secon& networ' #!"" b(tes pa(loa& &ivi&e& into , pa(loa&s of 0"" b(tes an& similarl(+ 4"" b(tes pa(loa& will be &ivi&e& in ! pa(loa& of 0"" b(tes an& one pa(loa& of #"" b(te$ o !#"" b(tes of pa(loa& in secon& networ' is &ivi&e& in si: pac'ets+ so total IP overhea& in secon& networ' is /3!"2#!" b(tes

Q1&1. A firewall is to be config%re& to allow hosts in a private networ' to freel( open )CP connections an& sen& pac'ets on open connections$ Eowever+ it will onl( allow e:ternal hosts to sen& pac'ets on e:isting open )CP connections or connections that are being opene& (b( internal host) b%t not allow them to open )CP connections to hosts in the private networ'$ )o achieve the minim%m capabilit( of the firewall sho%l& be that of (a) A combinational circ%it (b) A finite a%tomation (c) A p%sh&own a%tomaton with one stac' (&)A p%sh&own a%tomaton with two stac's I)!""; A< $ D(P%sh&own a%tomaton with two stac's can act as a comp%ter) Q1&2$ Which one of the following statements is BA= E? (A) )CP g%arantees a minim%m comm%nication rate (B) )CP ens%res in-or&er &eliver( (C) )CP reacts to congestion b( re&%cing sen&er win&ow si8e (D) )CP emplo(s retransmission to compensate I)!""0

for

pac'et

loss

A< $ A()CP starts slow+ b%t &oesnDt g%arantee minim%m comm%nication rate )

>DP Q1&3. Pac'ets of the same session ma( be ro%te& thro%gh &ifferent paths in6 (a) )CP+ b%t not PDP

(b) )CP an& PDP (c) PDP+ b%t not )CP (&) <either )CP nor PDP A< $ B (Both )CP an& PDP %ses IP+ which is a &atagram service) Q1&4$ Which one of the following %ses PDP as the transport protocol? (A) E))P (B) )elnet (C) D< (D) 5)P A< $ C

C !"".

C !"";

Q1& . Which of the following statements are tr%e? ( #) )CP han&les both congestion an& flow control$ ( !) PDP han&les congestion b%t not flow control ( ,) Bast retransmit &eals with congestion b%t not flow control$ ( 0) low start mechanism &eals with both congestion an& flow control$
(a) (b) (c) (d)

GABBARFANS.COM

#+ ! an& , onl($ # an& , onl($ , an& 0 onl($ #+ ,an& 0onl($ I)!""* A< $ B ( ! is false+ beca%se PDP cannot han&le congestion control$$ 0 is false beca%se+ slow start is %se& for congestion control+ b%t not flow control$$for flow control+ we %se A&vertisement win&ow$ ) Q1&"$ A program on machine S attempts to open a PDP connection to port .,;/ on a machine O+ an& a )CP connection to port */,! on machine W$ Eowever+ there are no application listening at the correspon&ing ports on O an& W$ An IC5P port %nreachable error will be generate& b( (a) O b%t not W (b) W b%t not O (c) neither O nor W (&) both O an& W I)!""/ Ans. D Both the machines will give port %nreachable error$ DonDt thin' that for PDP+ IC5P is not generate&$ We have seen trace ro%te+ in which+ the last pac'et is port %nreachable$ CRYPT:?RAPHY Q1&#.)he total n%mber of 'e(s re7%ire& for a set of n in&ivi&%als to be able to comm%nicate with each other %sing secret 'e( an& p%blic 'e( cr(ptos(stem+ respectivel( are6 (a) n(n-#) an& !n (b)!n an& n(n-#)-! (c) n(n-#)-! an& !n (&) n(n-#)-! an& n I)!""*

Ans. c Explanation: if n in&ivi&%al comm%nicate %sing secret 'e( or s(mmetric 'e( techni7%e then %ni7%e 'e( is re7%ire& for each connection$ )otal possible connections are nC!2n(n-#)-! An& if n in&ivi&%al comm%nicate %sing p%blic 'e( or As(mmetric 'e( techni7%e then each in&ivi&%al sho%l& have p%blic an& private 'e( pair$ o total n%mber of 'e(2 !n

Q1&$.In the 9 A p%blic 'e( cr(ptos(stem+ the private an& p%blic 'e(s are (e+n) an&(&+n) respectivel(+ where n2p37 an& p an& 7 are large primes$ Besi&es+ n isp%blic an& p an& 7 are private$ =et 5 be an integer s%ch that "X5Xn an&Y(n)2 (p Z #) (7 Z #)$ <ow consi&er the following e7%ations$ I$ 5D 2 5e mo& n 5 2 (5D)& mo& n II$ e&[#mo& n III$e& [ #mo& Y (n) I>$5D 25e mo& Y (n) 5 2 (5D)& mo& Y (n) Which of the above e7%ations correctl( represent 9 A cr(ptos(stem? (A) I an& II (B) I an& III (C) II an& I> (D) III C !""4 Ans. C an& I>

Q1&%.)he minim%m positive integer p s%ch that ,p mo&%lo #;2# is (a) . (b)* (c)#! (&) #/ I)!""; Ans. &

GABBARFANS.COM

Q11&. E:ponentiation is a heavil( %se& operation in p%blic 'e( cr(ptograph($ Which of the following option is tightest %pper bo%n& on the n%mber of m%ltiplication re7%ire& to comp%te bn mo&%lo m+ "Ub+ nUm? (a) ?(log n) (b) ?(\n) (c) ?(n - log n) (&) ?(n) I)!""; Ans. a Q111. %ppose that two parties A an& B wish to set%p a common secret 'e( (D-E 'e() betweenthemselves %sing the Diffie-Eellman 'e( e:change techni7%e$ )he( agree on ; as the mo&%l%san& , as the primitive root$ Part( A chooses ! an& part( B chooses . as their respectivesecrets$ )heir D-E 'e( is6

(A) , I)!"".

(B) 0

(C) .

(D)/

Ans. B Explanation: D-E 'e( is gAB mo& n2 ,!3. mo& ;2 ,#" mo& ;2 0 Q112.A sen&er is emplo(ing p%blic 'e( cr(ptograph( to sen& a secret message to a receiver$ Which one of the following statements is )9PE? (A) en&er encr(pts %sing receiverDs p%blic 'e( (B) en&er encr(pts %sing his own p%blic 'e( (C) 9eceiver &ecr(pts %sing sen&erDs p%blic 'e( (D) 9eceiver &ecr(pts %sing his own p%blic 'e( I)!""0 Ans.a

APPLICATI:N LAYER Q113EE==? an& P?9) +respectivel(+ are comman&s from the protocols (a) B)P an& E))P (b) )E=<E) an& P?P, (c) E))P an& )E=<E) (d) 5)P an& B)P I)!""/ A< $ D

GABBARFANS.COM

4114&&/ la0er-4 firewall)a device that can look at all %rotocol headers u% to the trans%ort la0er- C/NN'!

a) =lock entire >!!? traffic during 9:**%1 and 5:**a1

b) =lock all 2C@? traffic

c) :to% inco1ing traffic fro1 a s%ecific 2? address but allow outgoing traffic to the sa1e 2? address

d) =ock !C? traffic fro1 a s%ecific user on a 1ulti-user s0ste1 during 9:** %1 and 5:** a1

Cs 2*11 /N:& /

4115&Consider different activities related to e1ail

11: :end an e1ail fro1 a 1ail client to a 1ail server 12: "ownload an e1ail fro1 1ailbo3 server to a 1ail client 13: Checking e1ail in a web browser

a) &11: >!!? 12::@!? 13:?'? b) &11: :@!? c) &11::@!? d) &11:?'? /N:& C 12:A!? 13:>!!? 12:?'? 13:>!!? 12::@!? 13:2@/?

$11%#1he protocol data unit3pdu)for the application la6er in the internet stack is7 a)segment b)datagram c)message d)frame !"S# C $117#8hich of the following transport la6er protocols is used to support electronic mail a)smtp b)ip c)tcp d)udp !"S# C

GABBARFANS.COM