Professional Documents
Culture Documents
QUESTIONS 1 - 10
1. The number of integers between 1 and 250 that are divisible by 2,5 and 7 is
A) 2 () ! ") 5 (#) $Ans:- B. There are 3 n!e"ers #e!$een 1 an% 2&0
!ha! are %'s#(e #) 2*& an% +. The) are +0*1,0 an% 210.
2. An undire%ted gra&h &ossess an 'ulerian %ir%uit if and only if it is %onne%ted
and its verti%es are A) All of even degree ()All of odd degree") (f any
degree (#)even in numberAns:- A. A--.r%n" !. E/(er0s !he.re1 1* 2 a
"ra3h s /n%re-!e% !hen ! has an e/(eran -r-/! 2 an% .n() 2 ! s
-.nne-!e% an% ea-h 'er!e4 has an e'en %e"ree.)))*t would be useful to
+now about the ,amiltonian %ir%uit as well.
!. A &artially ordered set is said to be a latti%e if every two elements in the set
haveA)a uni-ue least u&&er bound ()a uni-ue greatest lower bound")both
(A) and () (#)none of the above.Ans:- C.
.. The minimum number of edges in a %onne%ted gra&h with /n/ verti%es is
e-ual to A)n(n01) ()n(n01)12")n
2
(#)n01Ans:- D. The 2.r1/(a 2.r -./n!n"
!he 1n1/1 n/1#er .2 e%"es n a -.nne-!e% "ra3h s 5n-16.
5. 2ould be done later.....
3. The de%imal number e-uivalent of (.057.03)$ is 4A) 2055.75 ()2055.075
") 2055.5!7 (#)2055.05!75Ans:- D.
7. 2ould be done later...
$. An astable multivibrator has A)one stable state ()two stable states")no
stable states (#)none of theseAns:- C. An as!a#(e 1/(!'#ra!.r has !$.
s!a!es #/! ne!her .2 !he1 are s!a#(e.
5.120bit 2/s %om&lement of 07!.75 is A) 01001001.1100 ()11001001.1100")
10110110.0100 (#)10110110.1100Ans:- B
10. 'n%oding of data bits 0011 into 70bit even &arity ,amming %ode is
A)0011110 ()0101110")0010110 (#)0011100Ans:- A. The e6&lanation is
-uite lengthy. *f you google the -uestion, you would get a lin+ to the boo+
78undamentals of digital %ir%uit7 by A.Anand 9umar. The e6&lanation is great
there.
11. ,ow many of the following de%larations are %orre%t:int ;<7.0=
double void<0.000=short array>2?<@0,1,2A=%har %<7Bn7=(A) Cone ()(ne is
%orre%t(") Two are %orre%t (#)All four are %orre%tAns:-The se-.n%
%e-(ara!.n s 2.r s/re $r.n" #e-a/se $e -ann.! ha'e a 7e)$.r% as a
'ara#(e na1e. The (as! %e-(ara!.n s a(s. $r.n" #e-a/se $e -ann.!
ass"n an)!hn" $!hn %./#(e 8/.!es !. a -hara-!er 'ara#(e. S. $e are
(e2! $!h .n() !he 2rs! an% !he arra) %e-(ara!.n.I !hn7 !h.se !$. $./(%
s!(( n.! "'e err.rs n -. S. 0C0 -./(% #e !he ans$er 2.r !hs 8/es!.n.
12. The value of the following e6&ression (1! 1 . ) !) D 5 E 1 is
(A) 5.75
() 2.55
(") 1..$75
(#) 5
The answer is 5D6
E43(ana!.n:-
The e6&lanation for this -uestion is very sim&le. A%%ording to the &re%eden%e
of the different binary o&erators in ", ) 1 and D &re%edes that of E and 0. Fin%e
the e6&ression en%losed in &arenthesis is e6e%uted first, the e6&ression whi%h
would be e6e%uted first is (1! 1 . ) !). Fin%e all these o&erators &re%eden%e is
the same, they would e6e%ute from left to right and so 1! 1 . gets e6e%uted
first. 1! 1 . < ! This intermediate answer is multi&lied with ! in order to get the
answer 5. ! ) ! < 5The ne6t e6&ression would be 5 D 5. The result is ..D is
the mod o&erator. *t gives the remainder of dividing two numbers.5 D 5 < .
8inally this . is added to 1 to get the final result of 5.*t is always better to Gust
+now the &re%eden%e %hart table of the different o&erators in ".
1!.2hi%h one of the following will set the value of y to 5 if 6 has the value !,
but not otherwise :
(A) if (6<!)y<5
() if 6<<!(y<5)
(") if (6<<!)=y<5
(#) if (6<<!)y<5
ANS:-D
E9PLANATION:-
*t is always tri%+y to answer su%h -uestions where o&tions loo+ similar. *n su%h
%ases it is a better a&&roa%h to remove all the a&&arent wrong o&tions and
then go for the tri%+y ones. *n this -uestion o&tion A is ruled out be%ause it is
given as 6<!, and < is not a %om&arison o&erator but a assignment o&erator
and so 6 will be assigned the value of ! and not %om&ared. so A is ruled out. "
is also ruled out be%ause the &resen%e of a = at the end of (6<<!) ma+es it as
a inde&endent statement and so the ne6t statement whi%h is y<5 will be
e6e%uted irres&e%tive of the result of the %om&arison. Fo " is ruled out.
Cow we are left with only two o&tions. *t is either or #. Fin%e traditionally we
en%lose the o&erator to be %om&ared within &arenthesis i would %hoose # as
the right answer. *f anyone has any other e6&lanation &lease &ost it to me.
1.. 2hi%h one of the following senten%es is true : (A) The body of a while
loo& is e6e%uted at least on%e.() The body of a do ... while loo& is e6e%uted
at least on%e.(") The body of a do ... while loo& is e6e%uted ;ero or more
times.(#) A for loo& %an never be used in &la%e of a while loo&.Ans:-B
E43(ana!.n:- Fin%e this -uestion is a very sim&le and easy one i am &osting
the answer for this also today. (therwise my idea was to ta+e one -uestion,
e6&lore it, analy;e and then try to &resent the answer. Although many of the
readers must be +nowing this answer i still want to em&hasi;e that the body of
a doHwhile loo& is e6e%uted at least on%e, sin%e the %ondition is tested at the
bottom. *n %ase of while loo& and for loo&, the %ondition is tested at the to& of
the loo&, so there are %han%es that they may not be e6e%uted at all. ut that is
not the %ase with the doHwhile loo&. A doHwhile loo& will be e6e%uted at
least on%e.
15. 7la%+I refers in the Jla%+0bo6I testing means
(A) "hara%ters of the movie Jla%+I
() *K( is hidden
(") #esign is hidden
(#) Lsers are hidden
E43(ana!.n:-8or obvious reasons, o&tion A is ruled out. Cow let us loo+ at
the meaning of bla%+ bo6 testing. The term 7la%+ bo67 refers to the a%tual
software that is getting tested. *n bla%+ bo6 testing one +nows only the set of
in&uts and e6&e%ted out&uts and is unaware of how those in&uts are
transformed into out&uts by the software. Fo o&tion " seems to be the right
%hoi%e.
There are many ty&es of bla%+ bo6 testing te%hni-ues. *t is better to +now
some of them by name.
1. oundary Malue Analysis(MA)
2. '-uivalen%e "lass Testing
3. #e%ision Table based testing
4. "ause0'ffe%t Nra&hing Te%hni-ue
#e&ending on any more -uestions based on bla%+ bo6 testing we %an go
through the te%hni-ues in detail later. * thin+ +nowing some te%hni-ue names
%ould be useful for now.
Ans:-C
13. *n generalisation, the differen%es between members of an entity is(A)
ma6imi;ed() minimi;ed (") both (A) O ()(#) Cone of theseAns:-B
E43(ana!.n:-
Neneralisation and s&e%iali;ation are two terms that have a o&&osite meaning.
*n generali;ation the differen%es between members of an entity is minimi;ed.
Neneralisation is a bottom u& &ro%ess. *t goes from more s&e%ifi% to more
general. 8or e6am&le, if the sub%lasses are ta+en as %ar and bi+e they would
fall under the %ategory of su&er%lass %alled vehi%le. 8rom the sub%lasses we
would identify features whi%h %an ta+e us to the su&er%lass vehi%le.
F&e%ialisation is the o&&osite of this. *n F&e%ialisation the differen%es between
members of an entity are ma6imi;ed. F&e%ialisation is a to& down &ro%ess. *t
goes from more general to more s&e%ifi%. *f vehi%le is a su&er %lass and %ar
and bi+e are its sub%lasses, identifying the %hara%teristi%s or uni-ueness of its
sub%lasses is what ha&&ens in s&e%iali;ation.
*t is a sort of re&eatedly as+ed -uestion. *n Pune 2010 the following -uestion
a&&eared.Nenerali;ation is QQQQQQQ &ro%ess.(A) to&0down() bottom u&(")
both (A) O ()(#) Cone of these The answer of %ourse is B, Neneralisation is
a bottom u& &ro%ess.To summarise, Neneralisation 0 ottom u& 0 #ifferen%es
between members of an entity is minimi;ed.F&e%ialisation 0 To& down 0
#ifferen%es between members of an entity is ma6imi;ed.This %ould be a very
im&ortant -uestion. Rlease go through it again if need be.
17. The de&enden%y &reservation de%om&osition is a &ro&erty to de%om&ose
database s%hema #, in whi%h ea%h fun%tional de&enden%y S T U s&e%ified in
8,
(A) a&&eared dire%tly in one of the relation s%hemas Vi in the de%om&osed #.
() %ould be inferred from de&enden%ies that a&&ear in some Vi.
(") both (A) and ()
(#) Cone of these
E43(ana!.n:- The -uestion itself re-uires a bit of e6&lanation. *t is not enough
if you Gust +now what is the right answer but you must also +now why it is the
right answer. The e6&lanation would be a bit lengthy. Wet us first disse%t the
-uestion and e6&lain some terms in terms of #XF.
De-.13.s!.n 0 This means re&la%ing a relation with a %olle%tion of smaller
relations. Re(a!.n 0 Velation is +nown as Table.Re(a!.n S-he1a 0 This is
+nown as Table definition. Velation F%hema for a 7student7 relation %an be
shown in the following way4
Ftudent(8irstCame,WastCame,#(,Nender,"ourse,Vegno,Address)
De2n!.n .2 De3en%en-) 3reser'a!.n %e-.13.s!.n:0'a%h 8# s&e%ified
in 8 either a&&ears dire%tly in one of the relations in the de%om&osition, or be
inferred from 8#s that a&&ear in some relation.Wet us %onsider an e6am&le for
#e&enden%y &reservationWet V be a relation V(A " #) Wet there be !
fun%tional de&enden%ies. 8#14 A0Y8#24 0Y"8#!4 "0Y#Wet the relation V be
de%om&osed into two more relations.V1(A ") 4 V2(" #)Wet us first %onsider
the relation V1(A "). ,ere between A and the fun%tional de&enden%y 8#1
is &reserved. etween and ", 8#2 is &reserved. Wet us now %onsider the
se%ond relation V2(" #). etween " and # the 8#, 8#! is &reserved. Fo in
the two relations V1 and V2, all the ! fun%tional de&enden%ies are &reserved.
Wet us %onsider an e6am&le for Con0de&enden%y &reservationWet V be a
relation V(A " #) Wet there be again ! fun%tional de&enden%ies.8#14A0Y
8#240Y"8#!4"0Y#Wet the relation be de%om&osed into two more relationsY
V1(A " #) V2( ")Wet us first %onsider the relation V1(A " #). There is no 8#
between A and ". There is a 8#! between " and #.Cow let us %onsider the
se%ond relation V2( "). There is 8#2 between and ".Fo, the two relations
only su&&ort only 8#/s 8#2 and 8#!. 8#1 is not su&&orted. Fo these relations
does not &reserve de&enden%y.Nenerally there are three desirable &ro&erties
of a de%om&osition.
1. Wossless
2. #e&enden%y &reservation
3. Xinimal redundan%y
The above -uestion was based on de&enden%y &reservation de%om&osition.
This e6am&le has been ta+en from the de&enden%y &reservation &resentation
by Pason Allen. The e6&lanation is -uite good there.
SUMMAR::-
The de&enden%y &reservation de%om&osition is a &ro&erty to be %onsidered
for de%om&osing a relation into two or more smaller relations. The fun%tional
de&enden%y S0YU s&e%ified in 8 %an a&&ear dire%tly in one of the relation
s%hemas Vi in the de%om&osed # or it %ould be inferred from de&enden%ies
that a&&ear in some Vi. Fo the answer for this -uestion is ".
Ans:-C
1$. 2hi%h of the following is an o&timisti% %on%urren%y %ontrol method :
(A) Malidation based
() Time stam& ordering
(") Wo%+0based
(#) Cone of these
E43(ana!.n:-
*n order to +now the answer for this let us first go through what %on%urren%y
%ontrol means. 2hen many &eo&le try to ma+e modifi%ations to a database at
any &oint of time, there should be a system of %ontrols in &la%e to ensure that
%hanges made by one do not adversely affe%t the other. This is %alled
%on%urren%y %ontrol. T,ere are basi%ally two maGor %ategories of %on%urren%y
%ontrol and ty&es under them.
Ty&es of %on%urren%y %ontrol
1. Ressimisti% methods
1. Timestam& ordering methods
2. Feriali;ation gra&h testing
3. Wo%+ing methods
2. (&timisti% methods
1. a%+ward validation methods
2. 8orward validation methods
3. ,ybrid methods
The main idea behind &essimisti% method is that it is assumed that transa%tion
%ould be &roblem &rone. *n o&timisti% method it is assumed that transa%tion
may not fa%e any &roblem. (&timisti% methods are deadlo%+0free whereas
&essimisti% method is deadlo%+0&rone. 2e %an loo+ at it in detail de&ending on
any -uestion whi%h we will %ome a%ross in future. *n Gune 2011 &a&er 0** we
had the following -uestion.
The basi% variants of time0stam&0 based method of %on%urren%y %ontrol are
(A) Total time stam&0ordering
() Rartial time stam& ordering
(") Xultiversion Time stam& ordering
(#) All of the above
2e will loo+ at all su%h -uestions later.
Ans:-A
15. (&ti%al storage is a
(A) high0s&eed dire%t a%%ess storage devi%e.
() low0s&eed dire%t a%%ess storage devi%e.
(") medium0s&eed dire%t a%%ess storage devi%e.
(#) high0s&eed se-uential a%%ess storage devi%e.
Ans:-B
E43(ana!.n:-
A%tually the same -uestion is available in the boo+ 7#atabase
systems4"on%e&ts, #esign and a&&li%ation7 by F.9.Fingh. There are lot of
-uestions at the end of every %ha&ter in that boo+. A%%ording to the boo+,
sin%e the head assembly is heavier, #M# and "# drives have mu%h longer
see+ time as %om&ared to magneti%0dis+ drives. Votational s&eeds of #M#
and "# drives are lower than that of magneti% dis+ drives. Fo the answer for
the above -uestion is whi%h is o&ti%al storage is a low s&eed dire%t a%%ess
storage devi%e.
20. 2hi%h of the following is the &ro%ess by whi%h a userZs a%%ess to &hysi%al
data in the a&&li%ation is limited, based on his &rivileges :
(A) Authori;ation
() Authenti%ation
(") A%%ess "ontrol
(#) All of these
Ans:-C
E43(ana!.n:-
*n order to understand the answer for this we need to +now the differen%e
between authori;ation, authenti%ation and a%%ess %ontrol. *t is well e6&lained
in ora%le do%s. A/!hen!-a!.n is the &ro%ess by whi%h a user/s identity is
%he%+ed.A/!h.r;a!.n is the &ro%ess by whi%h the user/s &rivileges are
as%ertained. A--ess -.n!r.( is the &ro%ess by whi%h the user/s a%%ess to
&hysi%al data in the a&&li%ation is limited, based on his &rivileges.
21. 2hat is the ma6imum number of nodes in a 0tree of order 10 of de&th !
(root at de&th 0) :
(A) 111
() 555
(") 5555
(#) Cone of the above
Ans:-C
E43(ana!.n:- The formula for %al%ulating the ma6imum number of nodes in a
0tree of order order n of de&th h is m
hE1
01,ere, m<10 and h<!. Fo the formula
be%omes 10
.
01 whi%h is 1000001<5555 and therefore " is the %orre%t o&tion.
22. A binary tree with 27 nodes has QQQQQQQ null bran%hes.
(A) 5.
() 27
(") 23
(#) Cone of the above
Ans:-D
E43(ana!.n:-This is -uite a straightforward one. A binary tree with n nodes
has nE1 null bran%hes. Fo a binary tree with 27 nodes will have 2$ null
bran%hes. Fin%e 2$ is not available as a o&tion, # is the %orre%t answer.There
is some -uestion based on binary trees or trees in most of the C'T &a&er. The
following -uestion is from Pune 2011 &a&er and this is also based on trees.
The number of different trees with $ nodes is(A) 253() 255(") 2.$(#) Cone
of theseAns:-CE43(ana!.n:-
The number of different trees with n nodes %an be %al%ulated as 2
n
0n. ,ere the
value of n<$. Fo, the formula would be%ome2
$
0$<2530$<2.$Fo the answer is
2.$ and so the o&tion is ".
2!. The time %om&le6ity to build a hea& of n elements is
(A) 0(1)
() 0(lgn)
(") 0(n)
(#) 0(nlgn)
Ans:-C
E43(ana!.n:-The 2(VFT "AF' "(XRW'S*TU to build a hea& of n
elements is the o&tion ".
2.. Winear &robing suffers from a &roblem +nown as
(A) Fe%ondary %lustering
() Rrimary %lustering
(") oth (A) and ()
(#) Cone of these
Ans:-B
E43(ana!.n:- Winear &robing is a term asso%iated with hashing. Winear
&robing is a %ollision resolving te%hni-ue in hashing. *t suffers from a &roblem
+nown as &rimary %lustering. Any %hosen hash fun%tion should uniformly
distribute the re%ords a%ross the given available address s&a%e but sometimes
%lusters a&&ear. *f linear &robing is used, it might s&end a lot of time &robing
within the %luster instead of sear%hing in the subse-uent available s&a%e. (ne
more %ollision resolving te%hni-ue is [uadrati% &robing. Again we might %ome
a%ross the same to&i% de&ending on the nature of -uestion en%ountered in
future.
25. 2hi%h of the following %an be the se-uen%e of nodes e6amined in binary
sear%h tree while sear%hing for +ey $$ :
(A) 50, .0, 35, 50, $$
() 50, 110, $0, $5, $$
(") 150, 30, 50, $5, $$
(#) 35, 1.0, $0, 70, $$
Ans:-C
E43(ana!.n:- *norder to find a solution for a -uestion li+e above, given the
data draw a binary sear%h tree for ea%h one of the o&tions. The first item is the
root. Any value less than the root will form the left side of the tree and any
value greater than the root will form the right side of the tree. 2hen you draw
su%h a tree, if you find no node has a left and right %hild then su%h a se-uen%e
would be valid. *f you find that the tree has a left and right %hild for any node
then that se-uen%e is invalid. *f you draw the tree for all the . o&tions given in
the -uestion you will find that only o&tion " does not have left and right %hild
for any node. Fo o&tion " is %orre%t.
23. 8re-uen%y shift +eying is used mostly in
(A) Vadio transmission
() Telegra&hy
(") Tele&hone
(#) Cone of the above
Ans:-B
E43(ana!.n:- 8re-uen%y shift +eying is a method of transmitting digital
signals.8F9 was mostly used in telegra&hy. The two binary states 0 and 1 are
re&resented by a s&e%ifi% analog waveform in 8F9. Cowadays, a modem
%onverts the binary data into 8F9 for transmitting a%ross tele&hone lines and
does the reverse at the re%eiving end. There is one more method of
transmitting digitals signals where the &hase of a transmitted signal is varied
to %onvey information. This is %alled Rhase Fhift 9eying(RF9).
27. The baud rate is
(A) always e-ual to the bit transfer rate
() e-ual to twi%e the bandwidth of an ideal %hannel
(") not e-ual to the signalling rate
(#) e-ual to half of the bandwidth of an ideal %hannel
Ans:-B
E43(ana!.n:-
The baud rate of a data %ommuni%ation system is the number of symbols &er
se%ond transferred. *t is e-ual to twi%e the bandwidth of an ideal %hannel.
2$.,ow mu%h bandwidth is there in 1 mi%ron of s&e%trum at a wavelength of 1
mi%ron :
(A) !00 X,;
() ! N,;
(") !00 T,;
(#) !0 9,;
Ans:-D
25. 2hi%h of the following file transfer &roto%ols use T"R and establishes two
virtual %ir%uits between the lo%al and remote server :
(A) 8TR
() T8TR
(") T'WC'T
(#) C8F
Ans:-A
E43(ana!.n:- There %ould be a ambiguity between the o&tions A and for
this one. " and # are ruled out. Fo, what is the differen%e between 8TR and
T8TR. The &ur&ose of both the &roto%ols is to obtain files from a remote host.
ut T8TR stands for trivial file transfer &roto%ol. *t is not very reliable or
se%ure. *t uses the &a%+et delivery servi%e offered by L#R. (n the other hand,
8TR stands for 8ile Transfer Rroto%ol. *t is a me%hanism &rovided by T"R1*R. *t
uses the servi%es offered by T"R. *t is reliable and se%ure. *t establishes two
%onne%tions(virtual %ir%uits)between the hosts, one for data transfer and
another for %ontrol information. Fo the answer for this -uestion is o&tion A.
!0. The threshold effe%t in demodulator is
(A) e6hibited by all demodulator, when the in&ut signal to noise ratio is low.
() the ra&id fall on out&ut signal to noise ratio when the in&ut signal to noise
ratio fall below a &arti%ular value.
(") the &ro&erty e6hibited by all A.X. su&&ressed %arrier %oherent
demodulator.
(#) the &ro&erty e6hibited by %orrelation re%eiver.
Ans:-B
!1. (bGe%t %ode is the out&ut of QQQQQQ.
(A) (&erating Fystem
() "om&iler or Assembler
(") only Assembler
(#) only "om&iler
Ans:-B
E43(ana!.n:- Again this is one of those -uestions where more than one
o&tion loo+s %orre%t. * thin+ o&tion is %orre%t be%ause both %om&iler and
assembler %onverts the sour%e language %ode to the obGe%t %ode. *f anyone
has any other version,&lease &ost it and we %an dis%uss it.
!2. /Xa%ro/ in an assembly level &rogram is QQQQQQQ.
(A) sub &rogram
() a %om&lete &rogram
(") a hardware &ortion
(#) relative %oding
Ans:-A
E43(ana!.n:-Woo+ing at all the other o&tions, the only one whi%h seems more
a&&ro&riate is o&tion A.
!!. Nrammar of the &rogramming is %he%+ed at QQQQQQQQ &hase of %om&iler.
(A) semanti% analysis
() %ode generation
(") synta6 analysis
(#) %ode o&timi;ation
Ans:-C
E43(ana!.n:- The following are the main &hases of a %om&iler and the
a%tivities done in ea%h one of the &hases.1.Le4-a( Ana()ss:-*n this &hase
the sour%e &rogram is s&lit into what are %alled /to+ens/.2.S)n!a4 Ana()ss:-
The to+ens are grou&ed together into &hrases whi%h should mat%h some
s&e%ified grammar.Cormally, one of the out&uts of a synta6 analysis &hase
would be a Abstra%t Fynta6 Tree.(AFT)!.Se1an!- Ana()ss:-This &hase
would traverse through the AFT and refine it...In!er1e%a!e -.%e
"enera!.n:-This &hase generates a ma%hine inde&endent %ode.5.C.%e
.3!1;a!.n:-Lse some strategies to o&timi;e the %ode that is generated.
3.C.%e "enera!.n:-Nenerate the ma%hine de&endent %ode finally.Fymbol
table generation and error handling would be &art of almost all &hases. Fo the
grammar %he%+ing would be done at synta6 analysis &hase. ,en%e the o&tion
is ".
!.. The register or main memory lo%ation whi%h %ontains the effe%tive address
of the o&erand is +nown as
(A) &ointer
() s&e%ial lo%ation
(") inde6ed register
(#) Cone of the above
Ans:-A
!5. Xa%ro0&ro%essors are QQQQQQ.
(A) ,ardware
() "om&iler
(") Vegisters
(#) Cone of the above
Ans:-B
!3. The dynami% allo%ation of storage areas with MFAX files is a%%om&lished
by
(A) ,ashing
() "ontrol s&lits
(") (verflow areas
(#) Velative re%oding
Ans:-B
E43(ana!.n:-MFAX stands for Mirtual Ftorage A%%ess Xethod. *t was
introdu%ed by *X. *t is a method of managing files. *t %an s&eed u& the
a%%ess to data in the files. The dynami% allo%ation of storage areas with MFAX
files is a%%om&lished by "ontrol F&lits.
!7. 2hi%h of the following %ommand the file names in multi&le %olumns :
(A) *FKS
() *F
(") *F K 1
(#) *FKfKS
Ans:-B
E43(ana!.n:- Although the %ommand a&&ears to loo+ li+e *F, it should be
understood as ls. There is no %ommand %alled *F anywhere i %ould thin+ of. ls
with a 01 o&tion will list only one entry &er line. Fo o&tion " is ruled out. The
&ur&ose of 0S o&tion is to sort out the list al&habeti%ally by entry e6tension.
The &ur&ose of 0f o&tion is not to sort the list al&habeti%ally. This o&tion also
&uts on the 0a o&tion. Fo all the files in%luding hidden ones will be dis&layed.
Fo what is the o&tion whi%h would list %olumnar listing of names.*t is a%tually
0". ut the out&ut of ls 0" and ls sim&ly mat%hes and so i have %hosen o&tion
as the right answer whi%h is ls itself. *f anyone has any other answer or
e6&lanation &lease &ost it and we %an dis%uss it.
!$. 2*C#(2F is a QQQQQQQQQ o&erating.
(A) Veal time
() Xulti0user
(") Rreem&tive
(#) Con0&reem&tive
E43(ana!.n:- * would straightaway go for the e6&lanation here. The -uestion
is a ty&i%al LN" Cet one intended to %onfuse the %andidates. 2*C#(2F is
s&e%ified, no s&e%ifi% version or anything is given. *f you %onsider windows !.6,
it was %oo&erative and non0&reem&tive. ut windows 55,CT and 2000 are
&reem&tive. 2indows !.6 was not multi0user. ut windows CT,2000 are multi0
user. Again windows !.6 %annot be %ategori;ed as a real time o&erating
system also. Fin%e the -uestion itself has got some ambiguity you %an %hoose
whatever o&tion whi%h you feel and +ee& your fingers %rossed about it. * would
not go with Veal time. Anything else i %ould go with. Rlease &ost any other
way of understanding this -uestion and the %orre%t answer for this. Till then, i
refrain from answering this -uestion.
!5. Rage ma+ing &ro%ess from main memory to dis+ is %alled
(A) *nterru&tion
() Termination
(") Fwa&&ing
(#) Cone of the above
Ans:-C
E43(ana!.n:- Fwa&&ing is one of the memory management te%hni-ues used
by the o&erating system. Fin%e the si;e of the VAX is limited and finite, all the
&ro%esses or &rograms to be e6e%uted %annot be made to fit in it. Fo the dis+
is also treated as an e6tension of the memory and is referred to as virtual
memory. The &age ma+ing &ro%ess from main memory to dis+ is %alled
swa&&ing.
.0.A #ead0lo%+ in an (&erating Fystem is
(A) #esirable &ro%ess
() Lndesirable &ro%ess
(") #efinite waiting &ro%ess
(#) All of the above
Ans:-B
E43(ana!.n:- #eadlo%+s are undesirable. *n a deadlo%+ situation, &ro%esses
never finish e6e%uting and system resour%es are tied u&, &reventing other Gobs
from ever starting. Fo the answer for this -uestion is .
.1. Rrototy&ing is used to
(A) test the software as an end &rodu%t
() e6&and design details
(") refine and establish re-uirements gathering
(#) Cone of the above
Ans:-C
E43(ana!.n:- Rrototy&ing is one of F#W" model. *t starts with re-uirement
gathering and establishing a -ui%+ &rototy&e whi%h is an early a&&ro6imation
of a final &rodu%t. This &rototy&e is then evaluated by the %ustomer1user and
used to refine the re-uirements for the software to be develo&ed. Fo, " is the
o&tion.
.2. 2hi%h one of these are not software maintenan%e a%tivity :
(A) 'rror %orre%tion
() Ada&tation
(") *m&lementation of 'nhan%ement
(#) 'stablishing s%o&e
Ans:-D
E43(ana!.n:- A%tually i have had my own doubts with the answer for this
-uestion. * have referred to lots of materials and &a&er and resolved the
%orre%t answer for this. A%%ording to Wient; and Fwanson, software
maintenan%e %an be divided into three %om&onents. %orre%tive, ada&tive and
&erfe%tive maintenan%e. "orre%tive maintenan%e involves %orre%ting errors or
a%tual faults in the software. Fo this is o&tion A. Ada&tive maintenan%e is the
%hanges needed as a %onse-uen%e of some %hange in the environment in
whi%h the system must o&erate. And this is o&tion . 8inally &erfe%tive
maintenan%e refers to %hanges that originate from user re-uests. *nfa%t
ada&tive and &erfe%tive %ategories %an be Goined together and %alled as
enhan%ements whi%h is o&tion ". Fo the only one whi%h is not tal+ed about is
o&tion # and so # is the right answer.
.!. The system s&e%ifi%ation is the first deliverable in the %om&uter system
engineering &ro%ess whi%h does not in%lude
(A) 8un%tional #es%ri&tion
() "ost
(") F%hedule
(#) Te%hni%al Analysis
Ans:-A
E43(ana!.n:- The system s&e%ifi%ation do%ument des%ribes the system and
gives a high0level view of what the system will &rovide. The system
s&e%ifi%ation is the guide that will allow details on hardware,software and test
re-uirements. Fo i thin+ fun%tional des%ri&tion will not be a &art of system
s&e%ifi%ation. Fo the %orre%t answer is A.
... The "("(X( model was introdu%ed in the boo+ title JFoftware
'ngineering '%onomi%sI authored by
(A) Abraham Filbers%hat;
() arry oehm
(") ".P. #ate
(#) #.'. 9nuth
Ans:-B
E43(ana!.n:- This is a fairly sim&le -uestion. "("(X( model was
introdu%ed in the boo+ authored by arry oehm. Fo the %orre%t answer is .
.5. The 2arnier diagram enables analyst
(A) to re&resent information hierar%hy in a %om&a%t manner
() to further identify re-uirement
(") to estimate the total %ost involved
(#) Cone of the above
Ans:-A
E43(ana!.n:- The 2arnier diagram enables analyst to re&resent information
hierar%hy in a %om&a%t manner. *t is also referred to as 2arnier0(rr diagram. *t
is a gra&hi% %harting te%hni-ue used in software engineering for system
analysis and design.
.3. A data mart may %ontain
(A) summarised data
() de0normali;ed data
(") aggregate de&artmental data
(#) All of the above
Ans:-D
E43(ana!.n:- #atawarehouses are huge. *f a de&artment has its own data
mart, it %an %ustomi;e the data as the data flows into the data mart from the
data warehouse. *t %an summari;e,sort,sele%t and stru%ture its own data.Fo
the o&tion would be #.
.7. #ata mining is
(A) the &ro%ess of e6tra%ting valid, &reviously un+nown, %om&rehensible and
a%tionable information from large databases and using it to ma+e %ru%ial
business de%isions.
() a tool that allows end users dire%t a%%ess and mani&ulation of data from
within data0 warehousing environment without the intervention of %ustomised
&rogramming a%tivity.
(" )a tool that hel&s end users e6tra%t useful business information from large
database.
(#)All of the above
Ans:-A
E43(ana!.n:- Fin%e it is a definition of #ata Xining whi%h is s&o+en about,
o&tion A is %orre%t.
.$. '0"hou&al refers to
(A) %alling meeting of Fur&an%hes ele%troni%ally.
() %ondu%ting Ran%hayat meeting using latest ele%troni% gadgets.
(") &roviding window of information to villagers and farmers in C*" networ+.
(#) Cone of the above
Ans:-C
E43(ana!.n:- '0"hou&al is an initiative by *T". Through this initiative they
want to em&ower the farmers with e6&ert +nowledge. This would enhan%e his
%om&etitiveness in the global mar+et.
.5. The basi% %on%e&ts of ethi%s in information so%iety is1are
(A) Ves&onsibility
() A%%ountability
(") Wiability
(#) All of the above
Ans:-D
E43(ana!.n:- Cothing mu%h. The basi% %on%e&ts of ethi%s in information
so%iety is1are Ves&onsibilty,A%%ountability and Wiability. * thin+ most of you
would have guessed it anyway.
50. (ne of the distinguished features of su&er0%om&uter over other %ategory
of %om&uter is
(A) &arallel &ro%essing
() highest a%%ura%y level
(") more s&eed
(#) more %a&a%ity
Ans:-A
E43(ana!.n:- (&tion is ruled out. ut all the other o&tions also loo+ similar
but sin%e they are as+ing about distinguished feature i would go with o&tion A.
Any other ideas &lease &ost.