DO NOT OPEN THIS TEST BOOKLET UNTIL YOU ARE TOLD TO DO SO

Book.let Se:rial No. 0031'77 Test Booklet Series

TEST BOOKLET- 2022

PROGRAMMER
(19)

Time Allowed: Two Hours Ma.xbnum Marks: 100

INSTRUCTIONS
1. lMMEDIATELY AFTER THE GO MMENCEMEN:r OF THE EXAMINATION, YOU SHOUL D
CHECKTHAl' TIIIS TEST B:OOKLET DOES NOT H AVE ANY. UNPRINTED OR TORN O R
MI S SING PAGE S QR l'FEMS E1'C. T:F SO, GET I T REPLACED BY A COMPLETE TEST
BOOKLET.
2,., Please note tha_t it is the ca,ndidate's responsibility to enco_de and fill i,n the R9U Number
and T��Boo,kJet SeriesCode A., B, C.orD carefuUy,and'"W;ithout anyomissto� or discrepin,cy
at the appropriate places in.the OMR Response Sheet. Any o�ission/discrepim:y will rend�r
the Response Sheet Jial).Je _{9r rejection.
3. You baxre to. enter,ymrr Roll Number on the Test Booklet
in tlie Bo-x: provided alongsitle.DO NOTwrite anything I
else 6n.;the Test Bo.oklet. ,.______________._I
4. This T� book:let cQntains 100 items (questiQns). Each item COJ}lprises 0ffour �esponses
(�ns:w�rs). Y:qu wjU select the response which y9'U want io mark Qn the.1{espopse she�t. In C¾e
youfeel that there is more than one correct response, mark the response which you co. nsider the
be$t. ln any case, choose O.NLY ONE.1esponse for each item _ .
s. You have to mark all yo_ur responses ONLY on the separate Response Sheet provided. See
direcffons in the Response Sheet.
6. AU items carry equal marks.
7. Before you proce ed to mark in tlie Response sheet the response to various items in the Test
Bookletyduhav.<Ho fill in some particulars in the Re�onse Sheet as per instructiens s�nt to you
with your Admission Certificate.
8. After you bave completed filling in all y.our responses on the Response Sheet and the examination
bas c<;>ncluded, you . should hand over to the Invigilator only t�Respon'Se Sheet. You are
pennitted to take away with y,oa the Test Booklet and Candidate's Copy 9-fthe Resp,onse Sheet.
9. Sheets for rough work are appended in the Te�t Boo1clet at the end.
10. Penl<l,lty for wrong answers:
THERE WILLBE PEN:ALT'f FORWRONGAl'l$WERS�D B¥TBECAN])ID..\'EE.
(i) There are fQur alternatives for tbe answer to every question. For eac.h question for which a
wiong answer has been given by, the candidate, 0.25 of the marks �igned to tbat question
wilI be dedµcted as pe,nalty.
(u) 'It a candidate giyes m.ore than o_n� answer, it will be tf'�ated as a wrong a�swer ev:el') if tme •
of the giv�n answers happens to be co.rrect ang ihe,re wiU be same penalty as a,pove fQr r�t
qµestion.
(iii) ff a question is left blank, i.e-., no answer is given by the candidate� there will be no penalty for
that question,

DO :VOT OPEN THIS TEST BOOKLET UNTIL rou ARE TOLD TO DO so

19.(A)/2022-
 •

19(~) (2)
- -- - - -- .--~ -

1. Giveri the statement,

Marutl.engine,bqlt,s 25 ;,
Which of the foilowirig is true?
:A) .structure b0lts are nested within a structure,en~ine
~) Structu.re ·engjne is nested within stfu~fure bolts
;,.
C) Stru~tut'e Maruti is nesfed within the structure.engine
D) 8'tnicture Maruti is nestecl within,stru~ture bolts.,

-2.- An expression ooritains relational, assigpment, and arithmetic operators. 1n the abs.ence
-ofparenthesesi the order of evaluation Will-be:
A) Assignment, re'latjonal, arithmefa~
~)· Arithmetic, rela,_tionaj, a§Sigrunent
C) Relational; arithmetic, assignment
DJ As&igrmi.ent anthmetic~J:~lational

3. The ~bceak' statement is used.to exitfr0m:

A) Art-.if&tatement
B) Aforloop
~) A.p1;omra
D) The main() function

