IBM Interview Model

There are two rounds of interviews, viz., the technical and and the HR round Technical and Personal Round for Software Candidates Mainly sub ective !uestions in C, "#eratin$ Syste%s, &BMS, &ata Structures are as'ed inters#ersed with so%e on the candidate(s #ersonal bac'$round. .Ty#ical !uestions in C and &ata Structures ). *+P to interchan$e , variables without usin$ the third one ,. -.#lain !uic' sort and %er$e sort al$orith%s a%n derive the ti%e/constraint relation for these. 0. -.#lain binary searchin$, fibonacci search 1. 2eneral !uestions on binary trees, transversals 3. 2eneral !uestions on $ra#hs and their re#resentation. Ty#ical 4uestions on "#eratin$ Syste%s ). &e%and #a$in$, #a$e faults, re#lace%ent al$os, thrashin$, etc ,. Pa$ed se$%entation and se$%ent #a$in$ In this section, case studies are #resented are #resented before the candidate to #ercieve his reaction and his5her co%%unication s'ills are tested. IBM e.#ects tea%wor' and tea%s#irit fro% the candidates and their answers should reflect this attitude

nu%bers we need to chec' whether >=: is #ri%e or not< 1. a #ersons a$e is si%ilar to the year he was born 6last two di$its is counted as a$e9. ans. ?=. 3. what is @+CC< ans. yet another co%#iler co%#iler. A. flo# is a unit of < ans. #rocessin$ s#eed. :.Bdefine hello6.,y9 #rintf6Be.#rCDdC,e.#r9E %ain69F float .G),yG,E e.#rG.5yE hello6e.#r9E H ans. .5yG)E
?.!uestion

IBM Ca%#us Place%ent Pa#er 6Technical/C C77, &S, S489 Set/)

).:;,30. last di$it< ans. : ,.)=;)=;)= how %uch ti%e will it ta'e to write this nu%ber, if it ta'es ) sec to write ) di$it. a.)=== secs. b.)= year. c. %ore than ) %illion years. d. a few days. ans. %ore than ) %illion years. 0. startin$ fro% , u#to how %any

on Bi#artite $ra#h 6definition9.

>.hea#/sortin$

al$orith% ti%e co%#le.ity. 6+nsI nlo$n9 )=.white/bo. testin$.

)).#ostfi.

evaluation ofI 6+7B9JC6+nsI

+B7CJ9
),.!uestion )0.#arity

on catch/throw< c77

bit<6+nsI as error detection9.

)1.%ain69F

%ain69E H ans.stac' overflow.

)3.%ain69

a. .G.7y7),b././y/),c./.7y7).... A. *hat does Tri$$er do< :. In which to#olo$y we use less a%ount of cables.
a. rin$,

F char a,bE #rintf6CDdDdDdDdC,sizeof6KaK9E sizeof6LM889,sizeof6b9,sizeof6%ain99E H +ns6),),),,9

)A.five

b. bus, c. star, d. %esh

?. *hich sortin$ techni!ues is best for already sorted array...<. +nsI bubble sort >. *hich is said to be a real/ti%e syste%.< a. credit card syste% b online fli$ht reservation syste% c brid$e control syste%...not sure )=. deci%al to octal conversion #roble%< ans + )). + #erson havin$ a5c nu%ber, a5c na%e, ban' na%e, a5c ty#e.. which is the #ri%ary a%on$ the above< ),. why data inte$rity is used<

file sizes $iven . what should be the order of their access so that least ti%e is ta'en. ans. least size first.
):.

S48 !uery does what<

Set/, IBM Place%ent Pa#er 6Technical9

). what does vector #rocessin$ do< ,. *hat is the use of software confi$uration %ana$e%ent< 0. what co%%and is used to a##end two files usin$ who that is listed by lsE 1. if there is a #roble% in a networ' durin$ trans%ission which is used to detect that< a. #rotocol analyzer, b. SLMP.... 3. In C, ./Gy7) how will u re#resent it..

)0. if a #ri%ary 'ey is an attribute of another one table %eans........ a. candidate 'ey b. forei$n 'ey

