Information Technology {tT}

2011 Date:8th August, lnstructions: of one markeach. are100questions 1.There 2. Attemptallquestions.

Time:9.00am to 10.30am

time 1. Which of the following sort procedurestakesthe lowestaverage sort b) Heap a) Merge sort

tott Q)Qul.t that is a program 2. A monitorprogram the interruptcalls a) lnterrupts

sort d) Selection after a the statusof the CPU b) Restores function call

Ctru.ls the status of the l/O devices c) lnterpretsthe input from a key board and fd-) convertthe input into its binary equivalent no run time support is technique which reqi.iires 3. The storagernanagement Staticstorageallocation a) Dynamicstorageallocation @ None of these d) of storage c) Stackallocation perform logic the 4. How many NANDgates are needed to function X.Y?

a) t c) 3

{nhz \fq

are instruction that useaccumulator reference 5. allgegister modeinstruction b) Indirect instruction mode tmplied Q$ modeinstruction d) lmmediate modeinstruction addressing index c) Based
6. An attgciativememory is also called ( a D c o n t e n ta d d r e s s a b l e b) Virtual memory memory memory d) Secondary c) Mainmemory m o r e t h a n o n e p a r s etree for some sentenceis said to be that produces 7. A grammar b) Unambiguous
,{\ I\l^h^ ^f +t-^-^

nestedstructuressuch as balanced constructswhichare most usefulin describing 8. The language parenthesis, etc. are begin-end matching ,o*rr (*!)f Contextfree grammar expression a) Regular d) None of these c) Non contextfree grammar h a t a v o i d sb a c kt r a c k i n gi s 9 . T h e p a r s i n g t e c h n i q ute descent parsing b) Recursive a) Top down parsing d) both {b) and (c) c) Predictive to implementis L0.The LRparsingmethod which is very exDensive parsing parsing . a) SimpleLR @CanonicalLR o f t h e s e p a r s i n g d ) N o n e c ) L o o ka h e a dL R 1i.. lr'linimumhammingdistancemethod is used for correction of

errors b) Semantic SVntactic errors Q) error d) Transcription errors c) Algcrithmic oneis termedas by a cheaper operation otf a n e x p e n s i v e 12. Replacemen b) Reductionin strength a) Codemotion None of these d) c) Loopinvariantcomputation 1"3. Peephole optimizationis a form of b) Localoptimization . ai Loopoptimization
PGCET-11 PageL of 9

(lT) I nformatlon Technology

c) Constant folding d) Dataflow analysis 14. when an inverteris placed betweenboth inputsof an SRflip-flop, the resulting flip-flop is ,* flip flop b) ftip ftop D @ c) T flip flop c) Master Slave K flip-flop L5.Themaindifference(s) processor between processor a CISC and a RISC is/are that a RISC typically a) is easier to implement usinghardfewer i nstructions 1*"bfhas wiredcontrol logic \9}r'has moreregisters 16.Whichof the followingis/arecorrect? queryautomatically a) An SQL eliminates duplicates permits c) SQL attribute names to be repeated in the samerelation d) hasfeweraddressing,modes

querywill not work if there b) An SQL arelqinciexes on the relations of the above LStlon"

17. In relationalSchema, eachtuple is divided in to fieldscalled a) Relations b)Queries c) Domains d ) n o n eo f t h e s e 18. Which of the following is the command for DDL .4, b) select {3plter c) update d) delete 1 9 . W h i c ho f t h e f o l l o w i n g i st r u e ? a) A functionaldependencyis alwaysa b) multivalvedependencyis always a a multivalued dependency. functionaldependency c)Botha&baretrue. d)botha&barefalse.
?O dofinitinn nf (ftlE r '.oc

a) functionaldependency \PJjoin dependency c) multivalueddependency d) none of above 21. Datadictj-onary is a specialfilethat contains b)the data types of all fields in all files 6 ) h " n a m e so f a l l f i e l d si n a l l f i l e s d) all of thes" Ytftu width of all fields in all files ., 22. Banker's algorithmfor resourceallocationdealswith a) Deadlockprevention ffieadlock avoidance \tlfvutual c) Deadlockrecovery exclusion 23. Which one of the followingcan not be a part of database package?

a) function Eblifpstefltables c) procedure ffiriggers 24,Whichlockallows onlyreadoperation b)deadlock ffi-slared lock \#xclusive lock d) none of above 25.Whichof the following is not the characteristic of a Relational database model a)Tables b) Treelikestructure c)Complex l o g i c ar l elationships d) Records
26. Which Operatorcannot be overloadedin C++