4.. In a file ~oritai~ng.th~ line '~I ,am a bo,.y\r\n" then Qnr.eadmg this.line into the,·an:~y stF
tJSJb.:g fget~O-·'Wh~t wil,1sj'.r contain?
Ai ''I am a boy\t\h\0"·
B) ''lam a boy\r\O"
C) ·"i am aoqy\n\O'; '
D) "Iam abo:t-"

5. main() {
inti =4,J = i;
Jtiiik (&i, D ;
piintf ( '' \ri% d ¾'d"; i,,j ) ;
'}
junk(.int*i,intj ),{ *i·=*i* *i;j *"j ;}
A) 162
13-) 16'4
C) 4 4
D) 42

19(.A) (J)
 6. intmainO
{
•
inti;
int a[ ] = {2, 4, 6, 8, 10};.
ahange (~. 5);
for (i=0; i<=4; i++)
printf("%d, '',,a,[i])i
return 0;.
}
void chan~e(int *b, intn)
{
inti;
for(i = O; i <n; i++)
*(b+l) = *(b+i)+5;
}
A) 7, 9, 11, 13, 15
B) 2, 15, 6, 8,, 10
G) 24 ,6810
D) 3,1, -1,-3,-5

• 7. What will be t'qe output0fthe foJJowiag C ced_e?

#include <stdio.h>
Uilion stu
{
int-ival;
floatfval;
};
voidmainO
{
union stu i:;
d vaf= S;
prip.tf("%d'\ r.iN"al);
}
A) 9
B) Compile tqne en:or
C) 16
D) 5

19(A)
A;· •
8. What will l?e the 01,1tput 9fthe followin_g G c0.de't
#im~lude <stdio.h>
int.main~)
{
iht i = 97 = *p' = &i·
• ~ - , J ' ~

fo~(~i).;
printf('.'%d '', *p);
}
vold foo{fut ~pj
r
intj =2;t
p=&J;.
pr.intf('-'%4 ",,*pJ;
}'
A), 2 97
B) 22
CJ Compile tit;ne err0r
D) $egmentation .faultlcude cr®h

9. Wfilq_r,i func;;tjcm will you cho_q se fojoin two words?·

A) Str:cpyQ
Bl Str.catO
~j Stmcon(l
D) N,emponO

10. What will befae output ~Jthefollowing-C coc\e'?

#indude·<stdio.h>
vqidm.~0 •
{
int;,x = 5;.
ii(~< 1) •
prlntt("l:rello.");
i'.f (x = 5)
prin.ttr'hi");
·eJse
print((''no"},;
}
AJ hi
~) hello
C) hb
D), ette.r

19(A) {5) [P.T.0.

ll. What will be,the oug,ut 0fthe following C co.de?
#include <stdio.h>
void main()
{
ll).t-~ =. 0;
if(x=O)
p.i-futf(''hi");
else·
print(("h,ow,~~ u''); .
pi:intf(''hello'')~
}
A) Hi
B) how ate yoy
C) hello .
D,) fiih~lio

1.2. Ina tfuee,.tiet atclliteotute~.the intenrte9-iat~ layerbetwe~ndatabase-ai:i.d'.eH~n.t s,¢rver is

classified as
A) E:unctional s~er
B) ftanseation·setv-er
C) Ap,plfoation server
n ) :Uisk s.erver

f3;. 'Which ofth.e foJlowingis.a.s\n.gle.:.v,~lued attribut~°q;

AJ Regisfor"nli}.niber
)3) Address
C) SUBJEC'T-TAKEN
D) Reference

I
14. In Which ofthe folfowillg is a si.ngfe erttifY i:nstance· of one tytre·'relateo to many entity
.instai:rt es of anothertype?
A) One-to.:One Relationship.
B). ◊n~:.t0~Many,Relationship:
GJ Many-to-Many Relationship
D) CJompo~ite,Il~lati~nship
15. What is ~·snapshorofthe data in the database at a given inst.ant time called?
A) Dafa base instance
n, Database scheme
€) Database snap
D) Snap of database

16. .I n relational DatabaSe schemas, the transition constraints are also known as
A) Static Gonstraints
B) Dynamic Constraints
C) lmpliGit G0hstraints
D) Explicit constraints

17. Which 0f-the folfowing is not a restriction for a table to be a relation?

