1he SelecLlon process was 4 rounds

1WrlLLen 1esL(90 mlns)

lL was some waL easy?rs agarwal ls enough??

aAppLlLude(40 ques40 mlns)

1)1hey glve 3 blLs on funcLlons llke

l(xo)1

l(0y)3f(xy)3f(00)3 Lhen flnd f(01)f(11)eLc??very easy

2)Cne problem on ageswhlch ls very slmple

3)one blL on Lralns

4)Lhey glve one 3*3 suduku?lL was very easy

8ased on Lhls 3 ques wer e glven

3)venn dlagrams

8ased on Lhls Lhey glve 3 ques lL was easy ?llke ln a college 30 sLudenLs llke Lngllsh60 sLudens llke
maLhs 20 llke boLh???eLc??Lhey ask how many Lngllsh only??llke Lhls vey easy

Any how prepare 8S agarwal lL ls more Lhan enough?????





b1echnlcal wrlLLen(73 ques40 mlns)

1 ls assoclaLed wlLh webservlces

a) WSuL b) WML c) web sphere d) web loglc
2any large slngle block of daLa sLored ln a daLabase such as a plcLure or sound flle whlch does noL
lnclude record flelds and cannoL be dlrecLly searched by Lhe daLabase?s search englne

a) 1A8LL b) 8LC8 c) vlLW d) SCPLML
3Areserved area of Lhe lmmedlaLe access memeory used Lo lncrease Lhe runnlng speed of Lhe compuLer
program

a) sesslon memory b) bubble memory c) cache memory d) shared memory
4a small subneL LhaL slL beLween aLrusLed lnLernal neLwork and an unLrusLer exLernal neLwork such as
Lhe publlc lnLerneL

a) LAn b) MAn c) WAn d) uMZ
3Lechnologles LhaL use radlo waves Lo auLomaLlcally ldenLlfy people or ob[ecLswhlch ls very slmllar Lo
Lhe barcode ldenLlflcaLlon sysLemsseen ln reLall sLores everyday

a)8LuL1CC1P b) 8AuA8 c)8SA SLCu8L lu d)8llu

6maln()

floaL fl 103

double dbl 103

lf(fl dbl)

prlnLf(?unl1Lu WL S1Anu?)

else

prlnLf(?ulvluL Anu 8uLL?)



whaL ls Lhe ouLpuL?

a) compllaLlon error b)unl1Lu WL S1Anu c)ulvluL Anu 8uLL d)llnkage error

7maln()

sLaLlc lnL lvar 3

prlnLf(?d?lvar)

lf(lvar)

maln()



whaL ls Lhe ouLpuL?

a)1 2 3 4 3 b) 3 4 3 2 1 c)3 d)compller errormaln cannoL be recurslve funcLlon

8maln()



exLern lnL lLxLern

lLxLern 20

prlnLf(?d?lLxLern)



whaL ls Lhe ouLpuL?

a)2 b) 20 c)complle error d)llnker error

9#deflne clrscr() 100

maln()

clrscr()

prlnLf(?dnL? clrscr())



whaL ls Lhe ouLpuL?

a)100 b)10 c)compller errord)llnkage error

10maln()



vold vpolnLer

char cPar ?g? *cParpolnLer ?CCCCLL?

lnL [ 40

vpolnLer cPar

prlnLf(?c?*(char*)vpolnLer)

vpolnLer [

prlnLf(?d?*(lnL *)vpolnLer)

vpolnLer cParpolnLer

prlnLf(?s?(char*)vpolnLer +3)



whaL ls Lhe ouLpuL?

a)g40CLL b)g40CCCCLL c)g0CLL d)g4CCC

11#deflne lALSL 1

#deflne 18uL 1

#deflne nuLL 0

maln()

lf (nuLL)

puLs (?nuLL?)

else lf(lALSL)

puLs (?18uL?)

else

puLs (?lALSL?)



whaL ls Lhe ouLpuL?

a) nuLL b) 18uL c) lALSL d)0

12maln()

