Computer Programmer - Technical Education -Engineering Colleges.pdf. Computer Programmer - Technical Education -Engineer
6012075 Tin€: I huu.$d
l.
Dpe of valne
2.
Two nain measEe
stm.l in a va;able
(A) Pre8er
tu
can b€ identi6cd
*b
Il |*o
uing
(B) {D)
and
A and B hrve bo
c
mmnd
elenedt6
rle.
Conptexity,nd c,prcity Dltaand spa@
such
pts ue L.own
6n€ tle difeErcc ir data tlanofer .De& (A) Sped onl8ncjns ciftuii.y
6.
Cacbe
lo ov.r
n€Dory wolls o! the prirciple or
(o r0r
che
rcm,uder i.
the prcsrsD that bringr fio object
r,FO
(C) Rlldom
lrrio$ devier.
of
EeEory
of
o$r€n6 lnd n€ndy
:
o)r code
3. fte orrler in wluct tle Etorn adilee! (A)
of
:
(B) rr
(oo 7.
(B) Iesrity (D) laatty
Lealtty
If r l00u0l, is diviterl t'y 1rO
as
:
ordah (c) Lealityorrc{eren@ (A)
6.
usd
nnures
tbc eftciency of an alelrilhm are :
ncbory (C) Tine and.p,e O.
15
i.to mshory
for executior
@ gerobted md u*d i!
i!:
:
(B) Frm (D) Eishe.r piionty [P,T.OJ
L fle
10.
clssfication ofBUSes inio synchroe@ anil asyrchronoN i3 bas.d on : (B) tLet$c otdata raidbr (A) the dwi€s @lnectea io ihem (D) dote oa$e aholc (c) th€ tioinsofdald llan6l€m
Which id not a mgtretic stonsp
(A) (C)
1r. h
a
detel (B) TaF.trive
disL C{opdcl disl Hard
(D) All olth4e
digil.t FpEseatation ofvoltagcs
usiDg an a bit
(B) (D)
6) r28 (c) 54 12,
The denory uied to hold
tle salde..
Associaiive
E a bbck
13.
(B) (D)
lrt.
(c) (A)
(O 16. R€slutirn
t
Pridary n€mory R€stute.
Code
p,th anrlFis
:
FiBt 6sd 6ist sefl€ Pre.nptive scheduling
(B)
Shortesrjob
(D)
Non.pFeEptive .cbedlring
CE.tion of a new Fb crc.rion orn€s prcs
(B) (D)
Dispab.nins ol n€w
iisL
In@asiac pno.ity
ofpre*
fl!.!
ol extonaDy d€6n€d slEbol is dore by :
@!*o* sE. d!w!,
d s @mpurer'. n€rwor}
(B)
6tv2015
:
bporariLy suspending the runnins prcess b eued
topoLosy. whole
(c)
b
B.und&y vd@ auly8i!
The dhdteF/ of
(A)
16
bd testi4 6€thod.
(B) (C)
whs dn b€
256
of ilats 6toreil in tne cdche
n.nory (c) SsendaryEemory (A)
bindy ode, how nanv
B!3
sir
dN.
ts
brct€n,
(c) 19. Whicl
6
of lbe louomng
(!')
6
(D)
I
prbl€D is u-.'a.r"bl€?
(B)
C!,L lor FSA6
M€ntedbip prcbLn fo. rcsdd et6 (D) Anbieliiy prcbl€n ofCIEs
M€DheEhip ptublen f@
(C) Fiines plobl.h
!0,
(B)
Inage @lpiesion i3 :
(A) redlcils tbe si6of inacB to 6i to dd@r (B) 66Lins ieso l6L bett€r (C) (D) 21,
r€ducins
Educing dsFad.iion
Bagic.t€ps for
(A)
ih. EduDdmcr
6lt
Fouier
(C) InsE
rins
h
oJ
(E
i6a3l dats
imaes
the &equetcy
dootin:
(B) Filter fuclion @) A[ofiL6 dove
t!.,Elod Founei
'ratufo@
tr.
What i. th. .lird€F 6 beti@ a 6inuLtor .nd e enul.tor in mb€dd€d sv.r.6 dw€lopndt? (A) Dnulaid run. in itrslt svstod, .ioulator rus i! deEloph€ni .ygteo (B) SiDubt ! ro. in rarget svsta6, €nulalor runs in dovelopment svstem (C1) Enulrto! b indenteil ior ,enbly llnelase te6unc, simulator int6rd€d 6r higl lerel bnew3. t 6tins (D) Sndator i! hdenteit fd lan$r4e testils, dubta iltended 60! higl 'gDblv lewel la4!t$ t .ting
18,
IYr€.h€cbng i!
!a.
Prcdler @u@t trcbl.b 6n
lm.lly
Dditors (c) *ni cout n GA)
done Ly
he
:
slrd
ulDg
:
G) .@DhoE. @) the abo6 60/2016 IP.T.Ol
2d,
Trme ToL've
(r\) (c) 26.
fiel,l nlhc
'!
heeder is used:
to find thc shortesi parh
lo avoid infirite laops
The
tern
uded lo
(A)
rfer
to a rcw in ddtabn.e i5
ld ((' Ar-|ributs 28.
In a
niaopre.sr ihe esilte. (A) Pios.an @uter
nound Rabin P.e.€nptive scheduline
io redue th€ 6i@ olpa&ei
(D) :
that &€ep. th€ results of d.ithneiic or loeic operutiod ir (B) Flag resie!€r (D) Stacl €gist4r
dc!ft rhen a l (A) Conp!|cl. virtul neBory subsFten ir in a onshnr (B) conpu@16 D.i! nenory got €:hau6ted {C) Conplai. prlDss N i! hdefrite deail locl
lhraghing
iD) 80.
G)
{lt{hdte path
(B) hple (D) Entry
rie
' (C) Acunulatd 29,
to 6nd
AGING ir a tehnique usd in :
(?\) FCFS (C) Priority rchedulhg
2?,
(B) (D)
A stst€n
Nd€ of the
(A) &e6dble!
a
prcglam in nain nenory €ady fof execution is (B) Linke!
(D) bsder
11. Fc l.EE r.trort.,
(B)
'
(O
t2.
Ax.PANEadta
Rins
.lor:
(A) An.rie!n @.rch Piojeci As!..y Neiwdl (B) Ad.n Rc&.rch Prcjer&€Er N€trorl
(O
Ad-le R€e!rch Pbjet As€.cy Neleo* @) Advln@d n€&arch Pmj€.t Asency Net{o.k 60/1016
pagiq
above
ph3rdh that @ts up
(c) Editor
stars of
st3J
:
:
33.
Ev€ry
sntdxt $nsitivo language is
:
(A) R€cureiva cnum€rabl€ language (B) Rerusile lancurg€ (tt) Cottdt eNniE bn3las€ {C) C..bxt nac lMsuace
3,r. Ite D€ditted
val@s ol €acl attribtrt€. oI s elaiion b caleil it€
(A) Sei
(B) Tlple (D) Domain
iC) Scheea 36.
Tl'e sddJp$rng mdc in
\
tu! h ) ou
dr.crly
gN€ rne opere no !
(A) R€ldnre
G)
is ihe v!!u€ of j after
'l
u.
r
E:
DiEct (D) Imedjat€
(c) D66.ib 35. mat
|
tle .Etutio. ol rhc folowina 6de?
uhika