A) The cells ofthe table must contain a single value
B) .All ofthe entries in any column must be of the same kind
G) Tue.columns must be ordered
DJ No.tw;o rows·in a table may be identical

18. Which ofthe fol.lowing is not a type of Nonna! Form?

A) I.NF
J3) 2NF
C) ~NJ?
D) lONF

19. The-abiUfy to query data, as well as·.insert_, delete, and alter tuples, is off~red by _ _ _
A) TCL{Transaction Coritr0lL~guage)
B') DCL (Data €ontrol Langt1age)
C) DDL (Dara Defiuitien b~gt14geJ
D) DML (Dara Manipulatipn Lan~~e)

20. Data integrity means:

A) Providing first access to stored data
B) Ensuring correctness and consistency of data
C) Providing data sharing
D) Noneofthe above

19(Aj f7) · [P.T.O.

21. Examine thestructure oftheEMPLOYEES and DEPARTMENTS tables:
EMPLOYEES
EIYIPLOYEE ID NUMBERDEPARTMENT_JDNlThffiER MANAGER_Ip NUM8ER
LAST_NAMEVARCHAR2(25)
DEPARTMENTS
DEPARJ~1ENT..:_IDNUMBERMANAGERJD NUMBERDEPAR1MENT_NMIB
VARGHAR2(35)
LOCATION IDNUMBER
You want to create,a report cj.isp:laying employee,Jast names, depa'rttriefit names~, and
loc;ations. Which query should yqu u~e t9 create.an equi-j oin?
A) SELECT last_name, d:epartment_name, locatio,n__:id FROM eml)loy~·e s.,
dep~ents;
B) SELECT employees. last__:_name~ departments.department_pame, departments.
location_id FROM employe.e s e, departments D WHERE e.departpient_
id~department_id;
C) SELECT e.last_name, d.department_name, d.location_id FRPM employees e,
dep~ents D WHE~..rrum~~r_id~manager_id;
D) SELECT e.last_name, d.de__partment_name, d.location_id FROM employees e,
departments D WHERE e;dep.artment__.:id=d.department_id;

21. When we update anY'ttlple ir1 the r~Jatien whl.9hA'uthorizatitm bh a relation allows a user
to_?
A) $elect authorization
B) Update authorization
C) Grantauthorizatien
D) • Define authorization

23. Which ofthe following schedulingalgorithms could result in starvatien?

A) -Priority B) RoundRobin
C) FCFS D} Sb.o,rtest joq first

24. .Ori a system with 2a4 bytes-ofm:emocy and"fixed partitions, all oIsi2:e 65,536.Qytes what
is the minimum number G>f bits neeaee:lin an ~ntry in tp.e pl'OCess table t;_Q re~ord the
partition to which a pro<:-es~ has l:>.e~n allcoated?
A) 2 16 B) 2 8
C) 24 D) '232

25. A sequential access file has fixed size 15-byte records. Assuming the first rec.ord is
record 1, the first byte of record 5 will be at what logical location?
A). 65 B-), 69
C) 67 D) 61

19(A)

t
26. Op a system using a disk caclle, the mean acc.ess time is dependenron the m·ean cache
acces:s tir,ne, the i;nean.disk acGess time, and the bit rate. For ~e fellowing, what is the
mean access ti.me?
a) Cache: l ms; disk:100 ms; hit rate:25%
b) Cacbe: l ms-; disk:100 ms; hit rate:50%
A) a=75.25,. b=50.50
B) ~=70.25, b=5§.50.
C) a=75.25, b=SS.50
D) a=7tl.25, b=5Q.5o·

27. ___ are used to keep track ofboth real and virtual memory.
A) I/O tables
B) Memory tables
·Q) File tables
D) Process tables

28. The Circular Wait Condition Can.Be Prevented-By

A) Defining a linear ordering ofresource types
B) Usingthread
C) Usingpipes
D) All ofthe mentioned

29. Why is it not possible to enforce memory protection at compile time?

A) Without proper -permission:, the program in oneprocess cannot bef,aqle to reference
memory location.for reading or writing of another pr<:>ces_s.
B' Relocation of a process increases the complexity of s_atis:fying the protection
requirement.
• C) Predicting the lo.catjon ofa program in the main memory is very difficult, it is not
possible to check the apsolute address at compile time to give proper protection.
D) All 'the above