PGCET-11

Page 2 of 9

I nformation Technology (lT)

a) !=

27. Ther"S'u"pr.ssion o * (10*)* denotes the same set as

b)++ d)>=

a) (1*0)* 1* b) 0+(0+10)* c) (0+1)*10(0+1)* d) Noneofthe above 28. Assume the following c variable declaration int *A[1-0], B[10][10]; expression , of the following ii) i) At2lt3l iii) Btll ., At2l , iv) bt2lt3l
Which will not give compiletime error if used as left hand side of the assignment statement of C program i , i i a n di v b ) i i , i i i a n d i v @ c) iiandiv A i v 29. A high pagingrate a) may causehigh l/O rate b) keeps running well the system (40 c) is a symptom of too much always creates a slowsystem pi'ocessor activity p r o b l e mc a n b e s o l v e du s i n g 30. producer consumer a) semaphores b) eventcounters c) monitors d) allofthese 31. Which of the following page replacementalgorithm suffersBelady's anamoly page replacement b) LRU _al Optimal -4) rrro d) Both (a) and (c) of soooled d e v i c ei s a 32. An examole frnr ( a ) J L i n e p r i n t e ru s e dt o p r i n t t h e b ) T e r m i n au l s e dt o e n t e r i n p u t d a t a \rF o u t p u t o f a n u m b e ro f j o b s t o a r u n n i n gp r o g r a m c) Secondary'storad g e v i c ei n a d ) G r a p h i cd sisplay device virtual memory system 33. Criticalregionis a) A part of operatingsystem which is b) A set of instructionthat access nnt ellnrrrod t1r t'g :':tgSSe:l b;, ::;, :c;;:oi, :ha;cd ;c;c;;ce ;;h;ci, process e xcludes o n e a n o t h e ri n a t i m e . d ) N o n eo f t h e a b o v e c) The portion of main memory which can be accessed only by one process at a time 34 Dirty bit is usedto show the b) The wrong page in the memory d Pagewith corrupted data /\. t- c) ) Pagethat is modified after loaded d) Pagethat is lessfrequently into cachememory accessed 35. Time total to preparea disk mechanismfor a block of data to be read from it is a ) S e e kt i m e b) Latencv c) Latencyplus seektime 4D trrnr*ission time 36. Maliciousaccess are a ) U n a u t h o r i z er de a d i n go f d a t a b) Unauthorized modificationof data destructionof data d) All of these c) Unauthorized 37. which if th$Rt{owing is not relevantto networking MasterSlaveBusSystem b) Low-end s t a n da l o n e h u b s [g}} c) Stackable hubs d) Mesh network 38. Which of the followingTCP/IPprotocol is used to monitor lP gate way and the network storageto

PGCET-11

Page 3 of.9

InformationTechnology {lT)

whichthey attached

39. CSMA / CD.

S:r,

b) FrP d) noneofthese

a) is an importantprotocol (Ethernet) b) is IEEE 802.3 (a)and (b) d) Noneofthese [.T]otr, v with highest 40. Thetopology reiiabiiity is a) bus b) star c) ring ffinesh 41. Endto end connectivity is provided from hostto host in the a) network layer b) transport layer c) session layer ofthese ffirone 42. Frequency range at whichthe LAN co-axial cablewill usedis a) 106 Hzto 108 Hz b) 1o1o Hz to 1011 Hz y'frln, Hzto to4Hz d) 1014 Hz to 1o1s llz u/,"" 43. in a broadsense a railway trackis an example of a) simplex c)fullduplex 44.fhe variable whichcanbe accessed by all modules in a program areknownas a) local variables b) internalvariables variables globalvariable d) ffilxternal 45. In what kintdf storage structure for strings one caneasily insert, delete, concatenate and rearrange substrings

W;:L'l*::

b) variablelength storagewith fixed maximum ,'fitint"o liststorage d) arraytype storage 46.The time required t o i n s e r ta n e l e m e n ti n a s t a c kw i t h l i n k e di m p l e m e n t a t i o n is

a) fixed lengthstoragestructure

b)o(loe2n) d)o{n toe2n) 47.Which of tHfollowing sorting algorithm has theworst timecomplexity of n logn? a)quick sort ton ffi""n c)shellsort Y) bubble sort
48. How manyvalues c a n b e h e l d b y a n a r r a yA ( - 1 . . m , 1 . . m )

a)o(1) '?Dotnt

JD\

a)m

hI*'

