-
7/30/2019 IT AUG-11
1/9
InformationTechnologytT}
Date:8thAugust, 011lnstructions:1.There re10 0questionsf onemarkeach.2.Attempt llquestions.
1. Which of he followingsorta) Mergesort
procedures akes he lowestaverage ime
Time:9.00am o 10.30 m
b) Heap ortd) Selectionortb) Restoreshe statusof the CPU fter afunction all
Q)Qul.t tott2.A monitor rograms a programha ta) lnterruptshe nterrupt allsc) lnterprets he input from a key boardan d fd-) Ctru.ls he statusof the l/O devicesconvert he input into its bi nary equivalent
3. Thestorage nanagementechnique which reqi.iires o ru n ime support sa) Dynamic torageallocation @ Staticstorageallocationc) Stackallocation f storage d) None of these
4. Ho w many NANDgatesare needed o perform he logicfunctionX.Y?a) t {nhzc ) 3 \ f q5.allgegistereferencenstructionhat us eaccumulatorreQ$ tmpliedmode nstruction b) Indirectmode nstructionc) Basedndex ddressing ode nstruction d) lmmediatemode nstruction
6. An attgciativememory s also called(aD contentaddressable emory
c) Mainmemory7. A grammar hat producesmore han one parse
b) Virtualmemoryd) Secondarymemorytree for somesentence s said o be
b) Unambiguous, { \ I \ l ^ h ^ ^ f + t - ^ - ^
8. The anguage onstructswhichare most useful n describing estedstructures uchas balancedparenthesis, atchingbegin-endetc. are ,o*rra) Regular xpression (*!)f Context re e grammarc) Non context re e grammar d) None of these
9.Theparsingtechniquehat avoidsback rackingsa) Top down parsingc) Predictive
L0 .The LRparsingmethod which isveryb) Recursive escentparsingd) both {b )an d (c )exDensiveo implement s
@Canon ica lLR pars ing) SimpleLRparsingc) LookaheadLRparsing1i.. r' l inimum ammingdistance
Q) SVntactic rrorsc) Algcr i thmic r rors12. Replacementf an expensive
a) Codemotionc) Loop nvariant omputation
1"3. eephole optimization s a form of. ai Loopoptimization
PGCET-11
d) Noneofthesemethod is used or correctionofb) Semanticrrorsd) Transcript ionrroroperation ya cheaper ne s ermedas
b) Reduction n strengthd) Noneof theseb) Localopt imizat ion
PageL of 9
-
7/30/2019 IT AUG-11
2/9
Informatlon TechnologylT)
c) Constantolding d) Data low analysis14.when an nverter splaced etweenboth nputsof anSR lip-flop,he resultinglip-flop s@ ,* fl ip lop b) D tip topc) T flip flop c) Master Slave K lip-flop
L5 .Th emaindifference(s)etween CISC nda RISCrocessors/are hat a RISCrocessorypicallya) iseasiero implement sing ard-wiredcontrologic\9}r'has more egisters
16.Whichof the following s/arecorrect?a) AnSQ L uery utomaticallyl iminatesduplicatesc) SQL ermits ttribute ameso b erepeatedn he same elation
1*"bfhas fewer nstructions
d) has eweraddressing,modes
b) AnSQL uerywill not work f there
23. Whichone of the followingcan not be a part of database ackage?a) unctionc)procedure24,Which ockallows nly eadoperationffi-slared lock\#xclusive lock25.Which f he ollowingsno t he characteristicf a Relationalatabase odel
arelqinciexes n he relationsLStlon" of heabove
Eblifpstefl ablesffiriggersb)deadlockd) noneof aboveb)Tree ikestructured) Records
17. In relationalSchema, ach upl e is divided n to f ieldscalleda) Relat ionsc) Domains
18. Whichof the following s he command for DDL.4,{3plterc) update19.Whichof the fol lowing s rue?a) A functionaldependency s alwaysa
multival ed dependency.c ) B o t h a & b a r e t r u e .
? O d o f i n i t i n n n f ( f t l E r . o ca) unctionaldependencyc) multivalued ependency
21. Datadictj-onarys a specialfile hat contains6)h" names f a l l ie lds n al l i lesYtftu width of al l ields n all f i les22. Banker's lgorithm or resource llocationdealswith
a) Deadlock reventionc) Deadlock ecovery
a)Tablesc)Complexogical elat ionships
26. WhichOperatorcannotbe overloaded n C+ +
b)Quer iesd)noneof theseb) selectd) deleteb) multivalvedependency s alwaysa afunctionaldependencyd ) b o t h a & b a r e f a l s e .
\PJjoin dependencyd) none of aboveb)the data ypes of all fields n all filesd) al l of thes" .,
ffieadlock avoidance\tlfvutualexclusion
PGCET-11 Page2 of 9
-
7/30/2019 IT AUG-11
3/9
a) !=27. Ther"S'u"pr.ssion*a) (1*0) 1*
Information Technology(lT)
b)++d)>=(10*)* denotes he sameset asc ) ( 0 + 1 ) * 1 0 ( 0 + 1 ) *28 .Assumehe ol lowing variable eclaration
b ) 0 + ( 0 + 1 0 ) *d) None fthe abovein t *A[1-0],B[10][10];of he ollowing xpressioni) ., At2l ii ) At2lt3l i i i ) Bt l l , v) bt2lt3lWhich will not givecompile ime error if used as eft handsideof the assignment tatementof C program
@ i , i i and v b ) i i , i i i andv
31. Which of the followingpage eplacementalgorithm suffersBelady's namoly_al Optimal age eplacement-4) rrro
32. An examole f soooled evice s afrnr(a)JLine pr interused o pr int he\rF outputof a numberof jobsc) Secondary'storageev ice n avirtualmemorysystem
33. Critical eg ion sa) A part of operatingsystemwhich is
nnt el lnrrrod t1 r t' g : ' : tgSSe:l b; , : : ; ,. processc) Th e portionof main memory
which can be accessed nly by oneprocess t a time34 Dirty bit is used o show he
d Pagewith corrupteddata/\.t- c) ) Page hat is modified after loadedinto cachememory
c ) i i and v29. A high paging ate
a) may causehigh / O ratec) is a symptomof too muchpi'ocessor ctivity30. producer onsumer roblem an be solvedusing
a) semaphoresc) monitors
A i vb) keepshe systemunningwell(40 always reates slowsystem
b) event ountersd) a l loftheseb) LRUd) Both(a)an d (c )b) Terminal sed o enter nput data
to a running rogramd) Graphics isplay evice
b) A set of instruction hat access:c;;:oi, :ha;cd ;c;c;;ce ;;h;ci,excludes ne another n a t ime
d) Noneofthe above
b) Th ewrong page n the memoryd) Page hat is ess requently
accessedb) Latencv
4D trrnr*ission imeb) Unauthorizedmodificationof datad) All of these
b) Low-end tandalonehubsd) Mesh network
35. Time total to preparea disk mechanism or a blockof data o be read rom it isa) Seek imec) Latency lusseek ime
36. Malicious ccess rea) Unauthor izedeading f datac) Unauthorized estructionof data
37 .which if th$Rt{owing s not relevant o networking[g}} MasterSlaveBu sSystemc) Stackable ubs
38 . Which of the followingTCP/IP rotocol s used o monitor Pgateway and he network storage o
PGCET-11 Page3 of.9
-
7/30/2019 IT AUG-11
4/9
InformationTechnologylT)
which hey attachedS:r,39 .CSMA CD a) san mportantprotocol[.T]otr, (a)and b)v40. The opologywithhighesteiiabiiitysa)busc) ring41. End o end connectivitysprovidedrom host o host n thea) network ayerc) sessionayer
42 . Frequencyange t which he LAN o-axialablewill used sa)106Hz o 108 zy'frln, Hz o to4Hzu/,""43. n a broad ense railwayrack sanexample fa)simplexc)ful lduplex
a) ixed engthstoragestructure,'fitint"o ist torage
b) FrPd) noneoftheseb) s EEE02.3 Ethernet)d) Noneoftheseb) star
ffirone of heseb) 1o1o z o 1011 zd) 1014Hz o 1o1slzW;:L'l*::
46.The ime required o insertan element n a stackwith l inked mplementat ionsa)o(1) b)o(loe2n)'?Dotnt d)o{n oe2n)47 .Which f Hfollowing orting lgorithmasheworst imecomplexityf n ogn?a)quickort ff i""n tonc)shellsort Y) bubbleort48. How manyvalues anbe heldby an arrayA(-1. .m,1. .m)a)m hI* 'c)m(m+1) ;$m(m+2)49.Theminimum umber f comparisonequiredo sort 5 elementsa ) 66fls50 .Whichof thts6llowing tatementf false?a) Everyree sa bipartite raphc)A reewith n nodes ontains -1
ffi:"#,-
b) variable engthstoragewithfixedmaximumd) array yp e storage
b)10d)14
J D \){ t ' i( l - { d
7 b
I 'i l,-.'(
l u1 / .I {
GlA rr"" containscycte$a tr"u sa connectedraph.edges51. In C programming anguage,f th e first an d secondoperandsof the operator+ are of types nt andf loatrespectively,he resultwillbe of ypea) ntc)char52 .Whichof th e ollowing tatementsrovideskip he remainingortion ndgowith next teration?
ffineshb) ransportayer
44.fhe variable hich anbeaccessedy allmodulesn a program reknown sa) ocal ariables b) nternalvariablesff i lxternal variables d)globalvariable45. n whatkintdf storage tructureor strings necaneasilynsert, elete, oncatenatend rearrangesubstr ings
t ii . . --) 1-, 'jI' . i' 1 t {
PGCET-11 Page4 of 9
-
7/30/2019 IT AUG-11
5/9
Information echnology T)
ai eisec) return53 .Recursiveunctions reexecutedn a(!Dtrooroe,.c)paral le lashion54.Average uccessfulearchim e or sequentialearchor n items sil nlz b) n-rl/z
@n+r)/z d)none f hese55. he expressi6'i hichaccesshe (ij)thentryof m X n matrixstored n columnmajor orm s
frlrecisid)w id th (
| // What s he result f attemptingo compile nd un he program?lf.Rrints
othings b)Compile-timerrorI c)lrints 0 d) noneof hese62 .public lass\fultiDatapublic tatic oidmain(Stringrgv[])int[] j a1= ii1-,2,31,{4,5,61,{7,8,9,1Ol1};System.out.rint{a [0][2] ", +a 1] 0]+",+a 2] 1] ;)I I Whatis he result f attemptingto ompile nd un he program?
@ntinu"d) go tob) FIFO rderd) all ofthe above
a)m* ( j - L )+ ifrm*(n-11+i56.Thepostfix${ryivalentf heprefix +ab-cdis{gDb*.d-*c) ab+cd*-
E 7 l i / k - + : - ^ ^ h i ^ , , ^ , . 1 1 ^ . , + l - ^ t ^ l l ^ , . , : ^ - l ^ ^ l ^ - ^ . i ^ - : - - r ^ - -J t . u v t t o L r ) o L r l s v s u v y t i l c t u i l u w t i l 6 u c L t d t d L t u i l i l t L t d 5 5 5 t I u L t u t evoid operator++0c++;
r^h )tg}* overtoadedc)syntax rror58. Th e ollowing ios unction will set h e irumberof decimalplacesa) setprecision0t=.efSetw{)59. A pure virtual function n C+ +can be declared s
u'"g)} i r tuaivoiddisplayi) 0;c) virtual void display{) null;60 .Th e function in C++ s expanded n the l inewhen it is calleda) macro unct ionqf i?,5r i^- rrrnrr inn\,961. publ ic classMEExam
publicstaticvoid main (String[j arev)in l x, y ,z;] System.out.println(x+y+z);
a)Prints:7,2,6c) runtime rror
b) ++ over ridingd) invalid eturn ype
on0)b)pure irtualvoidisplay0 nul ld) pure irtual oiddisplayfl g'b) r iendunctionl \ r . ; . + . , ^ l f , , - ^ + i ^ -
.-b| compileim eerrorA Prints:3,4,8
b) n*(i-1)+jd)n*(m- i)+jb) abcd+-*d) ab+-cd*
. tr, 4 cl., i.:;
.)'o'
63. Which of the followingare modifiers hat can be applied o an interface hat is amember of a directlyenclosingnterface?PGCET-11 Page5 of 9
-
7/30/2019 IT AUG-11
6/9
InformationTechnology lT)
a) abstractc ) f ina l64 .Which f the followingmodifiersanbeappliedo a ocal lass?
/ifiubricYabstract
a) evolutionaryc) Spiral
65.Which f the followingmethodsstaticmembers f the Thread lass?ftlun b)steep\rfstart d)(b)66.Theclean oom strategy s based n he hissoftwareprocessmodel.
b)implementsd) privateb ) c & dd) inal
b)incrementald) Waterfall67 .Which box specif ication escribes n abstraction, t imuli,and response$Jr$lack ox b)clear oxlfrt"tu bo* d)white ox68. n terms of software engineeringCMM stands ora) convenientmaturity model
c) cohesivematurity model69. Unsafe eyword n Cf is used or writingcode witha) pointersc) both {a)& (b)70. cs ccompiler s used or compil ing
apabil i tymaturitymodel
g) C program b) C++programft# progr",.n,*r, . rrogram d) JavaProgram71. Which ag is used o create nline ogical lock or styl ing ogicgroup of elements n HTML?b)d)72. ln C# ,which operator s used o checkwhetheran object is compatiblewith specific yp e or not?
d) noneof aboveb) databased) none ofthese
b) asd) +=b) HRd) noneof these
b)uNrxdlas 2
@"p,n'c)
a) Gives ll submittedob o the obschedulert cp Select processo run76.Paral leldders reff i Combinationalogic ircuit.ff ao*r a)& (b)77 .Merse ort uses.gl -(f Divide ndconquer trategy-e ) Hearisticearch
a, ls- \ , .73. Which on e of following s not supported echnologyof ERpa) Fl-CO
c) MRP-l l74.Single s_erperat ing ystem s @,rioos
c)XENIX75 .Theprocesschedulern he processor anagementnitb) Selecta jo b to rund) Coordinates he process ynchronizationb) Sequential ogiccircuit.d) Noneof above.
b) Back racking pproachd) Greedy approach78. f n is a powerof 2, hen he minimumnumberof mult ip l icat ion are needed o computean sPGCET-11 Page5 o,f9
-
7/30/2019 IT AUG-11
7/9
lnformation echnokogylT)
@)) Log2nc) n-L79. cons reA TYPeOommandQ) Picture ommand80 .l$lRconfiguration f diskar eused o providef a)' lauit tolerance-d;fHigr, data density
81 w=logz is analytic verywhereexcept t' ( a l z : 0 ( b l . z = l ( c ) z = - l
' r d z | |82 The a lue fJ _ , , C be ingl t l=Z i tC .(a\ r (b) rci (cj 2n i (d't n
83 The ransformation= cz consist f(a ) t rans la t ion .(c) otation.
(b ) magnif icationnd rotation.(d)none.
(c ) 1 td)2I J(z -l)'?(z + 2)
b) Vnd) nb) Verbalcommandd) lmaginaryommandb) High peedd) Noneofthese
( d lz : 2
(d)noneofthese.
rhevaluetn"[Y]j !dz,where C isthecirctelzl=!t s(a )1 tb)0
2z85 The es idue t z : -2 o f f ( z )=
1 ) 4 5( a ) ( b ) ( c ) ( d ) :9 " 9 " 9 " 9
IThevalueof Jx(l - x)n'dxis0," * ( b ) 1 1' ' 1 0 1 0 0 tt'*hPGCET-11 Page of 9
-
7/30/2019 IT AUG-11
8/9
? _ . . , .87 le-"x"dx sequal oJ0(a)2 (b)4
InformationTechnologylT)
( c ) 6 (d)1
(cl n' (d l n (n- l )88
89
The n'nderivativeof x' is(at @,,The imit lo*" ,, r -+ 0 iscot -r
91
( a ) o (b )1 (c)290 At hepoint,x 0,_the unction-r, l" l it
(a)continuousnddifferentiable.
(a)Newton'squation.(c)Euler 'squation.
( d ) - 1
(b )continuousand not differentiable.
(b)Heatequat ion.(d)noneof above.
(c)discontinuousndnot differentiable.(d)iscontinuousnddifferentiable.rlvTheequation7 + Py : Qy" whereP andQ are unctions f x isca le ddx
(b)Leibniz 'squation.@ernoutl i 's equation.
Theequat ion3*# = 0 is knownasdx' dy'(a)Waveequat ion.
,-\( j fanlace equat ion'
The Laplaceransform of es' is
92
93
t . l 1s (b)r - ) 1.1J-s + 5 (d)) - . 994 Th eorder of convergence f Newton-Raphson ethod s
( a ) oPGCET-11
{c)2 (d)none.Page8 of 9
(b )3
-
7/30/2019 IT AUG-11
9/9
Information TechnologylT)
t ;Trre ahrc f t ?atsimpson's rule'sd +. r{a}o-5931s {b}o.6e3s1 {c}o.6391s
[ r 2 3 1The ank f hemat r i xq : l | 4 z l i slz 6 sl( a ) 1 ( b ) 3 ( c ) 2 ( d ) 0
[ r 2The sum of the ei genvalues f ttre matrix = | 2 1
[ : 2(a ) (b) (c l7 (d)
(d)o.9631s
Themedian f the numbers9,l2,l3,lQl I is(a) 12-5 (b) 12 (c)1o.s (d) 11
97 The mean of the Binomial distribution with n observations and probability of success p is(a l np (bl pq t' tJ"p @t,lw
tf F isSolenoidalthen F is eqrialto( a ) ( b ) 2 (c )3 (d)0
100^ l1 lt0 l i sI- l
PGCET-11 Page9 of 9