30. What is the difference b._etween a page and a,frame·?

A) A page is a part of a process, while a :fu:\me is a part of memory:
BJ A page is a part ofa memory, while a frame is·a part of a process.
C) BothAand B
D) Noneoffueabove

19(A) (9) [P.T.O.

31. C6nsid~r the follo:wipg:fqur prrn.1es~es :wit)l ~e a.iwivaJ time and. l~J'l~ of CPU: Burst
•givehinm mtsecQp:~~: ••
J?toc.ess A:trivarTune Burst Time
Pl 0 8
P2 1 4
. PJ. 2 9
P4 3 5
Th~ average waiting-time foq~te·emptive SJF seJ:re€iljting atgori~ i$,_ _ _ __
A) 6.5 ins
B) 7.5 ms
C:l 6..75 -ms,
fl) _9.0 ms

a2._ The types of file syst~rns in theJi0J.,aris ex;ample is_ __ _ _

A) Tmpfs
B) 'Obis
G) Ctfs-
D) A11 the above-

33. The wait.,for graph is a·deaclioek dete.ct}on:ah~P-rltn,iv. that is applic.a~le y.,l,ien. .

A) . All--:11esolll'ces have a -s,irtgle instance
0

B) :All t¢s.9u,r¢es bave,multJpJe iris_t_anqes: .

C) Ail re.so,wt~es.·h:ave.a 'singfo 7 multiple- in§tances
D) All ofthe.,mentlone.d

34. C.on.sider,the :following a1;ithmetic.mfm expression Q

'Q:A + (B * C}--(D/E-t F) ~ G)* H
AJ ABC"'-DEFt/G*-H*+
B) /G*-H*+A:BC'l:DEFt-
C) 'ABCf/G*__,fI*+*DEF
Dj DEFtJG*-H*.+ ABC*

3~. We want to ~valuate the followingpar-entli~sis.lree ~ithmeue·e~pressfon:

2t3+5*2'-t2-1'2/6
A) 20
B) 26
C) 19
.D) 32
36. The h).axirrn1m number of nodes in a binary tree oflieight h is_ _ _
A) 2.h-fl-J

11) 2h

. C) 2h+2 - I

D) 2h-tl

37. What is anexfemal sorting algorithm?

A) The fJ}gorit:1:un that uses tape or disk during the sort
B) The algorithm that uses mam memory during-the sort
0) Thealgpritlmi that involves swapping_
D) The-alg,ocithm th.a t i~ G~m~ider:ed ~in plaee'

38. Wbatis the worst-case complexity ofbubble sort?

A) O(nlogn)
B} O(l'ogn).
C) O(n)
D) Q(~)

39. S.uppos-e w<th avean O(n) time algorithm that finds the median ofan unsorted_array. Now
consider a Quick$0rt implementation whete we first find the median usiirg'the above
algorithm, then mse the median as a piv:ot. W}latwiU be the worst-case time compiexity
ofthis modified QuickSort?
A) O(n"2 Logn)
B) O(n"2)
C) O(nLognLogn)
D) O(nLogn) .

40. Why is the ll1$eftion sort most efficient wlien the original data are almost s.orted in
order?
A) wh.enthe sorted portion of the array, has to move any elements at all.
B) when its inserting elements into the sorted portion of the array,- it barely has to
move any elements at all.
C) BothAandB
D) None of these

19(A) [I>.T.O.
:41. Stippose a circular.queue ofca:pacri~ (n -1 )'elements-is imptentelitedwith an ~Y ofn
.elements. Assume thattlie -ins'ettiort and deletion·bperations.are carrie<il'ot1t using){EA.R •
:and FRQNJ' as arra-y irtdex_variable"s; respeoti11,elr. lnitially, REAR.= FlldNT ~n. The.
coaditions t@ detect·que_u e"Jull ,and q.ueu:e,;e,mpty ·are •
' '
j\) F1;1ll~ 'OPSaE-+1.)mo.d n = FR0NJ;';.empty": REAR FRONT
~) P-ull: (REAR+l) mod :n ==E'RONT; empty: {FR.ONT+ l.J.n;iod.n - -REM -,
&) Full: REAR= FR:ON1',. emp~: (_JffiAf.l+lJmodtY=--FROOT
D) .fµll:/(FRQN'.I'+t) m-otln= RE)\R, empty:'l;$AR = f}lQ1',iT
'9. • •