{ t ' i)

ti
i . . - 'j -) 1-, I
i

I l'

c)m(m+1) ( l - { d '' 1. t i{ , ;$m(m+2) -.' 49.Theminimumnumber of comparison required to sort 5 element is ( a)6 b)10 I { lu 7 b d)14 1/. 50. Whichof thts6llowing statement if false? graph a) Every tree is a bipartite a cycte GlA rr"" contains c) A treewith n nodes contains graph. n-1 tr"u is a connected $a

6fls

edges 51. In C programminglanguage, if the first and secondoperandsof the operator+ are of types int and

float respectively, the result will be of type a) int c) char provides 52.Whichof the following portionandgo with nextiteration? statements skipthe remaining

ffi:"#,-

PGCET-11

Page4 of 9

(lT) Information Technology

ai eise c) return 53. Recursive functions areexecuted in a

@ntinu"
d) go to b) FIFO order d) all ofthe above

(!Dtro oroe,.
il nlz
a)m*(j-L)+i

c ) p a r a l l efla s h i o n

54.Average successful search time for sequential search for n itemsis

b)(n-rl/z
b) n*(i-1)+j d)n*(m-i)+j b) abcd+-* d) ab+-cd*
l^^l^-^.i^ucLtdtdLtuil :- -r^-ilt Ltd55 5tIuLtute
.)

d)noneof these @n+r)/z 55.the expressi6'i whichaccess the (ij)thentryof m X n matrixstoredin column majorform is

56.

frm*(n-11+iprefix*+ab-cd Thepostfix
of the ${ryivalent {gDb*.d-*
c) ab+cd*1^.,+l-^ vy tilc li/k-+ uvttoL :- ^^hi^,,^,.1 r) oLrlsvsu t^ll^,.,:^tuiluwtil6

r,

t cl., i.:;

is
'o'

E7 Jt.

void operator++0{ c++;

tg}* overtoaded c)syntax error

58. The following ios function will set the irumberof decimal places a) setprecision0 t=.ef Setw{) 59. A pure virtual function in C++can be declared as u ' " g ) } i r t u a i v o i dd i s p l a y i = ) 0; = null; c) virtual void display{) 60. The function in C++is expandedin the line when it is called a ) m a c r of u n c t i o n
qfi?,5ri^-

r^h

b) ++ over riding d) invalidreturn type

on0 frlrecisi d)width( )

= null b) purevirtualvoid display0 = g' d) purevirtual voiddisplayfl b) friend function
l\ r.;.+.,^l f,,-^+i^-

\,9 6 1 . p u b l i c c l a s sM E E x a m { publicstatic void main (String[j arev) { inl x, y ,z; System.out.println(x+y+z); ]

rrrnrrinn

to compile andrun the program? | // What is the resultof attempting nothings b) Compile-time error I lf.Rrints c)lrints 0 d) noneof these 62. publicclass\fultiData { public static void main(String argv[]) { int[][j a1 = ii1-,2,31,{4,5,61,{7,8,9,1Ol1}; print{a +","+aL[1][0]+", System.out. 1[0][2] "+a 1[2][1]); ) compile andrun the program? I I / Whatis the resultof attemptingto a) Prints:7,2,6 time error .-b| compile c) runtimeerror Prints:3,4,8 A
63. Which of the following are modifiersthat can be applied to an interfacethat is a member of a directly enclosing interface?

PGCET-11

Page5 of 9

InformationTechnology(lT)

a) abstract b)implements c)final d) private 64.Whichof the following modifiers canbe applied to a localclass? b)c&d Yabstract d) final 65.Whichof the following methodis static members of the Threadclass?

/ifiubric

ftlun \rfstart

b)steep d)(b)

66.Thecleanroom strategyis based on the this softwareprocessmodel. a) evolutionary b)incremental c) Spiral d) Waterfall
67. Which box specificationdescribes an abstraction, stimuli, and response

box $Jr$lack bo* lfrt"tu

68. in terms of software engineering CMM standsfor a) convenientmaturity model

b)clear box d)white box

apability maturity model

c) cohesivematurity model d) none of above 69. Unsafekeyword in Cf is used for writing code with a) pointers b) database c) both {a)& (b) d) none ofthese 70. csccompiler is used for compiling g) C program b) C++ program rrogram progr",.n ft# d) JavaProgram . ,*r, 71. Which tag is used to create inline logicalblockfor styling logic group of elementsin HTML? b)<iframe> c)<head> d)<H1> 72. ln C#,which operator is usedto checkwhether an object is compatible with specific type or not? a, ls b) as -\ ,. d) += 73. Which one of following is not supportedtechnologyof ERp a) Fl-CO b) HR c) MRP-ll d ) n o n eo f t h e s e 74.Single us_e o rp e r a t i n gs y s t e mi s