c. su#er 'ey d. co%#osite 'ey )1. int 6Ja9N1O. -.#lain this e.#ression )3. &ifference between =),0 and ),0 in c +ns I 1= )A. in c r7 is used for a. read only b. writin$ only c. both ) and ,

-. +ll the above +ns I -. 1. *hich one of the followin$ is not related with files< +. fo#en B. fclose C. freo#n &. fftell -. none +nsI & 3. *hich one of the followin$ is not a 'eyword< +. volatile B. inc C. sizeof &. default -. none +ns I B A. Ro% is +ns I non Qolatile, cannot be chan$ed and it contains boot u# #ro$ra%. :. How %any different binary trees can be for%ed by 1 nodes< +ns I ), LoteI6, #ower n9 R n Sa$an/ ansI )1 6!uetion ,3 in )>) #a$e9 Por 0 nodes ans is 3.

Set/0
). +n attribute in a table that is related with #ri%ary 'ey of the another table is called... +ns I Porei$n 'ey ,. The sco#e of the static variable is... +ns I function 0. *hich of the followin$ has the function sco#e< +. +uto%atic B. Static C. 2lobal &. 2oto label

loaded with ?. char J# G 6char J9)= %eans +.It #oints to the value at address )=. B.It returns the character whose +SCII value is )=. +ns I + >. Runnin$ ti%e of a function f6n9G?T6n5,97!n for nT), where ! is a constant... +ns I n #ower 0. 6Chec' the answer9/ correct )=. "rder of Bubble sort +ns I "6n #ower ,9 )). *ritin$ co%%ents +. Increases .e.e file size. B. Is a $ood #ro$ra%%in$ #ractice. c. Ta'es %ore co%#ilation ti%e. +ns I B.Is a $ood #ro$ra%%in$ #ractice. ),. Convert the followin$ deci%al nu%ber into He. nu%ber... )=:A: +ns I ,+=Ph )0. Qector #rocessin$ %eans +ns I Processin$ the colu%n vector ele%ents #arallelly. )1. Constant %e%ber function can be +. Constant %e%ber function. B. Static %e%ber function. C. Cannot be overloaded. +ns I C. Cannot be overloaded. )3. By usin$ which of the followin$ functions, we can access the %e%bers of the two instances of a sa%e class +. Me%ber function. B. Priend function C. Both + and B. &. Leither + nor B. -. none. +ns I C. )A. -.ce#tion s#ecification is in c77 to #rovide +. &ocu%entation B. "b ect oriented ness C. -rror handlin$ +ns I c ):. *hich one of the followin$ is a #arse $enerator< +. @aCC B. 8e. C. Qi &. -%ac -. none

+ns I @aCC
?. CSM+5C& is used in

Set/1
). Conte.t free $ra%%ar is acce#ted by a9 finite auto%ata b9 #ush down auto%ata c9 two way bounded auto%ata d9 both b and c ,. *hich is not a %e%ory %ana$e%ent sche%e< a9 buddy syste% b9 swa##in$ c9 %onitors d9 #a$in$ +ns I c 0. Si%#lify the Uarnau$h %a# $iven below and derive its e.#ression in S"P for% /))/ )//) )//) /))/ 1. 4uestion on L+L& $ates i%#le%entation. 3. &efinition of Conte.t Sensitive 2ra%%ar A. +n identifier can start with a letter followed by any nu%ber of letter or di$its . :. *ith the followin$ confi$urationI ?MB total %e%ory, ,3A'b cache , 1'b is bloc' size. Msin$ direct %a##in$, how %any different #hysical %e%ory bloc's can be %a##ed on to the cache. 6a9 A1 6b9 ,3A 6c9 ),?

a9 To'en rin$ b9 P&&I c9 -thernet

>. In TCP5IP header, chec'su% contains a9 su% of all the words b9 ones co%#le%ent of the data c9 ones co%#le%ent of the su% of all the words d9 ones co%#le%ent of the su% in ones co%#le%ent )=. *hat is the %a.i%u% nu%ber of ac'nowled$e%ents for a 1 bit se!uence nu%ber in a slidin$ window #rotocol. )). *hich is a $ood way of re#resentin$ variables in recursion a9 local variables b9 static variables c9 $lobal variables ),. 2iven the followin$ c #ro$ra% func69 F static int i G )=E #rintf6CDdC,i9E i77E H *hat is the value of i if the function is called twice <

)0. 2iven the followin$ c #ro$ra% func6int Ji, intJ 9 FJiGJi J JiE