A progi;am'P:r~ads in ~.OP int~ger~,in, th~ ,rapge [O.1 {OOJ ~pre~.ehp.ng tb-~ scores of S.Ql)
0

stjJden,ts:.It fhs:)i Nrinij'the ft:eq11,1n~y l'>feagp .sc,or~ ~pov~·50: \Watwould ~ t{ie besfwa.y
for P to (tore the ft~qvencies?
A) .An array of'50munbers·
B) Aft:ap:a.}' of 10() ndhib0r"s<
P,) . An·array of §.QQ numbers
D) A dyn~call,y ~Jioc~teds~ay b,f550 n.tunbefs

Bach program.module .con1iains "its o:Wn tist 0fvati'ahl'es·€~Ue:t;i._- _ _ __

A) Global vari.;aijl~
B) L0cat variable
€J Staticv;..arlab.le
D) Dynamic.,variable

Consider an impl~m:entati'on ~r:an, ·uns()rted ,singly limk~d l ist. :SueP,,0S,e- b has its
repres-emtition with·a ;head p.:ointer Quly, Giv~n~;~-repre:se]1taijop~·wbich oftlre fdllow.fug
operation gau be.i;mp1,em:ented in ort) (ll;Ili'? -·- -
9 ·rnsertron a:t the front .o fthe linke-dlist
n, lti~erlie)). ~t the end of'thedi.rik:e;d li'sf
:rrp· Deletion oJ the rr~nt node of.the,. linlq:~d list
TV) Deletion of the last node oftlfe.lmked list
A) landII
B) r-andm
C) J, Il·an~IU.
D) l ~IlahdlV

45. Inc~ the e-x-ecutiO,n-'IS always,.be&~S at_ _ __

A) m~O ·
.B) Declal'ati,ond
C) Sub fumttion()
D) . Class,()

i9fA)

i
 46.. In a dynarr11e initializatfon, th~ initial v~ue qf an ob}~ct n:i~")rB'e pre-1/_i<ied clUI'lng
- - -time.
A) Co~pik
B) . Run
<:'.:) ·Bf)thA&:B
D) None

47·. Th Gtt Size operatot:ts· f~llowetlin syntaxls·_ __

A) cs,icze -~l:l
Ill (size.of)
C) tSIZEOF}
D) (&Sizeef)

48. mC-++ does n0t pepnitan int v.u~e to be a,ut9matio.a lly COI)Veft~d to•-an.-'-.--__value..
A) Cli;tS~
B) Float
C) Enµm

~) lorigiht

49. A _ _~ is used to d¢'stro,y the obJe.ct that hav~been e:r~.ated by a_·_) _ _

A). Des'tructor, Constru~tQr
B) , C©nstrucfor, De~truetor
·G) •Inhe:riwnce, Dynam;-cbinding_'
D)_. 1t.manfic
~J-11 .,.
bfudmg;
' '
Inheritance

. 50., llfemechaci.smofderivinga0las:sf11@manother:derivedclass.is,kmnvn.as _ __
A) Hiertu:chlcal inheritance
B) . Multilevel inheritance,:
CJ Singl~,11:lherit;ano.~
_D) Hybriil.iOMritance
 51. The first argument argc _represents the number ofarguments in the commruid line known
as - - -
A) .argument vector
B) command-line arguments
C) ·counter
D) argument counter

52. All inline functions must be defined _ _ _ they are called.

A) After
B) Before
C) Middle
D) None

53. When we use the sam~ functionj~ both the base and derived classes, the function in b~e
class is declated virtual using the keyword _ _ _ preceding its normal declaration.
A) virtual
B) pointer
·c). C.int
D) Static
-~
,~..
'~

54. The im~ortant appijcation of~e pointer is to return the object it points to, the following
invoke objectstatementwill be____ -:
A) returnQ; •I
l

B) return *this;
'
C) return(this) ·,
D) return &tbis;

55. The _ _ _ sets the specified flags a;nd leaves othe~ t,m.changed.
A) setf()
B) setwQ
C) flag()
D) precision() ' I

19(A) (14)
56. Arqmge the following a,ctivities to form a.gep.eral software engineering P!bce$s model.
1. Map.ufacture
2. Majntidn
3. Test
4. Install"
5. • Design
6. S~cification
A) 6, 5~1, }, 4, 2
B) 1, 2, 4, 3, 6, 5
C) "6, 1,.4, 2, 3, 5
D) l,, o"·s, 2., 3, 4.

