JUNE 2009

2. In order that a code is error correcting, the minimum

Hamming distance should be :
(A t
(! 2t " #
($ 2t
(% 2t & #
Ans:"%
E'(lanation:" )he error"detecting and error"correcting
(ro(erties o* a bloc+ ode de(end on its hamming distance.
)o reliabl, %E)E$) -t- errors, ,ou need a distance t&# code.
)o $.//E$) t errors, ,ou need a distance 2t&# code.
0. )he boolean e'(ression '-,-1 & ,1 & '1 is e2ual to :
(A '
(! ,
($ 1
(% '&,&1
Ans:"$
E'(lanation:" '-,-1 & ,1 & '1
3 1('-,- & , & '
31('- & ,- & , & '
31(' & '- & , & ,-
31(# & #
31.#
31
4. )he characteristic e2uation o* a J5 6i( 6o( is:
(A 7n&# 3 J.7n & 5.7n
(! 7n&# 3 J.7n- & 5-.7n
($ 7n&# 3 7nJ.5
(% 7n&#3(J&5.7n
Ans:" !
E'(lanation:8li( 6o(s can be di9ided into *our basic t,(es.
Each one o* them has a di:erent characteristic e2uation,
circuit, table, gra(hical s,mbol etc. !ut all the 6i( 6o(s
ha9e out(ut signal 7n and 7n-.)he di:erent 6i( 6o(s and
their characteristic e2uations are as *ollo;s.
#. </ 6i( 6o( 3 7ne't3 < & /-7
2. J5 6i( 6o( 3 E2uation gi9en abo9e.
0. % 6i( 6o( 3 7ne't 3 %
4. ) 6i( 6o( 3 )7-&)-7
It is better to learn the di:erent 6i( 6o(s and their
characteristic e2uation because the, as+ in the e'am
*re2uentl,.
)he n&# and n should a((ear as subscri(ts *or 7.
=. In order to im(lement a n 9ariable s;itching *unction, a
>U? must ha9e:
(A 2 (o; n in(uts
(! 2 (o; n & # in(uts
($ 2 (o; n"# in(uts
(% 2 (o; n " # in(uts
Ans:" A
E'(lanation:" A multi(le'er is a combinational circuit that
recei9es binar, in*ormation *rom one o* 2 (o; n in(ut data
lines and directs it to a single out(ut line. In order to
im(lement a n 9ariable s;itching *unction, a >U? must
ha9e 2 (o; n in(uts. E'(lanation is a9ailable in $om(uter
architecture boo+ b, >orris >ano. @g 4A.
B. )he through(ut o* (ure AC.HA is gi9en b,,
(A <3D
(! <3e (o; 2D
($ <3De (o; 2D
(% <3De (o; "2D
Ans:"%
Another 2uestion ;hich +ee(s re(eating in the e'am is
through(ut o* slotted AC.HA. Cearn that as ;ell.
E. )he 8iber %istributed %ata Inter*ace uses:
(A single mode Fbbers and CE%s
(! multimode Fbbers and CE%s
($ single mode Fbbers and IC%s
(% multimode Fbers and IC%s
Ans:" !
E'(lanation:"8%%I deFnes t;o t,(es o* o(tical Fbbers.
<ingle mode and multimode. >ultimode Fner uses CE%s as
the light"generating de9ice. <ingle mode Fber generall,
uses lasers.
A. )o em(lo, multi"access in D<>, users are gi9en di:erent:
(A time slots
(! band(ass Flters
($ handsets
(% *re2uenc, bands
Ans:"%
9. Gith *our (rograms in memor, and ;ith A0H a9erage II.
;ait, the $@U utilisation isJ
(A B0H
(! E0H
($ 90H
(% #00H
Ans:"A
E'(lanation:"$@U utilisation is gi9en b, the *ormula
3 # " @ (o; n
$@U utilisation is calculated *rom a (robabilistic 9ie;(oint.
@ stands *or the *raction o* time ;aiting *or II. to com(lete.
Number o* (rocesses in memor, 3 n
)he (robabilit, that all n (rocesses are ;aiting *or II. is (
(o; n.
@3A0H3A0I#0030.A
n34
$@U Utili1ation 3 # " ( (o; n
3 # " (0.A (o; 4
3 # " 0.409B
3 B0H
#0. Assume N segments in memor, and a (age si1e o* @
b,tes. )he ;astage on account o* internal *ragmentation is:
(A N@I2 b,tes
(! @I2 b,tes
($ NI2 b,tes
(% N@ b,tes
And:"Gasted memor, due to internal *ragmentation is N@I2
b,tes
##. Assertion (A: !it ma(s are not o*ten used in memor,
management.
/eason (/: <earching a bit ma( *or a run o* gi9en length is
a slo; o(eration.
(A !oth (A and (/ are true and (/ is correct e'(lanation
*or (A
(! !oth (A and (/ are true but (/ is not correct
e'(lanation *or (A
($ (A is true (/ is *alse
(% (A is *alse (/ is true
Ans:" A
#2.)he com(lete gra(h ;ith *our 9ertices has + edges
;here + is :
(A 0
(! 4
($ =
(% B
Ans:" %
E'(lanation:" A gra(h D is said to be com(lete i* e9er,
9erte' in D is connected to e9er, other 9erte' in D. <o a
com(lete gra(h D must be connected. )he number o*
edges is B.
#0. )he octal e2ui9alent o* he'adecimal (A.!#B is :
(A 4E.2#
(! #2.E4
($ #2.E#
(% #E.2#
Ans:
E'(lanation:" (A.! he'. A is #0 and ! is ## in he'.
(#0.##he'
3#0#0.#0##
3Ne't ste(, grou( the bits in grou(s o* 0 each.
300# 0#0. #0# #00
3# 2. =4 is the right ans;er
#4. A reduced state table has #A ro;s. )he minimum
number o* 6i( 6o(s needed to im(lement the se2uential
circuit is:
(A #A
(! 9
($ =
(% 4
Ans:"%
E'(lanation: I* ,ou ha9e n ro;s, ,our circuit ;ill ha9e at
least log base 2 n 6i( 6o(s. Cog base 2 #A is 4. <o the
correct ans;er is %.
#=. Ghat is the 9alue o* Kb- a*ter the e'ecution o* the
*ollo;ing code statements:
c3#0L
b3&&c&&&cL
(A 20
(! 22
($ 20
(% None
Ans:%
#B. Ghich o* the *ollo;ing does not re(resent a 9alid
storage class in Kc-J
(A Automatic
(! static
($ union
(% e'tern
Ans:"$
E'(lanation:" )he 9alid storage classes are e'tern, static,
register and auto(automatic.
#E. )he *riend *unctions are used in situations ;here:
(A Ge ;ant to ha9e access to unrelated classes
(! %,namic binding is re2uired
($ E'change o* data bet;een classes to ta+e (lace
(% None o* the abo9e.
Ans:" $
#A. (i %>C includes a 2uer, language based on both
relation algebra and tu(le calculus
(ii %>C includes a 2uer, language based on tu(le
calculus
(iii %>C includes a 2uer, language based on relational
algebra
(i9 %>C includes a 2uer, language based on none o* the
relation algebra and tu(le calculus. Ghich one is correctJ
(A (i onl,
(! (ii onl,
($ (iii onl,
(% (i9 onl,
Ans:" A
#9. <u((ose it ta+es a #00ns to access a (age table and
20ns to access associati9e memor, ;ith a 90H hit rate, the
a9erage access time e2uals:
(A 20 ns
(! 2A ns
($ 90 ns
(% #00 ns
Ans:" !
Almost a similar 2uestion ;as as+ed in %ecember 200A
2uestion (a(er.7uestion no.9. /e*er to the same. )he hit
rate is as+ed gi9en the a9erage access time.
20. )here e'ists a construct ;hich returns a 9alue Ktrue- i*
the argument sub2uer, is:
(A em(t,
(! non"em(t,
($ in error
(% none o* the abo9e
Ans:" !
2#. Ghich construct in <7C is used to test ;hether a
sub2uer, has an, tu(les in its resultJ
(A UNI7UE
(! E?I<)<
($ D/.U@ !M
(% E?$E@)
Ans: !
22. ./A$CE su((orts:
(A inner Noin and outer Noin onl,
(! outer Noin and semi Noin onl,
($ inner Noin, outer Noin, semi Noin onl,
(% inner Noin, outer Noin, semi Noin and anti Noin
Ans:" %
20. Ghich t;o o* the *ollo;ing are e2ui9alent *or an
undirected gra(h DJ
(i D is a tree
(ii )here is at least one (ath bet;een an, t;o distinct
9ertices o* D
(iii D contains no c,cles and has (n"# edges
(i9 D has n edges
(A (i and (ii
(! (i and (iii
($ (i and (i9
(% (ii and (iii
Ans:"!
24. In a ! tree o* order m ;ith ( nodes the a9erage number
o* s(lits is at most:
(A #I(mI2"#
(! (mI2"#
($ #I(mI2
(% None
Ans:"!
2=. )he (ro(ositional *ormula gi9en b, the tree is:
/e*er to the actual 7@.
Ans:" %
E'(lanation:"None o* the e2uations Ft an, o*
(reorder,(ostorder or inorder listing.
2B. 7ueuse is a OOOOOOOlist.
(A CI8.
(! CIC.
($ 8IC.
(% 8I8.
Ans:" %
2E. In a *ull binar, tree o* height +, there are
OOOOOOOOOOinternal nodes.
(A 2 (o; + " #
(! 2 (o; (+ " #
($ 2 (o; +
(% 2 (o; + & #
Ans:" A
2A.A binar, tree is said to ha9e hea( (ro(ert, i* the
elements along an, (ath:
(A *rom lea* to root are non"increasing
(! *rom lea* to root are non"decreasing
($ *rom root to lea* are non"decreasing
(% *rom root to lea* are non"increasing
Ans:" %
E'(lanation:"Ans;er is in <chaum-s series boo+ on %ata
structures ;ith $&&.
A binar, tree is said to ha9e the hea( (ro(ert, i* the
elements along an, (ath *rom root to lea* are non
increasing. A hea( is a com(lete binar, tree that has the
hea( (ro(ert,. <o the correct o(tion is %.
29. ?.2= (rotocol consists o*:
(A @h,sical and *rame le9els
(! 8rame and (ac+et le9els
($ @h,sical, *rame and (ac+et le9els
(% None o* the abo9e.
Ans:"$
00. D<>I$%>A s,stems:
(A are limited to 9er, lo; s(eed data
(! re2uire no local loo( ;ires
($ are (redominantl, used *or 9oice
(% all o* the abo9e
Ans:"%
0#. Usuall, in*ormation securit, in a net;or+ is achie9ed
b,:
(A Ca,ering
(! $r,(togra(h,
($ Drad o* ser9ice
(% None o* the abo9e
Ans:" !
02. )he lin+er:
(A is similar to inter(reter
(! uses source code as its in(ut
($ is re2uired to create a load module
(% none o* the abo9e
Ans:" %
Cin+er is a (rogram that lin+s se9eral obNect modules and
libraries to a single e'ecutable (rogram.
00. In ;hich addressing mode the o(erand is gi9en
e'(licitl, in the instruction itsel*J
(A Absolute mode
(! Immediate mode
($ Indirect mode
(% Inde' mode
Ans:" !
E'(lanation:" In immediate addressing mode, the o(erand
is gi9en in the instruction itsel*.
Eg:" >.P AC,B4H >o9e B4H to Al register
>.P !',0490H >o9e 0490H to !' register.
04. A com(iler that runs on one machine and (roduces
code *or a di:erent machine is called:
(A $ross com(ilation
(! .ne (ass com(ilation
($ );o (ass com(ilation
(% None o* the abo9e
Ans:" A
0=. An, s,ntactic construct that can be described b, a
regular e'(ression can also be described b, a:
(A $onte't sensiti9e grammar
(! Non conte't *ree grammar
($ $onte't *ree grammar
(% None o* the abo9e
Ans:" $
0B. 8ind the odd man out:
(A tail
(! cut
($ ;art
(% sed
Ans:" $
E'(lanation:" tail, cut and sed are uni' commands. ;art is
not.
0E. Ghich o* the *ollo;ing changes (ermission to den,
;rite (ermission to grou( and othersJ
(A chmod go"; Fle'
(! chmod go3; Fle'
($ chmod go ; Fles
(% None o* the abo9e
Ans:" A
E'(lanation:" chmod is the command used *or changing Fle
(ermissions. go stands *or grou( and others. )he minus
s,mbol remo9es the (ermission. K;- stands *or ;rite. <o,
go"; stands *or remo9ing the ;rite (ermission *rom grou(
and others *or the Fle Fled.
0A. Pariable (artition memor, management techni2ue ;ith
com(action results in:
(A /eduction o* *ragmentation
(! >inimal ;astage
($ <egment sharing
(% None o* the abo9e
Ans:" A
09. $a(abilit, >aturit, >odel is meant *or:
(A @roduct
(! @rocess
($ @roduct and @rocess
(% None o* the abo9e
Ans:" !
40. In the light o* so*t;are engineering so*t;are consists o*:
(A @rograms
(! %ata
($ %ocumentation
(% All o* the abo9e
Ans:" %
4#. Ghich one o* the *ollo;ing I<. standard is used *or
so*t;are (rocessJ
(A I<. 9000
(! I<. 900#
($ I<. 9000
(% I<. 9000"0
Ans:" %
42. Ghich o* the *ollo;ing is used *or test data generationJ
(A Ghite bo'
(! !lac+ bo'
($ !oundar,"9alue anal,sis
(% All o* the abo9e
Ans:"$
E'(lanation:" !oundar, 9alue anal,sis is a techni2ue *or
test data selection.A test engineer chooses 9alues that lie
along data e'tremes.
40. /e9erse engineering is the (rocess ;hich deals ;ith:
(A <i1e measurement
(! $ost measurement
($ %esign reco9er,
(% All o* the abo9e
Ans:" $
44. )he s(acing bet;een character (airs is called:
(A 5erning
(! '"height
($ interca(
(% seri*
Ans:" A
4=. Ghen com(ared ;ith analog cellular s,stems, an
ad9antage o* digital )%>A cellular s,stem is that:
(A it is less com(licated
(! it re2uires less o* com(uter memor,
($ it conser9es s(ectrum band;idth
(% it costs less
Ans:" $
4B. E"commerce includes:
(A!2$
(! !2!
($ $2$
(% All o* the abo9e
4E. A clustering techni2ue that (ermits a con9enient
gra(hical dis(la, is:
(A (artition based clustering
(! (robabilistic model based clustering
($ hierarchial clustering
(% agglomerati9e clustering
Ans:" $
4A. A*ter sending a message, the sender should not be able
to, at a later date, den, ha9ing sent the message, is
re*erred to as:
(A Authenticit,
(! Non"re(udiabilit,
($ Auditabilit,
(% /e(udiabilit,
Ans:" !
49. )he de9ice ;hich connects dissimilar CANs o* di:erent
to(ologies using di:erent sets o* communication (rotocols
so that in*ormation can 6o; *rom one to another is called:
(A /outer
(! !ridge
($ Date;a,
(% <;itch
Ans:" $
=0. Ge can not delete the OOOOOOicon but ;e can ma+e it
in9isible.
(A /ec,cle
(! >, com(uter
($ Internet e'(lorer
(% None o* the abo9e
Ans:" A
8or more solutions and other use*ul materials, 9isit the
;ebsite
htt(:IIugcnetsol9ed"com(uterscience.blogs(ot.in

0.