lnL l 3[ 6 z

prlnLf(?d?l+++[)



whaL ls Lhe ouLpuL?

a)13 b)12 c)11 d) compller error

13maln()

lnL l

l accumulaLor()

prlnLf(?d?l)



accumulaLor()

_Ax 1000



whaL ls ouLpuL?

a)1 b)10 c)100 d)1000

14maln()

lnL l 0

whlle(+(+l)! 0)

l l++

prlnLf(?d?l)



whaL ls Lhe ouLpuL?

a)1 b)0 c)1 d)wlll go ln an lnflnlLe loop

13maln()

lnL l 3

for( l++0Wlnk

prlnLf((?d?l)



whaL ls Lhe ouLpuL?

a)1b)2c)1 2 3d)compller errorL value requlred

16maln()

lnL l 10 [ 20

[ l [?(l[)?l [[

prlnLf(?dd?l[)

whaL ls Lhe ouLpuL?

a)20 b)20 c)10 d)10

17maln()

exLern l

prlnLf(?dL?l)

lnL l 20

prlnLf(?dL?l)





whaL ls ouLpuL?
a) ?LxLern valueof l ? 20 b)LxLernvalue of l?c)20d)llnker Lrrorunresolved exLernal symbol l

18lnL ulMenslon(lnL array)

reLurn slzeof(array/slzeof(lnL)

maln()

lnL arr10

prlnLf(?Array dlmenslon ls d?ulMenslon(arr))



whaL ls ouLpuL?

a)array dlmenslon ls 10 b)array dlmenslon ls 1

c) array dlmenslon ls 2 d)array dlmenslon ls 3

19maln()



vold swap()

lnL x 43 y 13

swap(xy)

prlnLf(?x d yd?xy)



vold swap(lnL *a lnL *b)

*a*b *b*a *a *b

whaL ls Lhe ouLpuL?
a) x 13 y 43 b)x 13 y 13 c)x 43 y 13 d)x 43 y 43

20maln()

lnL l 237

lnL *lpLr l

prlnLf (?dd?*((char*)lpLr)* ((char *)lpLr+1))



whaL ls ouLpuL?

a)1 237 b)237 1c)0 0d)1 1

21maln()

lnL l 300

char *pLr l

*++pLr2

prlnLf(?d?l)



whaL ls ouLpuL?

a)336 b)300 c)2 d)302



22 #lnclude

maln()

char *sLr ?yahoo?

char *pLr sLr

char leasL 127

whlle(*pLr++)

leasL (*pLr

prlnLf (?d?leasL)



whaL ls Lhe ouLpuL?

a)0 b)127 c) yahoo d) y

23ueclare an array of M polnLers Lo funcLlons reLurlng polnLers Lo funcLlons reLurlng polnLers Lo
characLers

a)(*pLrM()(char*(*)()) b)(char*(*)())(*pLrM)()