57. DefuieA_gile scrum methodology.

A) project management that emphasizes .incremental progress
B) projectmanagement that emphasiz~ decremental progress
C) project management that emph~izes nel)tral progress-
DJ proJectmanagement that em~h~izes no progress

58.. According to: ISO 9001, inspection and testing coqie uqd~r which management
responsibility?
A) Process control
B) Document control
• C) Control ofnonconforming products
D) Servicing

59. Softw~e CoQ.figuration Management ean be:administered in.several ways. Theseifielude

I

A) A sjngle .s,oftware configuration management team for the·whole orgartizatfoh

B), As,ep~ate cqnfiguration managem~nt team for each project
C) Software Configuration Management distributed among the projectmemhers
D) All ofihementioned

60. _ _ is an example ofan RSL language content

A) Data
B) Initial Value
C) B;othAandB
D) ·Norteofthe:above
19.(A) (15) [P.T.O..
61. What is Cyclomatic complexity?
A) Black box testing
B) White .box testing
C) Yellow box testing
.D) Green box testing

62. -A software company needs to develop a project t;hat is,estimated as 1000 function points
and is planning to use C++ as the programming language whos~ approximate lines of
codes per function point are accepted as 50. Considering a= l .4 as.the multiplicative
factor, d=0.33 as an expone1~tial factor for the basic COCOMO duration equation,
approximately how long does tr.e project take to complete?
A) 11.2 months •
B) 12.2 months
C) 13.2 months
D) 10.2 months

63. Assume the following r~garding the development of.a software system P: estimated
lines ofcodes ofp:33,480 LOC, Average productivity for p:620 LOC perperson month,
number of software developers:6, Average salary of a software developer:50,000 per
month. If E, D, and Care estimated development effott (in person months), estimated
development time (in months), and estimated development cost (in lac) respectively,
then E, D, and Care_ __ _
A) 48.,8,2
B) 54,9,27
C) 60,10,30
D) 42,7,21

64. A legacy software system has 940 mod~es. The latest release required that 90 of these
modules were removed. Compute the software maturity index for the system.
A) 0.849
B) 0.524
C) 0.725·
D) 0.923

65. The algorithm often took too long to converge the count to infinity problem, and it was
replaced by an entire1y new algorithm ~ailed_ _ __
A) Packets
B) Link state routing
C) Distance vector routing.
D) IPV6
19(A) (16)
66. DNS is defined in
A) RFCs 1034 & 1035
B) RFCs 1036 & 1037
C) RFCs 1086 & 1087
D) RFCs 1038 & 1039

67. The first class ofencryption algorithm used same key for decryption & encryption called_ · _
A) Symmetric -Key Algorithm
B) Assymmetric -Key Algorithm
C) Cipher Key Algorithm
D) AandB

68. The cipher was widely adopted by the industry for use in security products called__
A) DES-Data Encryption Standard
B) AES-Advanced Encryption Standard
C) Both DES &AES
D) None

69. The Public key and private key consist of_ __

A) (c,n) & (P,n)
B) (e,n) & (d,n)
C) (c,e) & (d,e)
D) (e,n)& (e,p)

70. When HTTP is used o:v-er SSL, it is.called- - -

A) SecureHITP
B) Unsecure HTTP
C) SSLIITTP
D) sHITP

19(A) (17) [P.T.O.

 1·1. The is au arthitectural ·iraqiewotkf,or accessing ljnkec,tdo.cum;emts spread out
ov:ermillfoms of machines on the ihteme:t
A) World Wi'de Web
B) OSl
C) Three-tiet arehfrecture
D)' World\Veb

tt. The OSI model is the ·extension of_-,-_

A) • Op:enS);,'stems Intetcoimectidn.
••B) Open $ystems Intraco~ecti'oti
C) Dpen ServerIntercop.nection
• '
D) Open service Interconnection

73. A - - -- ean call a c<5astructor method ~efµied by it,s s.4pei~l~s.

A) Superclass
BJ .Abstract clas,s
C) Subclas_s
! . .
P) N:orre.of the class

74. A _ _ _ _ brid&ethat comm~cate witn ·an. e:xistirlg dni~~r.

