0% found this document useful (0 votes)
193 views12 pages

KPSC - QP - 60-15

This document contains 30 multiple choice questions related to computer science topics such as algorithms, data structures, computer architecture, operating systems, and computer networks. The questions cover concepts like algorithm efficiency measures, cache memory principles, binary representations, virtual memory paging, and network protocols.

Uploaded by

M Uller
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
193 views12 pages

KPSC - QP - 60-15

This document contains 30 multiple choice questions related to computer science topics such as algorithms, data structures, computer architecture, operating systems, and computer networks. The questions cover concepts like algorithm efficiency measures, cache memory principles, binary representations, virtual memory paging, and network protocols.

Uploaded by

M Uller
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

6012075

Tin€: I huu.$d 15 nnures

l. Dpe of valne stm.l in a va;able can b€ identi6cd uing

2. Two nain measEe tu tbc eftciency of an alelrilhm are :


(A) Pre8er ncbory
and (B) Conptexity,nd c,prcity
(C) Tine and.p,e {D) Dltaand spa@

O. Il |*o *b A and B hrve bo mmnd elenedt6 rle. such pts ue L.own as :

c usd 6n€ tle difeErcc ir data tlanofer .De&


lo ov.r of lrrio$ devier.
(A) Sped onl8ncjns ciftuii.y

6. Cacbe n€Dory wolls o! the prirciple or :