J GJ J J E H %ain69 F int i G 3, G ,E func6Vi,V 9E #rintf6CDd DdC, i, 9EH *hat is the out#ut< )1. 2iven #a$e table, #a$e size and offset find the corres#ondin$ #hysical address < )3. In a %e%ory chi# 1' size and )Abit words are to be stored. Lo of address and data lines re!uired isI )A. Identify in which #ass of the , #ass co%#iler are the followin$ co%#iled )9 literals ,9 address resolution 09 listin$ ):. "b ect code does not re!uire a9 relocation bits b9 e.ternal na%es and #lace where they are located c9 absolute adress d9 all the ob ect codes

,=. *hat is the order of Hashin$ ti%eI a9 =6)9 b9 =6n,9

,). 2iven thatI s /T s 7 s E s /T s J s E s /T a Pind the no of #arse trees for a7aJa7a a9 1 b9 3 c9 A d9 : ,,. "rder of deletin$ a node fro% a lin'ed list. 6#ointer is to an arbitrary node9 a9=6)9 b9=6n9

,0. + chocolate of size nWn is $iven and is to be %ade into #ices of size ).). +t a ti%e both horizontal and a vertical cut is done. Pind the order of co%#le.ity a9 "6n,9 b9 "6nlo$n9 c9 "6lo$n9 ,1. + directed $ra#h is re#resented by ad acency list. To find the co%#le.ity of in de$ree of the node. e / ed$e n/ vertices ,3. Lo of leaf nodes $iven. find the no of nodes with de$ree ,.

)?. +RP is in reference to a9 M+C to IP b9 IP to M+C

)>. 4uestion on Balanced tree / + balanced tree is $iven and a node is added at the leaf. Pind the no of unbalanced nodes<

,A. +W G B. + is %Wn and B is %W) a9 there is a uni!ue solution if ran' of + is sa%e as ran' of au$u%ented %atri. N+ bO

b9 there are %ulti#le solutions

a9 ) #erson will ta'e left one and all other will ta'e ri$ht one b9 ad acent #ersons should not eat concurrently 00. In the #rocess state cycle, which is the correct order a9 ti%eoutI ready /T runnin$ b9 bloc'edI ready /T runnin$ 01. Por convertin$ infi. e.#ression to #ostfi. what do we re!uire a9 o#erand stac' b9 o#erator stac'

,:. 8WI s#,,=>>h 8WI b, ,=),h PMSH b

,?. + and B are sets. +Ks cardinality is % and BKs is n where % X n .How %any one to one %a##in$s can be obtained. a9 n ; % b9 n#% c9 %#n d9 %cn

03. = is re#resented as both and ne$ative and #ositive in a9 ones co%#le%ent b9 twos co%#le%ent c9 twoKs co%#le%ent has e.tra ne$ative nu%ber 0A. *hat is the difference between c and c77< a9 In c77 we can define variables in the %iddle b9 dyna%ic scoo#in$

,>. In schedulin$ al$orith%s which are lo$ically e.ecuted but sus#ended a9 #ree%#tive b9 SSP c9 non #ree%#tive d9 all the above

0=. I5" redirection is a9 co#yin$ #ro$ra%s files throu$h a #i#e b9 in#ut files are created c9 in#ut file ta'en fro% e.istin$ ones d9 none 0). Sy%%etric %ulti#rocessin$ can be done in a9 snoo#y #rotocols b9 cache coherence 0,. In the dinin$ #hiloso#hers #roble%s to avoid dead loc' 0:. *hich of the followin$ is correct a9 Synchronous trans%ission needs %ore bandwidth than +synchronous. b9 Inasychronous trans%ission , the ti%e is associated with data itself.....