A) IDBC
BJ QDBC
C) JDBC-OI>llC
D) 1'fone

7~. The·_ _ _ $t:~tement defines narrtespace in whieh cfasses·are $(ored.

A) Pa,~kage ...
•'
B). Irih~rit@ce
C) Hier~chy
D) Aeee$s Prot~ction
19(.A') (lB)
76. If a class implements more than on~ interface, then the interfaces are separated with
a
A) Semi colon
B) Colon
C) Double colon
D) Comma

77. Which define the interface to the stack independently ofthe details ofthe implementation.
A) PushO
B) PopO
C) PushO and PopQ
D) Noneoftheabove

78. _ _ _encapsulate a thread of execution.

A) Rwmable
B) Thread
C) Stop
D) Interface

79. The easiest way to create a thread is to create a class that implements the _ _ _
interface.
A) Runnable
B) Thread
C) StartO
D) MainO . '

.:
80. The four abstract classes built in Java stream-based 1/0 is
A) InputStream, OutputStream, Reader, Writer
B) Reader, Writer, File, Accept
C) lnput:file, Outputfile, exit,main
D) Noneoftheabove

19(A) (19) [P.T.O.

81. Another useful file utility methods are
A) mkdirQ
B) mkdirsO
C) nikdi.t:O andmkdirsQ
D) Files()

82. The _ __ statement 1s optional, if we omit the execution will continue on the next
case. .
A) Break
B) Continue
.C) Switch
D) Default
~

83. _ _ _ _ is both a TCP/IP application and a.protocol for connecting a local computer • j
to a remote computer.
A) 1ELNEf
B) FIP
C) TCP
D) UDP

84. - --.--- -uses IP to deliver packets to the upper layer applications and provides a
reliaple·stream of data am¢mg computers on th~ network.
A) TEI.NET
B) HI1P
C) FIP
D) TCP/IP

85. There is a unique _ _ for any hypertext item on the net. .

A) URL
B) http
C) Hyperspace
D) None.

86. In Http service by default uses port _ _ _ the gopher service uses port
A) 70,0
B) 50,80
C) 80,70
D) 10,70

19(A) (20)
87. The Scheme for ft).is pathn~e type ofURL is _ __
A) http
B) SMTP
C) F1P
D) URLs

88. In orderto keep all the files straight, each person is given a specific directory called

A) URL
B) Page directory
C) ffom.e directory
D) Event Directory

89. The tbitdway to connect to the internet with windows through _ _ _

A) MAN
-B) IAN
C) WAN
D) BothA&B
l -

90.. Whicll servers run to allow them to respond to client requestfor information is
A) TIS •
B) Web clients
C) Web server
D) Browser

91. Web clients run special software called a _ _ _

A) Browser
B) Client
C) Server
.JIit HTML . .

92. ~e architec~e that provides the foundation for managed execution in the .NET
Framework is known as - - - -
A) Common.Execution System (CES)
B) Common type system (CTS)
C) .NET Execution
D) Common Run Enivronme.tit (CRE)

93. Which of the following ex(ension is used to represent the Windoils Scripting source
file?
A) .WSF
B) .VBS
C) .nets
D) .SF
19(A) (21) . [P.T.O.
 94. A procedure-level variable i$ declare.d using _ _ _ keyword.
.. ·.. A) Private ,
B) . Public
C) Dim
D) Static

, , ... . •95. The Visual Basic .~T language defines _ fundamental data types
A) 10
B) 12
.C) 7
D). 8

96. Unary Plus and Unary Minus can also be considered___operators in VB.
A) Aritlimetic
B) Relational
C) • Assignment
D) Concatenation

97. The Keyword to be used for Array Parameter in VB is _ __

A) ParamArray
B) ByVal
C) Optional
D) ArrayParam

98. _ _ _ _ is•a counter-controlled loop.

A) For..next loop
B) Do..while loop
C) While loop
D) Ifstatement

••99. The CLR is based on _ _ __ model exception -handling

A) Termination
B) Resumption
C) Tenmnation and Resumption
• D) ·skip

100. _ _ _ can access dat~ from relcitional and non-relational databases.

A) OLEDB
_B) Jet database engine
C) ODBC
D) None of these

. 19(A) (22)
 ROUGH WORK

19(A) [P.T.O.

I
 ROUGH WORK

'

19{A) (24)