Anda di halaman 1dari 13

To Download Please Click File Download in the Window

For More Information


www.knowledgeadda.com
For More BEL Question Papers -CLICK E!E
For "ther P#$ E%a& Papers -CLICK E!E
For '(TE Question Papers -CLICK E!E
Question Paper) BEL PE C#E
*+( Classroo& has r !ows o, desks with d desks in each row+ "n a particular da- when all pupils
are present . seats are le,t /acant+ The nu&0er o, pupils in this class+
(ns) dr-.+
1+#-l/ia is two -ears -oun2er than &ar-+ I, Mar- is & -ears old3 how old was #-l/ia two -ears a2o4
(ns) &-5+
.+ ( 0o% is &ade in the ,or& o, a cu0e3 i, a second cu0ical 0o% has inside di&ensions three ti&es
those o, the 3how &an- ti&es as &uch does the second 0o% contain4
(ns ) 16+
5+ ( piece o, paper with an area o, 78 s9uare inches is di/ided into 1 pieces so that the area o, one
is 1:. the area o, the other+ What is the area;in s9 inches< o, one o, the pieces4
(ns ) 15+
=+which o, the ,ollowin2 is 2reater than *:54
(ns ) s9uare root o, >+
7+ i, %?1- @ 5:. and %-- @ *:.3then .-@
(ns )
6+i, (@1:. B3 and C@1:. D3 what part o, D is B4
(ns ) 5:A+
B+Which o, the ,ollowin2 represents the area o, the rectan2le whose len2th is %?* and whose width
is %-*4
(ns ) %C% D*+
A+ Which o, the ,ollowin2 &ust 0e added to 1%-5 to produce a su& o, 84
(ns ) -1%?5+
*8+i, a and 0 are positi/e inte2ers and a-0:.+= @ 5:63 then
(ns ) 0Ea+
**+*8F% &eans *8 is used as a ,actor % ti&es and *8F-% &eans *:*8F%+ ( /er- lar2e or /er- s&all
nu&0er 3there,ore is ,re9uentl- written as a deci&al &ultiplied 0- *8F%3 where % is a positi/e
inte2er+which i, an- o, the ,ollowin2 is ,alse4
(ns ) B7 hundred D thousands @B+7 C *8F-1+
*1+which o, the ,ollowin2 nu&0ers does not ha/e a reciprocal4
(ns ) 8+
18+ Ginclude Estdio+hH
&ain;<
I
int %3- J
%@-@8J
while ;-E*8< ??-J %?@-J
print,;K%@Ld -@Ld MnN3 %3-<J
O
The a0o/e C pro2ra& prints )
(ns ) %@*8 3 -@*8+
1*+What does the ,ollowin2 pro2ra& print4
Poid &a%;int %3-3&<
I
i, ;%H-< &@%J
else &@-J
O
int &ain;/oid<
I
int i3Q3kJ
*@18JQ@=Jk@8J
&a%;i3Q3k<J
print,;KLdMnN3 k<J
O
(ns) a< = 0<8 c< 18 d<none o, the a0o/e;correct answer<+
11+GincludeEstdio+hH
&ain;<
I
int %3-3RJ
%@-@R@*J
??% SS ??- TT R
print,; %@Ld -@Ld R@LdMnN3 %3-3R<J
O
what does the pro2ra& print4
(ns )%@13 -@*3 R@*J
1.+the ,ollowin2 pro2ra& se2&ent is supposed to ,ind the nu&0er o, lowercase letters in the input+
there is a 0u2 in one o, the lines+
lower@8J
while;; c @2etchar;<< U@ E"F<I
i,;;cH@VaV< SS ;cE@VRV<<
lower??JO
which o, the ,ollowin2 0elow is the correct one4
(ns) i, ;;cH@VaV< TT ;cE@VR<<
15+In the ,ollowin2 se2&ent o, KC codeN which o, the ,ollowin2 lines has s-nta% error4
char C a3 C 03 cW*88X d W*88XJ
a@0J ;*<
0@dJ ;1<
c@aJ ;.<
a@cJ ;5<
(ns ) line ;.<+
1=+consider the ,ollowin2 pro2ra& se2&ent
i) @ 7618J
Q) @ 5J
WILE;; i &od Q< @ 8< D"
BE'IY
i) @i di/ QJ
Q)@ Q?*J
EYDJ
What will 0e the /alue o, Q on ter&ination o, the se2&ent 4
(ns ) A+
17+What will 0e the o:p o, the ,ollowin2 pro2ra& se2&ent4 ;'i/en that (#CII Codes are used and
that the codes ,or the lowercase letters are 2reater than o, the uppercase letters4
char c
c@VCV ? ZaV D Z(V?1 J
print,;KLcN3 c<J
(ns) Y(+
16+ The ,ollowin2 code se2&ent is supposed to print out letters,ro& ZaV to ZRV+ What is the s&allest
piece o, code possi0le to su0stitute ,or [[[ so that the pro2ra& dos this4
char c @VaVJ
while; c?? E@ ZRV< putchar ;[[[<J
(ns ) c-*J
1B+ sales persons and other e&plo-ees o, the co&pan- who spend &uch o, their ti&e awa- ,ro&
their o,,ices 0ut keep in touch with their co&pan-Vs &icro-co&puter or &ain,ra&e co&puters o/er
telephone lines are called4
(ns ) teleco&&uters+
1A+Business &eetin2s and con,erences can 0e held 0- linkin2 distantl- located people throu2h a
co&puter network+Yot onl- the participants e%chan2e in,or&ation 0ut are a0le to see each other+
What is it called4
(ns ) Telecon,erencin2+
.8+ Co&&unication 0etween co&puters is al&ost alwa-s
(ns ) #erial+
.*+Workin2 o, the W(Y 2enerall- in/ol/es
(ns ) a< telephone lines 0< &icrowa/es c< satellites d< all o, the a0o/e;correct answer<+
.1+Which data co&&unication &ethod is used ,or sendin2 data in 0oth directions at the sa&e ti&e4
(ns ) Full duple%+
..+( 1588 character te%t ,ile has to 0e trans&itted 0- usin2 a *188 0aud &ode&+ Can -ou tell how
lon2 will it take4
(ns ) 1 secs+
.5+in ne2ati/e lo2ic3 the lo2ic state corresponds to
(ns ) lower /olta2e le/el+
.=+What is the na&e o, the readin2 de/ice which &akes use o, photosensors and laser technolo2ies
to interpret printed3 t-ped or e/en hand written data directl- ,ro& the source docu&ents4
(ns ) "C!+
.7+Which o, the ,ollowin2 co&0ination o, 2ates does not allow the i&ple&entation o, an ar0itrar-
Boolean ,unction 4
(ns ) "! 2ates and Y(YD 2ates+

.6+ The pro0a0ilit- o, drawin2 1 aces in succession ,ro& a pack o, =1 cards is +
ans ) 1:*.+
.B+Which o, the ,ollowin2 testin2 &ethods is nor&all- used as the acceptance test ,or a so,tware
s-ste&4
(ns ) Functional Testin2+
.A+What will 0e the /alue o, P(#C(L e%pression ) 5?7 DIP .C1 D 14
(ns) 7+
58+Consider the ,ollowin2 ra&&ar+
# \ PQ
P \ %
Q \ -
# \ #Q
# \ Ps
To 2et a strin2 consistin2 o, n ter&inals how &an- deri/ations o, this 2ra&&ar ha/e to 0e applied+
(ns )
5*+ #uppose a s-ste& has 0een e/ol/ed3 called the ternar- s-ste&3 0- creatures ha/in2 onl- .
,in2ers+ Yu&0ers in this are written down3 usin2 the di2its 83* 3 and 1 with 1H*H8+what will 0e the
0inar- e9ui/alent o, 111 in this s-ste&4
(ns ) **8*8+
51+ow &an- *Vs are present in the 0inar- representation o, ) .C=*1?6C75?=CB?.4
(ns ) B+
5. + ( procedure that calls itsel, directl- or indirectl- is called
(ns ) recursi/e procedure+
55+The &ini&u& nu&0er o, wires necessar- to connect two data co&&unications de/ices 0- the
electrical industr- associations ;EI(< standard !#1.1 is )
a<1= 0<6 c<. d<5
(ns-c
5=+#atellite data co&&unications present a pro0le& to di2ital data co&&unications 0ecause o, )
a<The latencies in/ol/ed 0<The hi2h le/el o, ther&al noise c<#atellite relia0ilit- pro0le&s
d<E%cessi/e 0andwidth re9uire&ents
(ns - a
57+In I#" re,erence &odel 3the ter& inter,ace re,ers to )
a<The so,tware dialo2 0etween la-ers on a host 0< The electrical connections 0etween &achines
c<The dialo2 at the co&&unication su0net 0oundar- d< Transport protocols
(ns-c
56+In an e%tended 0inar- tree o, n internal nodes 3 the nu&0er o, the e%ternal nodes is 2i/en 0- )
a<n?* 0<n c<1n d<1n-*
(ns-d
5B+Consider the ,olowin2 ,ra2&ents o, the code )
i@*J
C(#E I[. "F
i@*Ji@1Ji@5J
EYD C(#EJ
Followin2 its e%ecution i will ha/e the /alue )
a<* 0<1 c<. d<5
(ns-d
5A+Consider the ,ollowin2 ,ra2&ent o, code)
P!"CED$!E #$B;(3B3C3D<J
!E(L (3B3C3DJ
B@(?(J
D@(?CJ
!ET$!Y J
EYDJ
+
+
+
[@*J]@1J^@6J
C(LL #$B;[3[3[@]3^<J
P!IYT ^J
(ssu&in2 that the linka2e is i&ple&ented as call 0- re,erence;#o&eti&es ter&ed call 0- location
or call 0- address<the /alue o, _^_ taht will 0e printed is )
a<5 0<= c<7 d<6
(ns-d
=8+Consider the ,ollowin2 ,ra2&ent o, code written in procedural lan2ua2e
+
+
+
(@7J
L""P ) D" IYDE[@Y T" *8 B] *J
(@(?*J
EYD L""PJ
P!IYT (J
+
+
+
(ssu&in2 that the D" state&ent is translated in such a wa- that testin2 is per,or&ed at the
0e2innin2 a, the loop;that is leadin2 decisions<3the /alue o, _(_ that will 0e printed when the loop is
entered with n@*1 is )
a<7 0<6 c<B d<A
(ns-
=*+What is the two_s co&ple&ent representation o, -=:B)
0<8+*8*8 c<-8+*8*8 d<*+8*88
(ns-
=1+The pheno&enon known as `&e&or- inter,erence` or `C-cle stealin2` is &ost accuratel-
discri0ed 0- which o, the ,ollowin2 state&ents)
a<a processor is used to ,etch 3decode3and c-cle steal 0inar- nu&0ers stored in read onl- &e&or-+
0<a processor has to wait ,or access to &ain &e&or- 0ecause a de/ice controller is usin2 it+
c<a processor is auto&aticall- ,orced to ,ollow each chain o, locations in &e&or- to its end in an
indirect addressin2 sche&e+
d<a de/ice controller pree&pts a processor to si2nal the co&pletion o, a task
(ns-d
=.+( 0inar- search tree is de,ined as )
a<a ,inite set o, nodes which either is e&pt- or consists o, root node with two disQoint 0inar- trees
0<0inar- tree used ,or searchin2
c<a 0inar- tree such that ,or each node all ke-s in the le,t su0tree o, the nodes are less than the ke-
in the node and those in the ri2ht su0 tree are 2reater tahn the ke- in the node
d<a 0inar- tree whose nodes contain ke-s arran2ed in descendin2 order alon2 e/er- path ,ro& the
root to a lea,
(ns-c
=5+Which o, the ,ollowin2 is correct )
a<in a 0inar- tree o, hei2th h3the nu&0er o, lea/es is 1Fh
0<in a co&plete 0inar- tree the nu&0er o, lea/es is one &ore than the nu&0er o, non-lea, internal
nodes
c<in a ,ull 0inar- tree3the nu&0er o, lea/es is alwa-s is one &ore than the nu&0er o, non-lea,
internal nodes
d<a co&plete 0inar- tree with hei2ht h alwa-s has 1F;h?*<-* nodes
(ns-0
==+(ssu&in2 that all ke-s in a tree are searched ,or with e9ual likelihood3&ini&u& a/era2e search
ti&e in a 0inar- tree is achie/ed i, the 0inar- tree is )
a<,ull 0<co&plete c<hei2ht 0alanced d<wei2ht 0alanced
(ns-0
=7+Which o, the ,ollowin2 is correct )
a<a heap is alwa-s a 0inar- search tree
0<a 0inar- search tree is alwa-s a heap
c<a heap is alwa-s a co&plete 0inar- tree
d<a co&plete 0inar- tree is alwa-s a heap
(ns-0
=6+The 0alanced tree &ethod o, &aintainin2 a search tree is )
a<particularl- 2ood3in co&parison to other search &ethods3,or search trees with onl- a ,ew
hundered enteries
0<2ood ,or representin2 ar0itrar- linear list o, len2ht n30ecause the ,ollowin2 operations ) ,ind an
ite& ha/in2 a 2i/en ke-3,ind the kth ite&; 2i/en k<3insert an ite& at speci,ied place3and delete a
speci,ied ite&3each can 0e done with a co&para0le le/el o, e,,icienc-
c<si&pl- another na&e ,or 0inar- tree &ethods
d<&ore appropriate in 2eneral3the e%ternal stora2e o, data than it is ,or internal stora2e o, data
(ns-
=B+Consider a ,ile with *815 records arran2ed in order accordin2 to ke-+(ssu&in2 that each ke- is
e9uall- likel- to 0e re,erenced and that the ti&e to co&pare a search ke- with a record ke- is
*88&icro sec3which one o, the ,ollowin2 is appro%i&ate reduction in a/era2e search ti&e in
&icrosecond ,or an ar0itrar- record in the ,ile that would result ,ro& usin2 a 0inar- search
al2orith& instead o, se9uential search al2orith&4
a<=83888
0<*83888
c<.83888
d<*888
(ns-
=A+Consider a disk that has pre-di/ided each track into *1 sectors o, *18 characters each+(ssu&in2
that ,ile containin2 A8 character lo2ical records is to 0e stored3which one o, the ,ollowin2 0lockin2
,actors will result in the opti&al usa2e o, the disk stora2e space4
a<* 0<1 c<. d<5
(ns-
78+eap ,iles are use,ul ,or )
a<direct access applictaions 0<transaction lo2s c<sortin2 the data records ,or in/erted ,iles
d<applications re9uirin2 ` 'et Ye%t` operations in ke- se9uence+
(ns-c
7*+For which o, the ,ollowin2 applications a se9uential ,ile appropriate
a<airline reser/ation s-ste& 0<online in/entor- s-ste&s c<&onthl- 0illin2 s-ste&s d<0atch pa-
roll s-ste&s
(ns-c
71+( nota0le chracteristic o, &odern co&&unication character sets is that
*+,unction nodes are included in the alpha0et
1+teh- are all atleast 6-0it codes
.+pro/isions ha/e 0een &ade in each ,or parit- checkin2
5+the- are all deri/ati/es o, the ,i/e -le/el Baudot Code
7.+ What is the correct lo2itudal parit- check character ,or the &essa2e ***88**88**88***8883
which also contains /ertical parit- 0it4
*+**8*
1+888*
.+88**8
5+88*8**
75+ Which o, the ,ollwin2 ,actors is &ost li&itin2 in ter&s o, data trans&ission rate4
*+(ttenution Distortion
1+Phase dela-
.+si2nal Distortion
5+Bandwidth
7=+(ttenution Distortion alters the
*+#hape o, wa/e,or&
1+the a&plitude o, a wa/e,or&
.+the phase &odulous o, the a&plitude
5+the phase an2le and the shape o, the wa/e,or&
77+
76+Consider a co&&unication network with a .8d0 2ain+I, this network were presented with
a si2nal o, *Watt;W< what would the ouput 0e4
*+*&W
1+*88W
.+.W
5+*3888W
7B+Trans&ission o, Data at !ates o, A7880ps and up 2enerall- in/o/es which one o, the ,ollowin2
&odulation techni9ues4
*+Phase and a&plitude
1+phase and ,re9uenc-
.+phase
5+phase ,re9uenc- and a&plitude
7A+which o, the ,ollowin2 would not 0e ,ound in a data &essa2e in a 0it stu,,ed protocol4
*+*8*8*8*8*8
1+8******8*8*
.+888888***
5+***8888****8888
68+Pollin2 is a &ethod o, achie/in2
*+,acilites utiliRation
1+&a%i&u& nu&0er o, acti/e users
.+line discipline
5+consistent trans&ission rates
6*+In a0-te stu,,ed Protocol3control character &i2ht 0e pre,i%ed with an (#CII
*+E#C 1+DLE .+Y$L5+DCE
61+I, encr-ption techni9ues were e&plo-ed in an I#" t-pe Protocol 3the- would occuar at which
la-er4
*+(pplication 1+Yetwork .+#ession 5+Presentation
6.+( /irtual network ser/ice &a- 0e
*+ne/er deli/er packets out o, order
1+occasionall- deli/er a packet out o, order
.+onl- deli/er certain packets out o, order
5+not lose a packet+
65+The ,ollowin2 pro2ra& ,ra2&ent was written in asse&0l- lan2ua2e ,or a sin2le address
co&puter
with one accu&ulator re2ister4
L"(D B
M$LT C
#T"!E T*
(DD (
#T"!E T1
M$LT T1
(DD T*
#T"!E ^
Which arith&etic e%pression is i&ple&ented 0- the ,ra2&ent4
*+R)@t*;0c?a<?t1 1+R)@;;a?0c<C;a?0c<< ? 0c
.+R)@10c?;aCa< .+R)@;a?0c<?0c
6=+In a lan2ua2e in which operations are associated ri2ht to le,t instead o, le,t to ri2ht;ie+a?0?c@a?
;0?c<<3
the /alue o, e%pression 6-;*7:;.?*<C1<-5 is
*+-* 1+. .+6 5+A
67+ ", the ,ollwin23 which 0est appro%i&ates the ratio o, the nu&0er o, noter&inal nodes to the
total nu&0er
o, nodes in a co&plete K-ar- tree o, depth Y4
*+*:Y 1+Y-*:Y .+*:K 5+K-*:K
66+In the ,ollowin2 ,unction3[ is passed 0- re,erence and ] is passed 0- /alue
,unction P;/ar [)inte2erJ])inte2er<)inte2erJ
0e2in
K)@.J
L)@=J
P)@[?]J
endJ
I, the ,unction P were in/oked 0- the ,ollowin2 pro2ra& ,ra2&ent
K)@*J L)@*J ^)@P;K3L<J
then the /alue o, ^ would 0e e9ual to
*+1 1+. .+5 5+7
6B+(ssu&e that a data ,ile has an inde% consistin2 o, Y ite&s3where Y is lar2e+I, a 0inar- search o,
the inde%
is used to ,ind an ite&3then3 o, the ,ollowin23 which 0est appro%i&ates the &ean nu&0er o,
co&parisions
re9uired to locate a speci,ic inde% entr-4
*+;Y?*<:1 1+Y;Y-*<:1 .+;lo2 0ase1 Y<-* 5+Y lo2 0ase1 Y
6A+I, , is de,ined 0-
,unction ,;%)inte2er<)inte2erJ
0e2in
i, %@* then
,)@8
else
,)@%C,;%-*<?%C%
endJ then the /alue o, ,;5< is
*+1A 1+5B .+=8 5+*88
B8+(ssu&in2 that the ta0le is the se9uence o, pa2es re,erenced 0- a pro2ra& to 0e run in a 1-pa2e
&e&or-+
(ssu&e de&and pa2in2 is used+
Ti&e Pa2e!e,erenced
* *
1 1
. *
5 .
=
7
Which pa2es are in &e&or- at ti&e 7 i, the pro2ra& is run under the replece&ent rule
LF$;the least
,re9uentlu used Pa2e should 0e replaced<4
*+ * and . 1+ * and 5 .+ 1 and . 5+1 and 5
B*+Consider the ,unction 0elow)
,unction calc;%3-)inte2er<)inte2erJ
0e2in
i, -@*
then calc)@%
else calc)@calc;%3--*<?%
endJ
(ssu&in2 that the in/ocation call `calc;a30<` and that `a` and `0` are positi/e inte2ers3what result
does this
,unction return4
*+aC;0-*< 1+aC0 .+a?0 5+a pow 0
B1 a ,ull- connected point to point network co&prisin2 ,i/e nodes re9iures the pro/ision o,
*+*8 duple% channels 1+*88 duple% channels
.+= duple% channels 5+5= duple% channels
B.+ Which o, the ,ollowin2 e%pression is correct4
;where `_` denotes the co&ple&ent<
*+;a?0<;a?0_<@a 1+a0?a_c?0c@a0?a_c .+;a?0<_@a_0_ 5+a?a_0@a_@0
B5+The portion o, the process scheduler in an operatin2 s-ste& that dispatches process is connected
with
*+assi2nin2 read- process to the CP$
1+acti/atin2 suspended I:" 0ound process
.+te&porarill- suspendin2 processes when the CP$ load is too 2reat
5+all o, the a0o/e
B=+The pro2ra& ,ra2&ent that ,ollows is written in a 0lock-structured lan2ua2e+(ssu&e that it is
s-ntacticall-
correct deter&ine output+
0e2in
inte2er %3-J
%)@.J-)@6J
0e2in
inte2er %J
0e2in
inte2er -J
-)@AJ %)@1C-J
endJ
%)@%?-J
print;%<J
endJ
print,;%<J
endJ
*+1= 16 1+16 16 .+16 . 5+1= .
B7+Consider the ,ollowin2 &acro de,inition
M(C!" M$LT1 [3-
L"(D ]
M$L [
#T"!E ]
EYD M(C!"
[ and ] are
*+/aria0les 1+identi,iers .+actual para&eters 5+,or&al para&eters
B6+( slidin2 window protocol is used in a co&puter co&&unications networkJ three 0its are used
,or the
packet se9unce nu&0er+What is the &a%i&u& window siRe4
*+B 1+6 .+5 5+.
BB+( co&puter s-ste& stores ,loatin2 point nu&0ers with a *7-0it &antassa and an B-0it e%ponent3
each in two_sM
co&ple&ent+The s&allest and lar2est positi/e /alues which can 0e stored are
*+*C; *8 pow -*1B< and ;1 pow *=<C ;*8 pow *1B<
1+*C;*8 pow -1=7< and ;1 pow *= < C ;*8 pow 1==<
.+*C;*8 pow -*1B< and ;1 pow *=< C ;*8 pow *16<
5+*C;*8 pow *1B< and ;;1 pow *=< -*< C ;*8 pow *16<
BA+Which o, the ,ollowin2 class o, state&ents usuall- produces no e%ecuta0le code when
co&piled4
*+assi2n&ent state&ents 1+se9uence state&ents
.+structural state&ents 5+declaration state&ents
A8+ow &an- 0its are needed to encode all twnet--si% letters3 ten s-&0ols and ten nu&erals4
*+= 1+7 .+6 5+57
A*+Increasin2 the precisio& o, the !E(L data t-pe re9uires usin2 at least one addition 0it in
*+the &aintassa 1+the e%ponent.+0oth &aintassa and the e%ponent 5+either &aintassa or
e%ponent
A1+ The accurac- associatd with the data t-pes and their use is &ost closel- related to
*+the nu&0er o, 0its used to represent the &aintassa
1+the nu&0er o, 0its used to represent the e%ponent
.+the use o, two_s co&ple&ent as opposed to one_s co&ple&ent arith&etic
5+the se9unce o, operations per,or&ed in e/aluatin2 an arith&etic e%pressions
A.+which is not characteristic o, a dais- chainin2 prorit- control sche&e4
*+It is relati/el- eas- to to add &ore de/ices to the chain+
1+teh ,eature o, ione de/ice &a- a,,ect other de/ices on the chain
.+Priorit- is pro2ra&&a0le
5+the nu&0er o, control lines is independent o, the nu&0er CCCCCCCCCCC
A5+Which o, the ,ollowin2 can cause an error due to ,inite precision arith&aetic4
*+the product o, tow IYTE'E!s with the result represented 0- a L"Y'IYTE'E!
1+the product o, two !E(Ls with the result represented 0- D"$BLE P!ECI#I"Y !E(L
.+the su& o, tewo C(!(CTE!s with the result represented 0- an IYTE'E!
5+the su& o, two !E(Ls with the result represented 0- a D"$BLEaP!ECI#I"Y !E(L
A=+( node in a network ,orwards inco&in2 packets 0- placin2 the& on its shortest output 9ueue+
What routin2 al2orith& is in operation4
*+hot potato routin2 1+,lododin2 .+static routin2 5+delta routin2
A7+I, n and p are 0oth odd nu&0ers 3 which o, the ,ollwin2 nu&0ers &ust 0e an e/en nu&0er4
*+n?p 1+np .+np?1 5+n?p?*
A6+ I, the len2th o, a rectan2le is increased 0- 18L3 and the width o, the sa&e rectan2le is
decreased
0- 18L3 then the area o, the rectan2le
*+decreases 0- 18L 1+decreases 0- 5L
.+is unchan2ed 5+increased 0- 18L
AB+ 2i/en that % and - are real nu&0ers 3let #;%3-<@;% pow 1<-;- pow 1<+then #;.3#;.35<<@
*+-58 1+-6 .+58 5+5A
AA+2i/en that a and 0 are real nu&0ers 3let ,;a30<@a0 let 2;a<@;aCa<?1+then ,W.32;.<X@
*+;. Ca Ca< ?1 1+;.CaCa<?7 .+1A 5+..
*88+For the inte2er n 3 i, ;nCnCn< is odd+ which o, the ,ollwin2 state&ents is ;are8 true4
I odd II ;nCn< is odd III ;nCn< is e/en
*+ I onl- 1+III onl- .+II onl- 5+I and II onl-
Friends!, Share this website information with your friends, so
that they will also be able to do well in the eamination. !ou
can use facebook, "oogle# to share.
If you like the website $lease use the g# button and facebook
like button.
If you need any other information $lease lea%e a comment in
the website. &hanks for your su$$ort
For More Information www.knowledgeadda.com
For 'ooks, Mobile (e%iew www.collegegalatta.com
My &ra%el "uide mytra%elbus.blogs$ot.com
Financial )dda www.yourmoneyadda.com

Anda mungkin juga menyukai