c) (char*(*)(*pLrM())(*pLrM () d)(char*(*)(char*()))(*pLrM) ()

24vold maln()

lnL l 10 [2

lnL *lp l *[p [

lnL k *lp/*[p

prlnLf(?d?k)



whaL ls Lhe ouLpuL?

a)2 b)3 c)10 d)complle errorunexpecLed end of flle ln commenL sLarLed ln llne 4

23maln()


char a4 ?CCCCLL?

prlnLf(?s?a)



whaL ls Lhe ouLpuL?

a)2 b) CCCCLL c) complle error yoo manL lnlLlallzers d) llnkage error

26lor 1M8 memory Lhe number of address llnes requlred

a)12 b)16 c)20 d)32

271here ls a clrculL uslng 3 nand gaLes wlLh 2 lnpuLes and 1 ouLpuLf lnd Lhe ouLpuL

a) Anu b) C8 c) xC8 d) nAnu

28whaL ls done for push operaLlon

a) S ls lncremenLed and Lhen Lhe value ls sLored

b) C ls lncremenLed and Lhen Lhe value ls sLored

c) C ls decremenLed and Lhen Lhe value ls sLored

d) S ls decremenLed and Lhen Lhe value ls sLored

29Memory allocaLlon of varlables declared ln a program ls

a) AllocaLed ln 8AM

b) AllocaLed ln 8CM

c) AllocaLed ln sLack

d) Asslgned ln reglsLers

30WhaL acLlon ls Laken when Lhe processer under execuLlon ls lnLerrupLed by 18A ln 8083Mu?

a) rocessor serves Lhe lnLerrupL requesL afLer compleLlng Lhe execuLlon of Lhe currenL lnsLrucLlon

b) processer serves Lhe lnLerrupL requesL afLer compleLlng Lhe currenL Lask

c) processor serves Lhe lnLerrupL lmmedlaLely

d) processor servlng Lhe lnLerrupL requesL depenL deprnds upon Lhe prlorlLy of Lhe currenL Lask under
execuLlon

31purpose of C (program counLer)ln a mlcroprocessor ls

a) 1o sLore address of 1CS(Lop of sLack)

b) 1o sLore address of nexL lnsLrucLlons Lo be execuLed

c) counL Lhe number of lnsLrucLlons

d) Lo sLore Lhe base address of Lhe sLack

32condlLlonal resulLs afLer execuLlon of an lnsLrucLlon ln a mlcroprocess ls sLored ln

a) reglsLer b) accumulaLor c) flag reglsLer d) flag reglsLer parL of SW (program sLaLus word)

331he C8 gaLe can be converLed Lo Lhe nAnu funcLlon by addlnggaLe(s)Lo Lhe lnpuL of Lhe C8 gaLe

a) nC1 b) Anu c) nC8 d) xC8

34ln 8031mlcroconLroller has a dual funcLlon

a) porL 3 b) porL 2 c) porL 1 d) porL 0

33An 8083 based mlcroprocessor wlLh 2MPz clock frequencywlll execuLe Lhe followlng chunk of code
wlLh how much delay?

Mvl 838P

PA? Mvl C llP

SAuu? uC8 C

!nZ SAuu?

uC8 8

!nC PA?
a) 1023 b)1143 c)1003 d)120

36ln 8083 Mu whaL wlll be Lhe sLaLus of Lhe flag afLer Lhe execuLlon of Lhe followlng chunk of code

Mvl 8llP

MCv A8

CMA

PL1

a)S 1 Z 0 C? 1 b)S 0 Z 1 C? 0

c) S 1 Z 0 C? 0 d)S 1 Z 1 C? 1

37A poslLlve golng pulse whlch ls always generaLed when 8083 Mu beglns Lhe machlne cycle

a) 8u b) ALL c) W8 d) PCLu

38when a lnsLrucLlon of 8083 Mu ls feLched lLs second and Lhlrd byLes are placed ln Lhe W and Z
reglsLers

a) !M b) S1A c) CALL d) xCPC

39whaL ls deflned as one subdlvlslon of Lhe operaLlon performed ln one clock perlod

a) 1 SLaLe b) lnsLrucLlon Cycle c) Machlne Cycle d) All of Lhe above

40AL Lhe end of Lhe followlng code whaL ls Lhe sLaLus of Lhe flags

Lxl 8 ALC4P

MCv AC

Auu 8

PL1 a) S 1 C? 0 0 AC 1 b) S 0 C? 1 0AC 1 c) S 0 C? 1 0 AC 1 d) S 0 C?
1 1 AC 1


461he repeaLed execuLlon of a loop of code whlle walLlng for an evenL Lo occur ls called 1he cpu
ls noL engaged ln any real producLlve acLlvlLy durlng Lhls perlodand Lhe process doesn?L progress
Lowards compleLlon
a) dead lock b) busy walLlng c) Lrap door d) none
47 1ransparenL u8MS ls deflned as
a) A u8MS ln whlch Lhere are no program or user access languages b) A u8MS whlch has no cross flle
capablllLles buL ls user frlendly and provldes user lnLerface managemenL c) A u8MS whlch keeps lLs
physlcal sLrucLure hldden from user d) none
48LlLher all acLlons are carrled ouL or none areusers should noL have Lo worry abouL Lhe effecL of
lncompleLe LranscLlonsu8MS ensures Lhls by undolng Lhe acLlons of lncompleLe LranscLlonsLhls
properLy ls known as
a) AggregaLlon b) aLomlclLy c) assoclaLlon d) daLa lnLegrlLy
49 algorlLhms deLermlnes where ln avallable Lo load a program common meLhods are flrsL flLnexL
flLbesL flL algorlLhm are used when memory ls full and one process (or parL of a process) needs
Lo be swaped ouL Lo accommodaLe a new program1he algorlLhm deLermlnes whlch are Lhe
parLlons Lo be swaped ouL
a) placemenL placemenL replacemenL
b) replacemenL placemenL placemenL
c) replacemenL placemenL replacemenL
d) placemenL replacemenL replacemenL
301rap door ls a secreL undocumenLed enLry polnL lnLo a program used Lo granL access wlLhouL normal
meLhods of access auLhenLlcaLlonA Lrap ls a sofLware lnLerrupLusually Lhe resulL of an error condlLlon
a)Lrue b)false

33ln recurslve lmplemenLaLlons whlch of Lhe followlng ls Lrue for savlng Lhe sLaLe of Lhe sLeps

a) as full sLaLe on Lhe sLack

b) as reverslble acLlon on Lhe sLack

c) boLh a and b

d) none

36whlch of Lhe followlng lnvolves conLexL swlLch

a) prevlllged lnsLrucLlon

b) floaLlng polnL excepLlon

c) sysLem calls

d) all

e) none

37plggy backlng ls a Lechnlque for

a) acknowledge

b) sequence

c) flow conLrol

d) reLransmlsslon

38 a funcLlonal dependency x? ls ___________dependency lf removal of any aLLrlbuLe A from x means
LhaL Lhe dependency does noL hold any more

a) full funcLlonal

b) mulLl valued

c) slngle valued

d) none

39)a relaLlon schema 8 ls ln 8Cnl lf lL ls ln ___________and saLlsfles an addlLlonal consLralnLs LhaL for
every funcLlonal dependency x?x musL be a candldaLe key
a)1 nl

b)2 nl

c)3 nl

d)3 nl

60) a _________sub query can be easlly ldenLlfled lf lL conLalns any references Lo Lhe parenL sub query
columns ln Lhe _________ clause

A) correlaLed WPL8L

b) nesLed SLLLC1

c) correlaLed SLLLC1

d) none

31purpose of C (program counLer)ln a mlcroprocessor ls

a) 1o sLore address of 1CS(Lop of sLack)

b) 1o sLore address of nexL lnsLrucLlons Lo be execuLed

c) counL Lhe number of lnsLrucLlons

d) Lo sLore Lhe base address of Lhe sLack

32condlLlonal resulLs afLer execuLlon of an lnsLrucLlon ln a mlcroprocess ls sLored ln

a) reglsLer b) accumulaLor c) flag reglsLer d) flag reglsLer parL of SW (program sLaLus word)

331he C8 gaLe can be converLed Lo Lhe nAnu funcLlon by addlnggaLe(s)Lo Lhe lnpuL of Lhe C8 gaLe

a) nC1 b) Anu c) nC8 d) xC8

34ln 8031mlcroconLroller has a dual funcLlon

a) porL 3 b) porL 2 c) porL 1 d) porL 0

33An 8083 based mlcroprocessor wlLh 2MPz clock frequencywlll execuLe Lhe followlng chunk of code
wlLh how much delay?

Mvl 838P

PA? Mvl C llP

SAuu? uC8 C

!nZ SAuu?

uC8 8

!nC PA?
a) 1023 b)1143 c)1003 d)120

36ln 8083 Mu whaL wlll be Lhe sLaLus of Lhe flag afLer Lhe execuLlon of Lhe followlng chunk of code

Mvl 8llP

MCv A8

CMA

PL1

a)S 1 Z 0 C? 1 b)S 0 Z 1 C? 0
c) S 1 Z 0 C? 0 d)S 1 Z 1 C? 1

37A poslLlve golng pulse whlch ls always generaLed when 8083 Mu beglns Lhe machlne cycle

a) 8u b) ALL c) W8 d) PCLu

38when a lnsLrucLlon of 8083 Mu ls feLched lLs second and Lhlrd byLes are placed ln Lhe W and Z
reglsLers

a) !M b) S1A c) CALL d) xCPC

39whaL ls deflned as one subdlvlslon of Lhe operaLlon performed ln one clock perlod

a) 1 SLaLe b) lnsLrucLlon Cycle c) Machlne Cycle d) All of Lhe above

40AL Lhe end of Lhe followlng code whaL ls Lhe sLaLus of Lhe flags

Lxl 8 ALC4P

MCv AC

Auu 8

PL1

a) S 1 C? 0 0 AC 1 b) S 0 C? 1 0AC 1

c) S 0 C? 1 0 AC 1 d) S 0 C? 1 1 AC 1
461he repeaLed execuLlon of a loop of code whlle walLlng for an evenL Lo occur ls called 1he cpu
ls noL engaged ln any real producLlve acLlvlLy durlng Lhls perlodand Lhe process doesn?L progress
Lowards compleLlon a) dead lock b) busy walLlng c) Lrap door d) none


47 1ransparenL u8MS ls deflned as
a) A u8MS ln whlch Lhere are no program or user access languages b) A u8MS whlch has no cross flle
capablllLles buL ls user frlendly and provldes user lnLerface managemenL c) A u8MS whlch keeps lLs
physlcal sLrucLure hldden from user d) none
48LlLher all acLlons are carrled ouL or none areusers should noL have Lo worry abouL Lhe effecL of
lncompleLe LranscLlonsu8MS ensures Lhls by undolng Lhe acLlons of lncompleLe LranscLlonsLhls
properLy ls known as
a) AggregaLlon b) aLomlclLy c) assoclaLlon d) daLa lnLegrlLy
49 algorlLhms deLermlnes where ln avallable Lo load a program common meLhods are flrsL flLnexL
flLbesL flL algorlLhm are used when memory ls full and one process (or parL of a process) needs
Lo be swaped ouL Lo accommodaLe a new program1he algorlLhm deLermlnes whlch are Lhe
parLlons Lo be swaped ouL
a) placemenL placemenL replacemenL
b) replacemenL placemenL placemenL
c) replacemenL placemenL replacemenL
d) placemenL replacemenL replacemenL
301rap door ls a secreL undocumenLed enLry polnL lnLo a program used Lo granL access wlLhouL normal
meLhods of access auLhenLlcaLlonA Lrap ls a sofLware lnLerrupLusually Lhe resulL of an error condlLlon
a)Lrue b)false
32whlch one of Lhe followlng ls Lhe recurslve Lravel Lechnlque
a)depLh flrsL search b)preorder c)breadLh flrsL search d)none

33ln recurslve lmplemenLaLlons whlch of Lhe followlng ls Lrue for savlng Lhe sLaLe of Lhe sLeps

a)as full sLaLe on Lhe sLack
b) as reverslble acLlon on Lhe sLack
c)boLh a and b
d)none

36whlch of Lhe followlng lnvolves conLexL swlLch

a) prevlllged lnsLrucLlon

b) floaLlng polnL excepLlon

c) sysLem calls
d)all
e) none

37plggy backlng ls a Lechnlque for

a) acknowledge
b) sequence

c) flow conLrol
d) reLransmlsslon

38 a funcLlonal dependency x? ls ___________dependency lf removal of any aLLrlbuLe A from x means
LhaL Lhe dependency does noL hold any more
a) full funcLlonal

b) mulLl valued
c) slngle valued

d) none

39)a relaLlon schema 8 ls ln 8Cnl lf lL ls ln ___________and saLlsfles an addlLlonal consLralnLs LhaL for
every funcLlonal dependency x?x musL be a candldaLe key
a)1 nl

b)2 nl

c)3 nl

d)3 nl

60) a _________sub query can be easlly ldenLlfled lf lL conLalns any references Lo Lhe parenL sub query
columns ln Lhe _________ clause

A) correlaLed WPL8L

b) nesLed SLLLC1

c) correlaLedSLLLC1

d) none

61) hybrld devlse LhaL comblnes Lhe feaLures of boLh brldge and rouLer ls known as
a)rouLer b)brldge c)hub d)brouLer

62) whlch of Lhe followlng ls Lhe mosL cruclal phase of SuLC

a) LesLlng b) code generaLlon c) analysys and deslgn d) lmplemenLaLlon

63)Lo send a daLa packeL uslng daLagram connecLlon wlll be esLabllshed

a) no connecLlon ls requlred

b) connecLlon ls noL esLabllshed before daLa Lransmlsslon

c) before daLa Lransmlsslon

d) none

64)a sofLware LhaL allows a personal compuLer Lo preLend as as compuLer Lermlnal ls

a) Lermlnal adapLer

b) Lermlnal emulaLlon

c) modem

d) none

63) super key ls

a) same as prlmary key

b) prlmary key and aLLrlbuLe

c) same as forelgn key

d) forelgn key and aLLrlbuLe

66ln blnary search Lree whlch Lraversal ls used for ascendlng order values
a) lnorder b)preorder c)posL order d)none

67?ou are creaLlng an lndex on 8CLLnC colume ln Lhe S1uuLn1 Lablewhlch sLaLemenL wlll you use?

a) C8LA1L lnuLx roll_ldx Cn sLudenL rollno

b) C8LA1L lnuLx roll_ldx lC8 sLudenL rollno

c) C8LA1L lnuLx roll_ldx Cn sLudenL( rollno)

d) C8LA1L lnuLx roll_ldx lnuLx Cn sLudenL (rollno)

68A________class ls a class LhaL represenLs a daLa sLrucLure LhaL sLores a number of daLa ob[ecLs
a conLalner bcomponenL cbase dderlved

69Whlch one of Lhe followlng phases belongs Lo Lhe compller 8ackend

a Lexlcal Analysls bSynLax Analysls c CpLlmlzaLlon dlnLermedlaLe 8epresenLaLlon

70Lvery conLexL _senslLlve language ls conLexL_free

a Lrue bfalse

71lnpuLA ls nonempLy llsL of numbers L

xrlnflnlLy

lor each lLem ln Lhe llsL Ldo

lf Lhe lLemxLhen

xrhe lLem

8eLurn x

x represenLs

a)largesL number

b)smallesL number

c)smallesL negaLlve number

d) none

72LeL A and 8 be nodes of a heapsuch LhaL 8 ls a chlld of A Lhe heap musL Lhen saLlsfy Lhe followlng
condlLlons

a) key(A)key(8)

b) key(A)

c) key(A)key(8)

d) none

73SLrlng LlsLSLackqueue are examples of___________

a) prlmlLlve daLa Lype

b) slmple daLa Lype

c) AbsLracL daLa Lype

d) none

74whlch of Lhe followlng ls noL Lrue for LlnkedLlsLs?

a) 1he slmplesL klnd of llnked llsL ls a slngle llnked llsL whlch has one llnk per node Lhls llnk polnLs Lo Lhe
nexL node ln Lhe llsLor Lo a null value or empLyllsL lf lL ls Lhe lasL node
b)a more sophlsLlcaLed klnd of llnked llsL ls a double llnkedllsL or Lwo way llnkedllsL Lach node has Lwo
llnks one Lo Lhe prevlous node and one Lo Lhe nexL node

c) ln a clrcleLlnkedLlsL Lhe flrsL and lasL nodes are llnked LogeLherLhls can be done only for double
llnked llsL

d) Lo Lraverse a clrcular llnkedllsL u begln aL any node and follow Lhe llsL ln elLher dlrecLlon unLll u reLurn
Lo Lhe orlglnal node

73senLlnel node aL Lhe beglnnlng and /or aL Lhe end of Lhe llnkedllsL ls noL used Lo sLore Lhe daLa
a) Lrue

b) false