@"p,n'

c)XENIX dlas/ 2 75.Theprocess scheduler in the processor management unit job to thejob a) Gives all submitted b) Selecta job to run scheduler t cp Select a process to run d) Coordinatesthe process synchronization 76.Parallel adders are Combinational logiccircuit. b) Sequentiallogic circuit. ffi

@,ri oos

b) uNr x

ff

ao*r(a)& (b)

d) Noneof above.

77.Merse sort uses .gl Divide and conquer strategy (f -e) Hearistic search

b ) B a c kt r a c k i n ga p p r o a c h d) Greedy approach 7 8 . i f n i s a p o w e r o f 2 , t h e n t h e m i n i m u mn u m b e ro f m u l t i p l i c a t i o n s a r e n e e d e dt o c o m p u t ea ni s

PGCET-11

Page5 o,f9

lnformation (lT) Technokogy

@)) Log2n c) n-L 79.lcons are TYPeO command A Picture command Q) 80. of diskare used to provide l$lRconfiguration a)' tolerance f-d;fHigr, lauit data density 81 w=logz is analytic everywhereexcept at ' (alz:0 (bl.z=l (c)z=-l

b) Vn d) n b) Verbalcommand d) lmaginary command b) Highspeed d) Noneofthese

( d lz : 2

82

'r dz | | T h ev a l u e of C being ltl=Z it J _, ,

C .

(a\ r

(b) rci

(cj 2ni (d't-n

83

Thetransformation w= cz consist of (a)translation. (c)rotation.

(b) magnification and rotation. (d)none.

rhe value *tn"[Y]j!dz,where

( a )1

C isthecirctelzl=! t s td) 2
2
IJ

t b )0

(c) -1

85

T h er e s i d u e at z:-2

of f (z)=

z (z -l)'? (z + 2)

1 ( a ):

(b):

" 9

4 ( c )-

" 9

5 (d):

" 9

Thevalueof

Jx(l
0

- x)n'dxis

," #*
PGCET-11

( 'b ')

11 10100

tt'*h

(d) noneofthese.

Page 7 of9

InformationTechnology (lT)

87

? _ . . , is . equal to
J

le-"x"dx

(a)2 88

(b)4

(c)6

(d)1

The n'n derivative of x' is

(at n
89 Thelimit (a)o 90 lo*"

@,,
cot -r ,, r -+ 0 is
(b)1

(cl n'

(dl n(n-l)

(c)2

(d)-1

= 0,_thefunction-r, = At the point,x l"l it (a)continuous and differentiable.

(b) continuousand not differentiable.

(c)discontinuous and not differentiable.(d) discontinuous and differentiable.

91

Theequation P andQ arefunctions of x is called 7 + Py : Qy" where dx (a)Newton's equation. (c)Euler's equation. (b)Leibniz's equation. @ernoutli's
= 0 i s k n o w na s dy' ( b ) H e a te q u a t i o n . ( d ) n o n eo f a b o v e .

rlv

equation.

92

T h e e q u a t i o n3 * # dx' ( a )W a v ee q u a t i o n . ,-\ (jfanlace

equation'

93

The Laplace transform of es' is

t.l1
s

(b) + ,r-)

-J1.1

s+5

(d) +

) -.9

94

The order of convergence of Newton-Raphson method is

(a)o
PGCET-11

( b )3

{ c )2

(d)none. Page8 of 9

*,,,

(lT) Information Technology

Trre vahrc of t ?atsimpson's dl+.r {a}o-5931s {b} o.6e3s1

rule's {c}o.6391s (d)o.9631s

Themedian of the numbers9,l2,l3,lQl

(a) 12-5 (b) 12

I is

(c)1o.s

(d) 11

97

The mean of the Binomial distribution with n observations and probability of success p is

(al np

(bl pq

t't J"p

@t,lw

tf F is Solenoidalthen V F is eqrialto ( a )1 (b)2 ( c )3 (d)0

[r 231
T h er a n k o f t h em a t r i x ,q:l | 4 zl is

lz 6 sl
(a)1 (b)3 (c)2 (d)0
1 lt [ r 2^ l

100

The sum of the eigenvalues of ttre matrixI = 2 |

0l is I
-l

[ : 2
( a )1 ( b )s (cl7 ( d )2

PGCET-11

Page9 of 9