(A) ordah
Lealtty (B) Iesrity of EeEory
(c) Lealityorrc{eren@ (D) laatty of o$r€n6 lnd n€ndy

6. If r l00u0l, is diviterl t'y 1rO che rcm,uder i. :

(o r0r (B) rr
(oo o)r
7. the prcsrsD that bringr fio object code i.to mshory for executior i!:

3. fte orrler in wluct tle Etorn adilee! @ gerobted md u*d i! :


(A) r,FO (B) Frm
(C) Rlldom (D) Eishe.r piionty

[P,T.OJ
L fle clssfication ofBUSes inio synchroe@ anil asyrchronoN i3 bas.d on :
(A) the dwi€s @lnectea io ihem (B) tLet$c otdata raidbr
(c) th€ tioinsofdald llan6l€m (D) dote oa$e aholc

10. Which id not a mgtretic stonsp detel


(A) HarddisL (B) TaF.trive
(C) C{opdcl disl (D) All olth4e

1r. h a digil.t FpEseatation ofvoltagcs usiDg an a bit bindy ode, how nanv whs dn b€

6) r28 (B) 256


(c) 54 (D) 16

12, The denory uied to hold tle salde.. of ilats 6toreil in tne cdche b :

(A) n.nory
Associaiive (B) Pridary n€mory
(c) SsendaryEemory (D) R€stute.

13. E a bbck bd testi4 6€thod.


(B) Code p,th anrlFis
(C) B.und&y vd@ auly8i!

lrt. The dhdteF/ of t bporariLy suspending the runnins prcess b eued :

(A) FiBt 6sd 6ist sefl€ (B) Shortesrjob fl!.!


(c) Pre.nptive scheduling (D) Non.pFeEptive .cbedlring

(A) CE.tion of a new Fb (B) Dispab.nins ol n€w iisL


(O crc.rion orn€s prcs (D) In@asiac pno.ity ofpre*
16. R€slutirn ol extonaDy d€6n€d slEbol is dore by :

topoLosy. whole @!*o* sE. d!w!, d s @mpurer'. n€rwor} dN. ts brct€n,


(B) sir
(c) B!3

6tv2015
(B) 6
(c) 6 (D) I
19. Whicl of lbe louomng prbl€D is u-.'a.r"bl€?
(!') M€DheEhip ptublen f@ C!,L (B) M€ntedbip prcbLn fo. rcsdd et6
(C) Fiines plobl.h lor FSA6 (D) Anbieliiy prcbl€n ofCIEs

!0, Inage @lpiesion i3 :


(A) redlcils tbe si6of inacB to 6i to dd@r
(B) 66Lins ieso l6L bett€r
(C) r€ducins ih. EduDdmcr oJ i6a3l dats
(D) Educing dsFad.iion (E imaes

21, Bagic.t€ps for 6lt rins h the &equetcy dootin:


(A) Fouier t!.,Elod (B) Filter fuclion
(C) InsE Founei @) A[ofiL6 dove
'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
lewel la4!t$ t .ting
'gDblv

18, IYr€.h€cbng i! lm.lly done Ly :

!a. Prcdler @u@t trcbl.b 6n he slrd ulDg :

GA) Dditors G) .@DhoE.


(c) *ni cout n @) the abo6

60/2016
IP.T.Ol
2d, Trme ToL've fiel,l nlhc heeder is used:
'!
(r\) to find thc shortesi parh (B) to 6nd {lt{hdte path
(c) lo avoid infirite laops (D) io redue th€ 6i@ olpa&ei

26. AGING ir a tehnique usd in :


(?\) FCFS G) nound Rabin
(C) Priority rchedulhg (D) P.e.€nptive scheduline

2?, The tern uded lo rfer to a rcw in ddtabn.e i5 :

(A) ld
rie (B) hple
((' Ar-|ributs (D) Entry

28. In a niaopre.sr ihe esilte. that &€ep. th€ results of d.ithneiic or loeic operutiod ir :

(A) Pios.an @uter (B) Flag resie!€r


' (C) Acunulatd (D) Stacl €gist4r

29, lhraghing dc!ft rhen a l


(A) Conp!|cl. virtul neBory subsFten ir in a onshnr stars of pagiq
(B) conpu@16 D.i! nenory got €:hau6ted
{C) Conplai. prlDss N i! hdefrite deail locl
iD) Nd€ of the above

80. A stst€n ph3rdh that @ts up a prcglam in nain nenory €ady fof execution is :

(A) &e6dble! (B) Linke!


(c) Editor (D) bsder

11. Fc l.EE r.trort.,


(B) st3J
' (O Rins

t2. Ax.PANEadta .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
33. Ev€ry sntdxt $nsitivo language is :

(A) R€cureiva cnum€rabl€ language (B) Rerusile lancurg€


{C) C..bxt nac lMsuace (tt) Cottdt eNniE bn3las€

3,r. Ite D€ditted val@s ol €acl attribtrt€. oI s elaiion b caleil it€ |

(A) Sei (B) Tlple


iC) Scheea (D) Domain

36. Tl'e sddJp$rng mdc in \ tu! h ) ou dr.crly gN€ rne opere no !


'l
u. r E:

(A) R€ldnre G) DiEct


(c) D66.ib (D) Imedjat€

35. mat is ihe v!!u€ of j after tle .Etutio. ol rhc folowina 6de?

uhika<II
i
I
(B) s
(o r0 (D) 11

8?, fn6 addrcss gen€ai€d br CIU is :

(A) Phydical addFs (B) Ab&lute add'€sg


(c) l,sical addr.s (D) Menory add.e$

88. IEEE 302.rr stllded &r,iftles LAN us muliipl€ !c@.. tatmique.


(A) CDMA (B) AI'IIA
(c) csMtcA
90. TIE wont-ce coEploxity orh€tp soli is :

(B) nr
(D) N

,rO. A ?$to@l l*d &m ao. endinc of .!tta der cho Int€tut i3 :
(A) SMTP G) FAP
(C) }I'ITPS O) TCPIP
a 7 60/2016
tP.T.O,l
n€thod p.o'ide r ore-lim. ession ley for r*o p.riie!.

(c) [asA (D) DEs


.!2. Ilow 6a.y Nt olsm€li d m,,IL dmus€nr can haw?
(A) Any nunbef a3 required (B) ore
(C) Two (D) Only linited by available neeory

43. wlli€h of ihe foll@i.g is a coal of ibra hidils?


(A) To 6:tract sre ob*ftd eEDi or @ndirion
(B) To .nalyz .!rta 6r. qpect€d Ebrionslnp"
(.) To @a@ nry ddtlbe
(D) Non€ of rle abore

44. Criiical paih of the PEBT chart b :


(A) Path qhich t3keB rhe longesr dn€ io @rDtere the phjdr
(B) P.ih wLi.h r,&es rhe .horte.t ri6e to conplei€ ibe proj*t
(c) Paih rhich t.Les tle nsr .pphpdab tine to @npl€r€ ih. pEj.cr
(D) NoE ofth€ abo€

15. The l.ns68! @d hlr end UsE lnd pFstmbeh b manipular€ d.rt in r drt b@ i! :
(A) ITTML (D DML
(c) xML O) cML

46. S{ret tey.ncr}"tion Eal$tnosn as:


(A) A!yn66t ic emryTrion (B) gTn |ri.t€ycrypaostaplty
(c) n6A (D) DSA
a?. Whrt i. a fFu[?
(A) Boundalyof! d€rsoil
(B) A 6uti,s&ftw@
(C) aoftward to prevenr unauthoriad ac€6.
(D) A *eb bwsins eftwalo

43. Which nod.l lon b b&ed oD Dulti-vahed d€p.nd6bcy?


(A) Fi..t (B) s€6d
(c) Tnitd (D) Foutth
60/2015 8 A
.!9, nov bx shich ddregsing
3x, mode ilfts tlts ir.tudim u*?
(A) Innediate (B) IndiEcr
(c) Reeister (D) Dn4r

50. An RTPpaclet is encrpduhEd ib:

, we can linestsnp th€prcl€ts.

52. The @Dplexity of Binary Farci .ls.rithb i. :

(c) o(d2)

68. Il €v.ry nod6 r in C id adja.atrt to e@ry other md€ v iD C, a $aph is said !o 6e :

(A) laorai€d (B) c.npl€tr


(c) Finib @) sto.gly @nn€cted
64. To €ri€nd the @dneciivity of the preser bu. we ude :

(A) PCIbU (B) SCSI blg


(C) Controlle$ (D) Multiple bua

55. r U00l l00r i6 {rivided by l rG the quotiert i. :


(A) 11011 (B) rrrr
(o) 100010 (D) 1o0o0r

66. Whi.h dai! .ttuciua dlowd ilata €lehenb 6on frcrt dnd insortins ai rcar?
'lel€ting
(A) Sr,cb G) queue
(c) Deq@, (D) Binary esch i3
67, qthich of th€ {oUmns datr 6tru.lw E tnear typ€'
(A) sirins6 (B) Lbts
(q aueues (D) All ofabov.

e 6{vt0l5
lP.LO.l
6a. Spezd of, nicrcpoe6&! i€ deEnincd by:
(A) Addres6 buc sidft (B) Dala bus Nidth
(C) Cloct (D) No.e ol ilt above

59. How many gai€s soulil be requied to ihplemeni the folLwirs B@lesn qp6.sion alter

xY+xG+a+Y(x+Z)
(A) 1 (B) 2
(c) 3 (D) !

60. With a 200 lHz clock frequncj. 16 bit€ cdn te seriallv ente.ed into a snift rssilie. ir
(B) 80 !s

61, The p.incipl€ ol l@alty of Efeele is appUeil in ihe Ne of:


(A) virtual Denory (B) Randod ac@d nenory
(C) Cache ooEory {D) Optical mqnory

62, P,*r B,lB. LnDwn aB:

63, The operation in eldiion,l alsebE fo. viesins a 8et of tupl€s i! :


(A) s€l6d (B) Pej{i
{C) Udion (D) Join

6,1. The .wase @e @npl.xitr of lidear sdEh algolithm i. :

(B) o0os n)
(D) o(! log n)

56. Dab Enc.)"aro! st. hdEe


(A) st€,n.iph* (B) BldI ciplE.
(C) Sub€tilutiotr .ipher (D) Nore otrhee

66, Drts lbout data b :

G0/2016 l0
67, No. oflayerq in OSI relelence nodel:
(B) fivc
(C) Six

63. Iloutds are conponents of lrv;! in OSI referDce lste..

. 69. nov al,Ibil which dddressins noda de. th'6 in€kuctio! usc?
(A) R€sister indirect (B) Bo$index
(C) Base index plus di6placeacnt (D) Rogi.ter

?0. The ndher ol aidbut€B in a relaiion i. mlcd it,! :

(A) cldilarity (B) sie


(C) Scnena (D) Deefte

?r. The operaid used to dmstemt€ t*o 6tringi in OMCI,D i. :

(A) tl (B) S
lc) # (D) %

?r, Afi addq h6 a q' = 0. rvhar aF th€ SUM a $e C!!wlierA = IandB= r?


(A) sItM = 0 C-= 0 G) SttM = 0 Cd= t
(C) SIJM=r C@=0 (D) St l=I Cd=l

?3. F;r dhich inpub the output of ad oxchsiv€.NoR galo b I l


(B) A=l,l=l
(c) A=0,E=0

?!. The depth ol a .onplet€ biMry i$e i6 8ivo. by :

(A) D, =! losrn (B) D, =nlos:n+r


(cl D" =log.n (D) D! =Logln+l

?6. which of tle lollNihg data stNctde i. not lin€ar dato stlucture?
(A) tu.ays (B) Link€d lidk
(c) Both of the above (D) Nono of ihs above

11 60/2016
[P.T,Ol
76. A bi.ary tree eho& eEry noae n.! ei$er zro or t$o childrcn i3 caled :
(A) C.nlleb lre
bina.y (B) Bin,ry *arcl t@
(C) Exbnded binarj rre (D None ofthe above

77. .TlEwoRsT,CAsEonpl€rityof Bul$lc!o.iak nrhm E :

(A) O(n) (B) O{!osn)


(c) o(n1 (D) o(n loc n)

?8. mrich ol the 6[oFi.g io a veb se.ver?


(A) Apa.re (B) IrS
(c) Toncat

7t, Gmdns Ecqoiad by d FSM is :

(A) obb conte\'t t € glamnar iB) Or']y ontert *nsitiv. sr.bndr


(C) Oary rcsdai ranali

30. For ef6cErt $arcbrg conpilerr we


( ) Lin€e *@[ t!bh4 (B) Aidaly *arch t€ble€
(D) Bidry earch trees

61. The Island SiEsmu&.n siruat d in snich rivei?


(A) (ri€hr. (B) CodaEn
(c) Ke'€ri (D) DModa.

8t. Wlic! of the foUowins i. &t aEseiat€d with th€ LahoE Session of r!. ConcresB Dec6nber
1S29?
(A) Councii €ntly
\B) Swaq
Pmrns
(C) Tri6lou! I'Lac hoi6tld
O) Ftut lnd€D€bd€ne Day Jadlary 26, l93o

83. Fin.l apDtu,r ofhdid Fire Y€e Plan. is giED by :


(A) Pbning CoMiBioD (B) N.ii@al DeElopnenr Codcn
(c) R€ereBanl (D) Pesideft

GO/to15 L2
3,r. \t'tah of tld follosins *ds nor tLe Fdad of rhe
(A) DeUn
(O Luclnow

85. The SlqG in bdiE wheF Rtive dismond h'ningridnne:


(A) Mddhya P?aa4h (B) Mlndashka
(C) Utt€r PEtlesh

86. In *hich y.ar lndia honou€il D!. Nebo! 8. Mlndel! br ,*!rdhs Bhdai Rltnr?
(A) !992 (B) r99!
(c) 1990 @) r93?

3?. Th€ Nobel PiE wirn€! lor Pea@ in 20!3 :

(A) LAEA (B) O?Cw


(c) uN&wA (D) I'NCTAD

8& CoDnon We!.lth He!d. of Co@ment M@tins 20rs (CltOCM) ws helil i!


(A) Delli
N€s (B) Da@
(c) I.lan.bad (D) colonho

89- Tlluel which ek.l w* Mmgalyan olbter irjet d into€lrth s orbii?


(A) 16 .
PSLV (B) PSLvC2t
(q PsLv c5 (D) PSLVCg

s0. Ndn6 fi€ cFlonic stdrD tlat hits the @sst! ol Odida @ently :
(A) saiy.n (B) Hdlei
(c) Tbine (D) Phailin

9r. with whicb @uni.y tndi. t@L pdt in Fbt nilit!.y €reEi* "INDBA 20lt?

(c) Anedra

tS. lirhich oftb€ following i6 not th€ tnbutlcs of Bhar*hr Puzha?


(A) Gayaii Puzha (B) Edmdi Puzha
(c) ch,li Puzha @) (.lpa|!i Pult.

l3 6ly2{[6
lP,T.O.l
93. Which is th. prcdoftimnt soil in Kerrld nfttly Rddi.h brown io ycllowLb ..d in @tou?
(A) &n
BIacL cr) Alluviat sil
(C) ht rilic soil (D) S€line sojl

94. The 6nous Pilsrim Cenr.€ \raikoD is situalcd on dre bul! of :


(A) v€nbanad (B) Xlyad&ujlh rEke
(C) d,hlamudi '3tre
take (D) Sasrham6rfa Lake

95. Trilalt udi r@k.cur cwe tebDle, IGvir@r situated in which aisrrici of L€rats?
(A) Koraydn (B) Parhlnemrti[a
(o rdur.ki (D) None

96, Th@ugh qhi.} pEd Mahatawi Kubarana&n Eise his voi@ lsai.Er casre bddera?
1A) Vs€nap@ru (B) Nslini
(c) L,ila (D) Dua'asrlu

9?, Blaasd Kuriak@ Etiactsvara sas bornu ullch dDrnd?


(A) Alappuzha (B) KoUan
(c) Ematul.n o) r$ft,r,r4
98. $licn of ihe foltoqrng id nof .sciaterl wfth Valit on Abdd loadar Moulavi?
(A) Al.I.lsn @) Swad$bhihlni
(C) Chiraysntizh Muslin Sana O) t yal Munannrdans of tndia

99. wrio stutld rh. D,lit LibeEtion Moven€nl Prartyalsha R.kha Ddva Sabla [pRDs]?
{A) Ayy.VaiLuib (B) L Kelappu
(c) Kuar.Cundevan (D) Al,yrrtali

100. Wlich of t[€ touowinB i! not relared to KP. K!!uppd?


iA) ssbha
IGlyanodayini (B) AndndaMahas,bha
(C) Jnanodsyan SabLa (D) Sdn,rga p*d€epa Sabha

6U20r6 11

You might also like