![]() |
TCS PAPER & INTERVIEW - 01 AUG 2007
Rated : +0 , -0
Hi Friends Written test was on 1st Aug. Abt 700 students appeared. the test comprised of most questions 4m earlier test paper. there were 3 sets. Verbal Section The words were Antonyms n Anonyms.. tawdry, brackish, controvert, scanty, banal, indignity, discretion, meagre, incorrigible, misdemenour, indigneous, the aptitude section need just practice of earlier papers...ques like # g(n)+g(n-1)... # t^2/6+5t+3 find the temperature elapsed between 4am to 9am.... #address of array element in which address of 1st element is given...based on formula base address+number of bytes req.((no. of rows -1)* no.of columns+(no.of columns-1))... see that it is row major order or column major order #a simple series problem #which of d following is an integer type..4 fractions were given #greatest prime number of 6,7,8,9-bit pattern (2^6=64 so, ans is 61 likewise) #3 ques on pie & bar chart(industrial distribution) #venn diagram ques (no. of students passed in phy, chem, maths.....) #bucket problem......data packets take 10 milliseconds....20 millisec to be transferred.... #flight problem...latitude & longitude given....to find the local time #A n B can do 70 papers in 10 hrs. B alone can do 50 papers in 10 hrs. A alone can do 26 papers in.....(ans-13 hrs) #velocity*momentum/accln *distance=mass (see these type ques 4m earlier papers) #student gets 3&3.5 in class exam & 1.2 & 1.45 in final exam respectively.What might be the class marks of 3rd student who got 0 marks in final exam #A,B,C are 8-bit binary numbers........to find (A-B)UC #find odd one out a)lisp,java,eiffel,smalltalk(ans-lisp) b)smtp,arp,wap,http,baan(ans-baan) c)sql server,ingress,oracle,db2,java(ans-java) #size of program is given by 4000 *(square root of N).memory is given by sqrt (100*N). if size of program is increased by 1%.find % increase in memory(ans-0.5) #to find base of a number whose decimal equivalent is given Reasoning section comprised of questions exactly 4m GRE Barrons model test papers (12th edition) like a)motorist... 3ways to go from A to C...toll free highway etc... b)red n brown marriage c)all g's are h.... d)few people speak spanish, italian.... e)homer museum.... We had 2 wait a lot before results were out.. few weren't selected 4 the interview. Tech n HR interview: they adopted 2 methods.. some gave combined interview (tech n HR). most gave 2 rounds of interview. Technical Interview u can b asked to say abt ur fav subject. so prepare well on those subjects. most ques were 4m C++, DBMS, Data Structures, Operating System, C, Java.(we r from MCA) # aggregation(4m dbms) # deadlock avoidance(banker's algo) # program of linked list # friend function, copy constructor, operator overloading, multiple inheritance, virtual function # types of polymorphism # normalization # types of sorting algo # sql queries # Unix commands # concurrency control, authorization, joins in dbms, diff between dbms n rdbms # diff between structure n union.wich is better n why # storage classes # diff between procedure n function # OOP features,diff between encapsulation n encryption(1st i was confused but then i said these r 2 diff things n i explained...they'll try 2 confuse u) HR Interview (listen 2 the ppt given by them carefully n u can add points 4m their ppt into ur interview.this sounds good n shows ur sincerity) # Abt urself (prepare this ques very well coz mind this is d best ques 2 make ur impression on them) # ur hobbies # why tcs # ur weaknesses # wat u can add 2 r company # r u ready 4 relocation # which technology wud u prefer(like R n D ,appln dev.) # rate urself on a scale of 1-10 # rate the interviewer # do u think dat u'll b selected # if there is year-gap prepare a solid reason # finally they'll say 2 ask a ques. The result came on 3rd Aug (at 5.30 pm). Finally 285 were selected.we were among those 285. Your confidence is the only key to get into TCS....So be confident. |
© 2008-2013 by IndiaBIX™ Technologies. All Rights Reserved | Copyright | Terms of Use & Privacy Policy
Contact us: info@indiabix.com
Follow us on twitter!