1.

The channel capacity of a band-limited Gaussian channel is given by

(A). B log2 (2+!") (B) B log2 (1+!")
(# ).B log1$(1+!") (%). B loge(1+!")
Ans & B. '(planation &- #)B log2 (1 + !") *he+e # is the capacity in bits pe+ second. B is the band*idth of the
channel in ,e+t- and !" is the signal to noise +atio.
2. The g+aph . /01 has 2222222 edges.
(A). / edges (B) 1 edges
(# ). 3 edges (%) 12 edges
Ans & %. A bipa+tite g+aph is a complete bipa+tite g+aph if eve+y ve+te( in 4 is connected to eve+y ve+te( in 5. 6f
4 has n elements and 5 has m0 then the +esulting complete bipa+tite g+aph can be denoted by . n0m and the
numbe+ of edges is given by n7m.
The numbe+ of edges ) . /01 ) / 7 1 ) 12
/. The total numbe+ of spanning t+ees that can be d+a*n using five labeled ve+tices is&
(A). 128 (B).91
(# ). /9 (%). 19
Ans & A. Acco+ding to cayley:s fo+mula fo+ counting spanning t+ees0 fo+ a complete g+aph .n0
T(.n)) n n-2 *he+e n is the numbe+ of ve+tices.
T(;8))8 8-2)8 /) 8 7 8 7 8)128
1. '(t+emely lo* po*e+ dissipation and lo* cost pe+ gate can be achieved in
(A) <= 6# (B) # <= 6#
(# ) TT> 6# (%) '#> 6#
Ans & B. #<= 6#
8. An e(ample of a unive+sal building bloc; is &
(A). '?-=@ Gate (B). A"% Gate
(# ). =@ gate (%). "=@ Gate
Ans&- %. 4nive+sal gates a+e the ones *hich can be used fo+ implementing any gate li;e A"%0=@ and "=T o+
any combination of these basic gates. Apa+t f+om the "=@ gate0 "A"% gate is also conside+ed as unive+sal gate.
9. An e(ample of a laye+ that is absent in b+oadcast net*o+;s is &
(A). Ahysical laye+ (B). A+esentation laye+
for more materials visit www.educationobserver.com/forum
(# ). "et*o+; laye+ (%). application laye+
Ans & #.
3. The AT< cell is &
(A). 1B bytes long (B). 8/ bytes long
(# ). 91 bytes long (%). 9C bytes long
Ans& B. An AT< cell al*ays consists of a 8-byte heade+ follo*ed by a 1B-byte payload. o the si-e is 8/ bytes
long.
B. Dou+ Eobs F10F20F/0 and F1 a+e *aiting to be +un. Thei+ e(pected +un times a+e C090/ and 8 +espectively. 6n
o+de+ to minimi-e ave+age +esponse time0 the Eobs should be +un in the o+de+&
(A). F1 F2 F/ F1 (B). F1 F/ F2 F1
(# ) F/ F1 F1 F2 (%) F/ F1 F2 F1
Ans & %
C. uppose it ta;es 1$$ns to access page table and 2$ ns to access associative memo+y. 6f the ave+age access
time is 2Bns0 the co++esponding hit +ate is&
(A). 1$$ pe+cent (B). C$ pe+cent
(# ). B$ pe+cent (%). 3$ pe+cent
Ans & B
1$. T+ansmission of " signals 0 each band limited to Dm ,- by T%<0 +eGui+es a minimum band-*idth of
(A).fm (B) 2 fm
(# ) " fm (%) 2" fm
Ans & #. <inimum t+ansmission band-*idth of T%< channel is given by the follo*ing eGuation.
Bt)"H
Hhe+e " is the total numbe+ of channels0 *hich a+e bandlimited to IH: ,-. 6n the above p+oblem0 the numbe+
of signals a+e "0 each band limited to Dm ,- and so the minimum band-*idth is " fm.
11. 6f a code is It: e++o+ detecting0 the minimum hamming distance should be eGual to &
(A). t-1 (B). t
(# ). t+1 (%). 2t+1
Ans& #. To gua+antee the detection of upto s e++o+s in all cases0 the minimum hamming distance in a bloc; code
must be
dmin)s+1
o0 the minimum hamming distance fo+ a It: e++o+ detecting must be t+1
12. A +elation @ in J1020/010809K is given by J(102)0(20/)0(/01)0(101)0(108)K. The +elation is &
for more materials visit www.educationobserver.com/forum
(A) @efle(ive (B). symmet+ic
(# ). T+ansitive (%). not +efle(ive0 not symmet+ic and not t+ansitive
Ans&- %.
1/. The dual of the s*itching function (+y- is&
(A). (+y- (B). (+y-
(# ). ((y+-) (%). ((y+-)
Ans&- %
11. The cha+acte+istic eGuation of %-flip flop is &
(A). L)1 (B). L)$
(# ). L)% (%). L)%
Ans& %.
18. 6f fou+ 1 input mulitple(e+s d+ive a 1 input multiple(e+ *e get a &
(A). 19 input <4? (B). B input <4?
(# ). 1 input <4? (%). 2 input <4?
Ans&- A
19. The th+oughput of slotted A>=,A is given by&
(A). )G (B). )GeG
(# ). )Ge-G (%). )eG
Ans& #
13. #ongestion cont+ol is done by
(A). "et*o+; laye+ (B). Ahysical laye+
(# ). A+esentation laye+ (%). Application laye+
Ans&- A. Add+essing0 inte+net*o+;ing0 e++o+ handling0 pac;et seGuencing a+e its othe+ Eobs.
1B. Asse+tion(A)& T*isted pai+s a+e *idely used as t+ansmission medium.
@easoning(@ )& T*isted pai+s have adeGuate pe+fo+mance and lo* cost.
(A). Both (A) and (@ ) a+e t+ue and (@ ) is the co++ect e(planation fo+ (A).
(B). Both (A) and (@ ) a+e t+ue but (@ ) is not the co++ect e(planation
(# ). (A) is t+ue but (@ ) is false
(%). (A) is false but (@ ) is t+ue
for more materials visit www.educationobserver.com/forum
Ans&- A. Aage "o .C1 of Tanenbaum boo;0 you *ill find the follo*ing statement. M%ue to thei+ adeGuate
pe+fo+mance and lo* cost0 t*iste+ pai+s a+e *idely used and a+e li;ely to +emain so fo+ yea+s to comeN.
1C. An e(ample of a non-adaptive +outing algo+ithm is&
(A). ho+test path +outing (B). #ent+alised +outing
(# ). Ba+an:s hot potato algo+ithm (%). Ba+an:s bac;*a+d lea+ning algo+ithm
Ans&- A. ho+test path +outing.
2$. 6A add+ess in B class is given by&
(A). 128.12/.12/.2 (B). 1C1.$2/.21.81
(# ). 1C2.12B./2.89 (%). 1$.11.12./1
Ans&- B
21. " p+ocesses a+e *aiting fo+ 6!=. A p+ocess spends a f+action of its time in 6!= *ait state. The #A4 utili-ation
is given by&
(A). 1-A O" (B). 1 O A "
(# ). A " (%). A -"
Ans&B. Acco+ding to the p+obabilistic model0 if a p+ocess spends a f+action p of its time in 6!= *ait state0 and if
the+e a+e " p+ocesses in memo+y0 then the #A4 utili-ation is given by 1-A"
22. 6f holes a+e half as la+ge as p+ocesses0 the f+action of memo+y *asted in holes is&
(A) 2 ! / (B). 1 ! 2
(# ). 1 ! / (%). 1 ! 8
Ans & %
2/. An e(ample of a non-p+emptive scheduling algo+ithm is&
(A). @ound +obin (B). A+io+ity scheduling
(# ). ho+test Eob fi+st (%). 2 level scheduling
Ans& #
21. An e(ample of a dist+ibuted = is&
(A). Amoeba (B). 4"6?
(# ). < O %= (%). <4>T6#
Ans& A
for more materials visit www.educationobserver.com/forum
28. Hhich one of the follo*ing co++ectly desc+ibes a static va+iable&
(A). 6t cannot be initiali-ed.
(B). 6t is initiali-ed once at the commencement of e(ecution and cannot be changed du+ing +un time.
(# ). 6t +etains its value du+ing the life of the p+og+am.
(%). "one of the above
Ans& #
29. The output of the p+og+am code
main()
J
int ( ) $P
*hile ( ( Q ) 1$)
fo+(PP)
if (++(R1$))$)
b+ea;P
p+intf(M()RdN0()P
K
is&
(A). ( ) 1 (B). compilation e++o+
(# ). ( ) 2$ (%) none of the above
Ans&- #. Do+ the *hile statement the+e is a fo+ loop inside. Do+ the fo+ loop0 the+e is one if condition0 based on
*hich the+e is a b+ea; statement. ince the value of ( initially is $0 the *hile condition *ould be t+ue and the
fo+ loop *ould sta+t e(ecuting. The if statement condition *ould be chec;ed0 since ++( *ould become 1 and
1R1$ is not eGual to $0 b+ea; *ill not be e(ecuted. ince fo+ is infinite ( value *ill go on inc+easing. =nce the
value of ( +eaches C0 ++( *ould become 1$ and 1$R1$))$ and so b+ea; *ould be e(ecuted. o cont+ol *ill
come out of the inne+most loop and *ould go to the oute+ loop. inc the value of ( is 1$0 and since it is eGual to
1$0 once again the fo+ loop *ould sta+t its e(ecution. =nce the value of ( +eaches 2$0 2$R1$ *ill be eGual to $
and again b+ea; *ill be e(ecuted and cont+ol *ould go to the oute+ fo+ loop. Hhen the condition is chec;ed
fo+ (Q)1$0it is false as the value of ( is 2$ and so it comes out of the *hile loop and the p+intf statement gets
e(ecuted0 p+inting the value of 2$. Hhe*SSSSS
23. A copy const+ucto+ is invo;ed *hen & (A). a function +etu+ns by value (B). an a+gument is passed by value
(# ). A function +etu+ns by +efe+ence (%). none of the above Ans&- B
2B. Hhen a language has the capability to p+oduce ne* data types0 it is said to be & (A). e(tensible (B).
encapsulated (# ). =ve+loaded (%). none of the above Ans&-A
2C. ,o* many const+ucto+s can a class haveT (A) Ue+o (B) 1 (# ) 2 (%) any numbe+ Ans&- %
/$. An entity has& (i) a set of p+ope+ties (ii) a set of p+ope+ties and values fo+ all the p+ope+ties (iii) a set of
for more materials visit www.educationobserver.com/forum
p+ope+ties and the values fo+ some set of p+ope+ties may non-uniGuely identify an entity (iv) a set of p+ope+ties
and the values fo+ some set of p+ope+ties may uniGuely identify an entity Hhich of the above a+e validT (A) (i)
only (B) (ii) only (# ) (iii) only (%) (iv) only Ans&- %
/1. Agg+egation is& (A) An abst+action th+ough *hich +elationships a+e t+eated as lo*e+ level entities (B) An
abst+action th+ough *hich +elationships a+e t+eated as highe+ level entities (#) An abst+action th+ough *hich
+elationships a+e not t+eated at all as entities (%) "one of the above Ans&- B
/2. uppose @ is a +elation schema and D is a set of functional dependencies on @. Du+the+0 suppose @1 and @2
fo+m a a decomposition of @. Then the decomposition is a lossless Eoin decomposition of @ p+ovided that & (A)
@1 @2 -V@1 is in D+
(B) @1 @2-V@2 is in D+
(#) Both @1 @2-V@1 and @1 @2-V@/ functional dependencies a+e in D+
(%)At least one f+om @1 @2-V@1 and @1 @2-V@2 is in D+
Ans&- %.
//. 6n a heap0 eve+y element is 2222222222222222 of all the elements in the subt+ee.
(A) <a(imum (B) minimum
(# ) sum (%) p+oduct
Ans&- A
/1. 6f (+ea+ )) ma(si-e O 1) +ea+)$P else +ea+)+ea++1P is +eGui+ed in &
(A) ci+cula+ Gueue (B) linea+ Gueue (#) stac; (%) deGue
Ans&- %
/8. A high pe+fo+mance s*itching and multiple(ing technology that utili-es fi(ed length pac;ets to ca++y
diffe+ent types of t+affic is &
(A) AT< (B) A%> (#) ="'T (%) "one of the above
Ans&- A
/9. A conventional >A" b+idge specifies only the functions of =6&
(A) >aye+s 1 and 2 (B) laye+s 1 th+ough / (#) all laye+s (%) none of the above
Ans&- A.
/3. An assembly p+og+am contains&
(A) 6mpe+ative and decla+ative statements
for more materials visit www.educationobserver.com/forum
(B) 6mpe+ative statements and assemble+ di+ectives
(#) 6mpe+ative and decla+ative statements as *ell as assemble+ di+ectives
(%) %ecla+ative statements and assemble+ di+ectives
Ans&- #. Assembly p+og+am consists of th+ee types of statements.
1. 6mpe+ative
2. %ecla+ative
/. Assemble+ di+ectives
/B. 6n *hich add+essing mode0 the effective add+ess of the ope+and is gene+ated by adding a constant value to
the contents of a +egiste+T
(A) Absolute mode (B) immediate mode (#) indi+ect mode (%) inde( mode
Ans&- %
/C. Hhich of the follo*ing a+e Assemble+ di+ectivesT
(i) 'L4 (ii) =@6G6" (iii) TA@T (iv) '"%
(A) (ii)0(iii) and (iv) (B) (i)0(iii) and (iv)
(B) (iii) and (iv) (%) (i)0(ii)0(iii) and (iv)
Ans&- %
1$. Hhich of the follo*ing = t+eats ha+d*a+e as a file systemT
(A) 4"6? (B) %= (#) Hindo*s "T (%) none of the above
Ans&- A.
11. 6n *hich of the follo*ing0 +eady to e(ecute p+ocesses must be p+esent in @A<T
(A) <ultip+ocessing (B) multip+og+amming (#) multitas;ing (%) all of the above
12. 6f the e(ecuting p+og+am si-e is g+eate+ than the e(isting @A< of a compute+0 it is still possible to e(ecute
the p+og+am if the = suppo+ts&
(A) <ultitas;ing (B) vi+tual memo+y (#) paging system (%) none of the above
Ans& B
1/. oft*a+e Luality Assu+ance (LA) encompasses&
(A) 5e+ification (B) validation (#) both ve+ification and validation (%) none of the above
11. Hhich level is called as MdefinedN in capability matu+ity modelT
for more materials visit www.educationobserver.com/forum
(A) >evel $ (B) level / (#) level 1 (%) level 1
Ans&- B
18. #=#=<= model is used fo+&
(A) A+oduct Guality estimation (B). p+oduct comple(ity estimation
(#) p+oduct cost estimation (%) all of the above
Ans& #
19. Dont si-es a+e usually e(p+essed in points. =ne point is&
(A) $.$$9C inch (B) $.$1/B inch
(#) $.$2$3 inch (%$ $.$239 inch
Ans&- B. =ne point is 1!32 of an inch and so *e *ill get the ans*e+ $.$1/B inch.
13. Asse+tion (A)& #ellula+ telephone systems can handle a multitude of use+s.
@easoning(@ )& #ellula+ telephone systems pe+mit e(tensive f+eGuency +euse in a small local a+ea.
(A) Both (A) and (@ ) a+e t+ue and (@ ) is the co++ect e(planation fo+ (A)
(B) Both (A) and (@ ) a+e t+ue but (@ ) is not the co++ect e(planation
(#) (A) is t+ue but (@ ) is false
(%) (A) is false but (@ ) is t+ue
Ans&- A.
1B. '-#omme+ce involves&
(A)'lect+onic %ata 6nte+change (B) 'lect+onic mail
(#) 'lect+onic Bulletin boa+ds (%) All of the above
Ans&- %. '-comme+ce involves pape+less t+ansactions and usage of '%6('lect+onic %ata 6nte+change)0
elect+onic mail0 bulletin boa+ds0 fa( t+ansmission and elect+onic fund t+ansfe+s.
1C. An e(ample of a data mining algo+ithm *hich uses sGua+ed e++o+ sco+e function is&
(A) #A@T algo+ithm (B) bac; p+opagation algo+ithm (#) a p+io+i algo+ithm
(%) vecto+ space algo+ithm
Ans&- B. Bac; p+opagation algo+ithm uses sGua+ed e++o+ sco+e function. #A@T algo+ithm uses c+oss-validated
loss function.
8$. (6) 'ach obEect in the active di+ecto+y of *indo*s 2$$$ has an access cont+ol list.
for more materials visit www.educationobserver.com/forum
(66) The scheme is a bluep+int of all obEects in the domain of *indo*s 2$$$. Hhich of the follo*ing is t+ueT
(A) =nly (6) (B) only (66) (#) both (6) and (66) (d) none of the above
Ans&- #
for more materials visit www.educationobserver.com/forum