Set/3
). what is vector #rocessin$ ,. what is data inte$rity 0.which to#olo$y ta'es %ini%u% wirin$ 1.best sortin$ if ele%ents are already sorted +nsI insertion sort 3.software confi$uration %ana$e%ent ///// +nsI o#tion a 6 but chec' it fro% S- te.t boo' there are only , confusin$ answers9 A.In networ' the #ac'ers are flowin$ unnecessarily what is the way to control it and .... :.so%e octal no to deci%al conversion for $iven octal no the last di$it was : +nsI the o#tion a 6 the deci%al last di$it was )9 ?. ./Gy7) is e!uivalent to +nsI .G./y/) 6sure9 because it is inter#reted as .G./6y7)9 >. in a student for% what is the relationshi# b5w student and course +nsI actually it is %any to one but they s#ecified in a student for% so thin' and write. )=.which is correct to a##end the out#ut of ls and who to so%e file .. +nsI 6whoEls9TT. 6chec' it9 ),.what ha##ens when we o#en a file in r7 %ode li'e whether file will be created if it s not there can we write to file ... )0. what is R"M +nsI it contains boot u# #ro$ra% and it is not accessible that was one answer and another o#tion was it is non volatile 6 choose one a%on$ these ,9 )1. what is int 6Ja9N1O +nsI #ointer to an array of 1 inte$er 6chec' it9 )3. #ri%ary 'ey of another table is #resent and so on.......... +nsI forei$n 'ey )A. what is the difference b5w =),0 and ),0 in c< +nsI 1=6sure9 ):. which a%on$ the devices is s#ooled device +nsI #rinter 6correct9 )?. if u $et error in ada#ter which device will u use< )>. which is the real ti%e a##lication +nsI robotics )).what is tri$$er in &BMS 6'now what it will do9

Set/A

IBM Technical Pattern

). what does vector #rocessin$ do< ,. *hat is the use of software confi$uration %ana$e%ent< 0. what co%%and is used to a##end two files usin$ who that is listed by lsE 1. if there is a #roble% in a networ' durin$ trans%ission which is used to detect that< a. Protocol +nalyzer, b. S L M P 3. In C, ./Gy7) how will u re#resent it.. a..G.7y7),b././y/),c./.7y7).... A. *hat does Tri$$er do< :. In which to#olo$y we use less a%ount of cables.< Rin$, Bus, Star, Mesh ?. *hich sortin$ techni!ues is best for already sorted array...<. +nsI bubble sort >. *hich is said to be a realti%e syste%.< ). Credit card systen ,. "nline fli$ht reservation syste% 0. Brid$e control systen...not sure )=. deci%al to octal conversion #roble%< +ns + )). + #erson havin$ a5c nu%ber, a5c na%e,ban' na%e, a5c ty#e.. which is the #ri%ary a%on$ the above< ),. why data inte$rity is used< )0. if a #ri%ary 'ey is an attribute of another one table %eans........ ). candidate 'ey

,. forei$n 'ryey 0. seconda )1. int 6Ja9N1O. -.#lain this e.#ression )3. &ifference between =),0 and ),0 in c +ns I 1= )A, in c r7 is used for ). read only ,. writin$ only 0. both ) and ,

Set/:
).&ifference between ),0 and "),0 in c lan$ua$e ,.The co%%and used to count the nu%ber of lines in MLIWI 0.The co%%ands li'e cat, date are stored inYYYYYYYYYYY directoryI a95dev, b95te%#, c95#ro$

1.The attribute of one table is used as the 'ey address of another table. this 'ind of address is called a9 forei$n address b9 #ri%ary address c9 secondary address )A.int c while6cZG$etchar69ZGB9 #utchar69E H if the in#ut is +BC&B ,what will b the out#ut<

):.Inline function is used for< )?.co%%entI F float a,b,cE if6bJb/1JaJc9G=.=#rintf6[the roots r e!ual\9E H )>. int .G)1,yG)=,zG0E .JGy7)7zE #rintf6[Dd\,.9E Hwhat is the value of . ,=.1=D of the #eo#le read news#a#er +,3=D B,)=D both +VB. how %any D doesnKt read any of the both< ,).relation between class and structure]6so%ethin$ li'e #ublic ,#rivate..9 ,,.which o#erator cannot be overloaded< <I ,0.which of the $iven state%ents is true ^but overloadin$<