DECEMBER 2010 PAPER SOLVED 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 degree ()All of odd degree") f any degree (#)even in number Ans:Ans:- A. Ar%n" ! E/(ers !here 1* a "rah s /n%re!e% !hen ! has an e/(eran r/! an% n() ! s nne!e% an% eah 'er!e4 has an e'en %e"ree.*t %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. above.Ans:Ans:- C. . The minimum number of edges in a %onne%ted gra&h with /n/ verti%es is e-ual to A)n(n1) ()n(n1)2")n2 (#)n1Ans:(#)n1Ans:- D. The r/(a r /n!n" !he n/ n/#er e%"es n a nne!e% "rah s 5n-16. 5. ould be done later later..... ..... 3. The de%imal number e-uivalent of (057.03)$ is 4A) 205.75 ()205.075 ") 205.!7 (#)205.0!75 (#)205.0!75Ans:Ans:- D. 7. ould be done later later... ... $. An astable multivibrator has A)one stable state ()two stable states")no stable states (#)none of these theseAns:Ans:- C. An as!a#(e /(!'#ra!r has !$ s!a!es #/! ne!her !he are s!a#(e. .12bit 2/s %om&lement of 7!.75 7!.75 is A) 01001001.1100 01001001.1100 ()1 ()11001001.1 1001001.1100") 100") 10110110.0100 (#)10110110.1100Ans:(#)10110110.1100Ans:- B 10. 'n%oding of data bits 001 0011 1 into 7bit even &arity amming %ode is A)0011 A)001 1110 ()0101 ()01011 110")00101 10")0010110 10 (#)001 (#)0011 1100 100Ans:Ans:- A. The e6&lanation is -uite lengthy. lengthy. *f you google the -uestion, you would get a lin+ to the boo+ 8undamentals of digital %ir%uit by A.Anand 9umar. 9umar. The e6&lanation is great there. 11. ow many of the th e following de%larations are %orre%t:int ;<7.0= ; <7.0= double void<0.000=short void<0.000=short array>2?<@0,1,2=%har %<Bn=(A) Cone ()ne is %orre%t(") Two Two are %orre%t (#)All four are %orre%tAns:-The %orre%tAns:-The sen% %e(ara!n s r s/re $rn" #ea/se $e ann! ha'e a 7e)$r% as a
'ara#(e nae. The (as! %e(ara!n s a(s $rn" #ea/se $e ann! ass"n an)!hn" $!hn %/#(e 8/!es ! a hara!er 'ara#(e. S $e are (e! $!h n() !he rs! an% !he arra) %e(ara!n.I !hn7 !hse !$ $/(% s!(( n! "'e errrs n . S C /(% #e !he ans$er r !hs 8/es!n. 12. The value of the following e6&ression (1! !) D 5 E 1 is (A) 5.75 () 2.5 (") 1.$75 (#) 5 The answer is 5D6 E4(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 ", and D &re%edes that of E and . 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! !). Fin%e all these o&erators &re%eden%e is the same, they would e6e%ute from left to right and so 1! gets e6e%uted first. 1! < ! This intermediate answer is multi&lied with ! in order to get the answer . ! ! < The ne6t e6&ression would be D 5. The result is .D is the mod o&erator. *t gives the remainder of dividing t wo numbers. 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!.hi%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 tri%+ y ones. *n this -uestion - 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 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. m e. 1. hi%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 use d in &la%e of a while loo&. loo&.Ans:-B Ans:-B E4(ana!n:- Fin%e this -uestion is a very sim&le and easy one i am &osting E4(ana!n:- Fin%e the answer for this also today. today. therwise my idea was to ta+e one -uestion, e6&lore it, analy;e and then try to &resent the answer ans wer.. 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. la%+I refers in the Jla%+bo6I testing means (A) "hara%ters of the movie Jla%+I () *K is hidden (") #esign is hidden (#) Lsers are hidden E4(ana!n:-8or obvious reasons, o&tion A is ruled out. Cow let us loo+ at E4(ana!n:-8or the meaning of bla%+ bo6 testing. The term la%+ bo6 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) Testing 2. '-uivalen%e "lass Testing 3. #e%ision Table Table based testing Te%hni-ue 4. "ause'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 theseAns:-B E4(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&down() bottom u&(") both (A) O ()(#) Cone of these The answer of %ourse is B, Neneralisation is a bottom u& &ro%ess.T &ro%ess.To o summarise, Neneralisation ottom u& #ifferen%es between members of an entity is minimi;ed.F&e%ialisation To& To& down #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 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 E4(ana!n:- The -uestion itself re-uires a bit of e6&lanation. *t is not enough E4(ana!n:- The 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. lengthy. Wet us first disse%t the -uestion and e6&lain some terms in terms of #XF. Des!n This means re&la%ing a relation with a %olle%tion of smaller Des!n relations. Re(a!n Re(a!n Velation is +nown as Table.Re(a!n Table.Re(a!n Shea Shea This is +nown as Table Table definition. Velation F%hema for a student relation %an be shown in the following way4
Ftudent(8irstCame,WastCame,#,Nender,"ourse,Vegno,Address) Den!n Deen%en) reser'a!n %es!n:'a%h %es!n: '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 AY8#24 Y"8#!4 "Y#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 Conde&enden%y &reservationWet V be a relation V(A " #) Wet there be again ! fun%tional de&enden%ies.8#14AY 8#24Y"8#!4"Y#Wet the relation be de%om&osed into t wo 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 de&enden%y.Nenerally .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 t wo or more smaller relations. The fun%tional de&enden%y SYU 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$. hi%h of the following is an o&timisti% %on%urren%y %ontrol method : (A) Malidation based () Time stam& ordering (") Wo%+based (#) Cone of these E4(ana!n:-
*n order to +now the answer for this let us first go through what %on%urren%y %ontrol means. hen 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. Tere 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 Feriali;ation gra&h testing 2. 3. Wo%+ing methods 2. &timisti% methods 1. a%+ward validation methods 2. 8orward validation methods ybrid methods 3. 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%+free whereas &essimisti% method is deadlo%+&rone. e %an loo+ at it in detail de&ending on any -uestion whi%h we will %ome % ome a%ross in future. *n Gune 2011 2011 &a&er ** we had the following -uestion. The basi% variants of timestam& based method of %on%urren%y %ontrol are (A) Total Total time stam&ordering () Rartial time stam& ordering (") Xultiversion Time stam& ordering (#) All of the above e will loo+ at all su%h -uestions later. later. Ans:-A 1. &ti%al storage is a (A) highs&eed dire%t a%%ess storage devi%e. () lows&eed dire%t a%%ess storage devi%e. (") mediums&eed dire%t a%%ess storage devi%e. (#) highs&eed se-uential a%%ess storage devi%e. Ans:-B E4(ana!n: A%tually the same -uestion is available in the boo+ #atabase systems4"on%e&ts, #esign and a&&li%ation 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 heavier,, #M# and "# drives have mu%h longer
see+ time as %om&ared to magneti%dis+ 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. hi%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 E4(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 A/!hen!a!n is is the &ro%ess by whi%h a user/s identity is %he%+ed.A/!hr;a!n %he%+ed. A/!hr;a!n is is the &ro%ess by whi%h the user/s &rivileges are as%ertained. Aess n!r( is 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. hat is the ma6imum number of nodes in a tree of order 10 of de&th ! (root at de&th 0) : (A) 111 () (") (#) Cone of the above Ans:-C E4(ana!n:- The formula for %al%ulating the ma6imum number of nodes in a E4(ana!n:- The tree of order order n of de&th h is mhE11ere, m<10 and h<!. Fo the formula be%omes 101 whi%h is 100001< 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
E4(ana!n:-This is -uite a straightforward one. A binary tree with n nodes E4(ana!n:-This has nE1 null bran%hes. Fo a binary tree with 27 nodes will have 2$ null bran%hes. Fin%e 2$ is not available av ailable as a o&tion, # is the %orre%t answer.There is some -uestion based on binary trees or trees in most m ost 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:-CE4(ana!n:theseAns:-CE4(ana!n:The number of different trees with n nodes %an be %al%ulated as 2nn. ere the value of n<$. Fo, the formula would be%ome2$$<253$<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 E4(ana!n:-The VFT "AF' "XRW'S*TU to build a hea& of n E4(ana!n:-The elements is the o&tion ". 2. Winear &robing suffers from a &roblem +nown +no wn as (A) Fe%ondary %lustering () Rrimary %lustering (") oth (A) and () (#) Cone of these Ans:-B E4(ana!n:- Winear &robing is a term asso%iated E4(ana!n:- Winear asso%i ated with hashing. Winear &robing is a %ollision resolving te%hni-ue in hashing. h ashing. *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. hi%h of the following %an be the se-uen%e of nodes e6amined in binary
sear%h tree while sear%hing for +ey $$ : (A) 0, 0, 35, 50, $$ () 0, 110, $0, $5, $$ (") 10, 30, 0, $5, $$ (#) 35, 10, $0, 70, $$ Ans:-C E4(ana!n:- *norder to find a solution for a -uestion li+e above, given the E4(ana!n:- *norder 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 t he tree and any value greater than the root will form the right side of the tree. hen 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 E4(ana!n:- 8re-uen%y shift +eying is a method of transmitting digital E4(ana!n:- 8re-uen%y signals.8F9 was mostly used in telegra&hy 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 E4(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
2. hi%h of the following file transfer &roto%ols use T"R and establishes t wo virtual %ir%uits between the lo%al and remote server : (A) 8TR () T8TR (") T'WC'T (#) C8F Ans:-A E4(ana!n:- There %ould be a ambiguity between the o&tions A and for E4(ana!n:- There 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 T8TR f rom a remote host. ut T8TR stands for trivial file transfer &roto%ol. *t is not very reliable or se%ure. *t uses the t he &a%+et delivery servi%e offered by L#R L# R. n the other hand, 8TR stands for 8ile Transfer Rroto%ol. *t is a me%hanism &rovided by T"R*R T"R*R.. *t uses the servi%es offered by T"R. T"R. *t is reliable and se%ure. *t establishes two t wo %onne%tions(virtual %ir%uits)between the hosts, one for data transfer and another for %ontrol information. Fo the th e 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. 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 E4(ana!n:- Again E4(ana!n:- Agai n 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 E4(ana!n:-Woo+ing at all the other o&tions, the only one whi%h seems more E4(ana!n:-Woo+ing a&&ro&riate is o&tion o &tion A.
!!. Nrammar of the &rogramming is %he%+ed at QQQQQQQQ &hase of %om&iler %om&iler.. (A) semanti% analysis () %ode generation (") synta6 analysis (#) %ode o&timi;ation Ans:-C E4(ana!n:- The following are the main &hases of a %om&iler and the E4(ana!n:- The a%tivities done in ea%h one of the &hases.1.Le4a( &hases.1.Le4a( Ana()ss:-*n Ana()ss:- *n this &hase the sour%e &rogram is s&lit into what are %alled /to+ens/.2.S)n!a4 /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, grammar.Cormally, one of the out&uts out &uts of a synta6 analysis anal ysis &hase would be a Abstra%t Fynta6 Tree.(AFT)!.Sean! Tree.(AFT)!.Sean! Ana()ss:-This Ana()ss:-This &hase would traverse through the AFT and refine it..In!ere%a!e it..In!ere%a!e %e "enera!n:-This "enera!n:This &hase generates a ma%hine m a%hine inde&endent %ode.5.C%e %ode.5.C%e !;a!n:-Lse !;a!n:Lse some strategies to o&timi;e the %ode that is generated. 3.C%e 3. C%e "enera!n:-Nenerate "enera!n:-Nenerate the ma%hine de&endent %ode finally.Fymbol 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%ro&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 E4(ana!n:-MFAX stands for Mirtual Ftorage A%%ess Xethod. *t was E4(ana!n:-MFAX 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. hi%h of the following %ommand the file names in multi&le %olumns : (A) *FKS () *F (") *F K 1 (#) *FKfKS Ans:-B E4(ana!n:- Although E4(ana!n:- Althou gh 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 1 o&tion will list only one entry &er line. Fo o&tion " is ruled out. The &ur&ose of S o&tion is to sort out the list al&habeti%ally by entry e6tension.
The &ur&ose of f o&tion is not to sort the list al&habeti%ally. al&habeti%ally. This o&tion also &uts on the a 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 ". ut the out&ut of ls " 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.
!$. *C#F is a QQQQQQQQQ o&erating. (A) Veal time () Xultiuser (") Rreem&tive (#) Con&reem&tive E4(ana!n:- * E4(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. *C#F is s&e%ified, no s&e%ifi% version or anything is given. *f you %onsider windows !.6, it was %oo&erative and non&reem&tive. ut windows 5,CT and 2000 are &reem&tive. indows !.6 was not multiuser. ut windows CT CT,2000 ,2000 are multi user.. Again windows !.6 %annot be %ategori;ed as a real time o&erating user 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. t ime. Anything 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.
!. Rage ma+ing &ro%ess from main memory to dis+ is %alled (A) *nterru&tion () Termination (") Fwa&&ing (#) Cone of the above Ans:-C E4(ana!n:- Fwa&&ing is one of the memory management te%hni-ues used E4(ana!n:- Fwa&&ing 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 memory swa&&ing.
0.A #eadlo%+ in an &erating Fystem is (A) #esirable &ro%ess
() Lndesirable &ro%ess (") #efinite waiting &ro%ess (#) All of the above Ans:-B E4(ana!n:- #eadlo%+s are undesirable. *n a deadlo%+ situation, &ro%esses E4(ana!n:- #eadlo%+s 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 E4(ana!n:- Rrototy&ing is one of F#W" model. *t starts with re-uirement E4(ana!n:- Rrototy&ing 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 %ustomeruser and used to refine the re-uirements for the software to be develo&ed. Fo, " is the o&tion.
2. hi%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 E4(ana!n:- A%tually i have had my own doubts with the answer for this E4(ana!n:- A%tually -uestion. * have referred to lots of materials and &a&er and resolved the %orre%t answer for this. A%%ording to Wient; and Fwanson, s oftware 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. s oftware. 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 m ust 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 E4(ana!n:- The system s&e%ifi%ation do%ument des%ribes the system and E4(ana!n:- The gives a highlevel 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 t he boo+ title JFoftware 'ngineering '%onomi%sI authored by (A) Abraham Filbers%hat; () arry oehm (") ".P. #ate (#) #.'. 9nuth Ans:-B E4(ana!n:- This is a fairly sim&le -uestion. E4(ana!n:- This - uestion. ""X model was introdu%ed in the boo+ authored by arry oehm. Fo the %orre%t answer is .
5. The arnier 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 E4(ana!n:- The arnier diagram enables analyst to re&resent information E4(ana!n:- The hierar%hy in a %om&a%t manner. *t is also referred to t o as arnierrr 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 () denormali;ed data (") aggregate de&artmental data (#) All of the above Ans:-D E4(ana!n:- #atawarehouses are huge. *f a de&artment has its own data E4(ana!n:- #atawarehouses 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 data warehousing environment without the intervention of %ustomised &rogramming a%tivity a%tivity.. (" )a tool that hel&s end users e6tra%t useful business information from large database. (#)All of the above Ans:-A E4(ana!n:- Fin%e it is a definition of #ata Xining whi%h is s&o+en about, E4(ana!n:- Fin%e o&tion A is %orre%t.
$. '"hou&al refers to (A) %alling meeting of Fur&an%hes ele%troni%ally. 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 E4(ana!n:- '"hou&al is an initiative by *T". Through this initiative they E4(ana!n:- '"hou&al want to em&ower the farmers fa rmers with e6&ert +nowledge. This would enhan%e his %om&etitiveness in the global mar+et.
. The basi% %on%e&ts of ethi%s in information so%iety isare (A) Ves&onsibility () A%%ountability
(") Wiability (#) All of the above Ans:-D E4(ana!n:- Cothing mu%h. The basi% %on%e&ts of ethi%s in information E4(ana!n:- Cothing so%iety isare Ves&onsibilty Ves& onsibilty,A%%ountability ,A%%ountability and Wiability. * thin+ most of you would have guessed it anyway. anyway.
50. ne of the distinguished features of su&er%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 E4(ana!n:- &tion is ruled out. ut all the other o&tions also loo+ similar E4(ana!n:- &tion but sin%e they are as+ing about distinguished feature i would go with o&tion A. Any other ideas &lease &ost.