Search results for: “ic”

TechMahindra(MBT) Paper on 17 March 2010

WRITTEN ROUND:
QUESTIONS-100 TIME DURATION-60 MINS.(sectional cutoff is there but no negative marking)
the written paper consisted of the following section:
1) analytical reasoning-35 questions.(difficult)
2) non-verbal-20 questions.(easy)
3) quantitative aptitude-15 questions.(average)
4) verbal section 1-10ques(easy)
5) verbal section 2-10 ques(easy)
6) verbal section 3-10 ques(easy)
Analytical section consists of questions on series (alphabetical & numerical) and figures. Non verbal consists of ques like
apple:fruit :: parrot:_________.
Quantitative section consists of questions on time and work,time and distance, ages ,clocks, averages, percentages, etc.

Verbal sections consists of simple grammatical questions, antonyms, synonyms, sentence completion & 2 short passages.
Friends note that in Tech Mahindra getting shortlisted is the major hurdle. once shortlisted other rounds are just a cake walk. TIME MANAGEMENT is the key. do not panic. cutoff was 52 out of 100. according to me there wasnt any sectional cutoff.

TECHINICAL INTERVIEW:
tell me abt urself?
what are transformers?explain it to me practically.
how does it work?
why do we use it?
your marks in 3rd and 4th sems are very less.why?
do you know C and C++?
what are pointers?
what is a class?
tell me about your project?
explained the source code of your project. explain the logic of the code .

HR INTERVIEW:
this round is just a formality and it is basically to check your communication skills.he asked me questions like tell me about yourself and why do you want to join tech mahindra.

TechMahindra(MBT) Paper on 16th February 2010

Tech M visited our college on 4th feb 2010 n had a criteria of 58%(57.9999 isnt 58 guys) with one live KT allowed.
120 students were eligible for the aptitude test.
Aptitude was an online test. It had SECTIONAL CUTTOFF bt NO NEGATIVE MARKING.
There were 100 questions in 60 minutes divided in 6 sections. 100 questions seem too much in 60 min bt believe me dey are manageable.
Sectiions;

1.Nonverbal Reasoning -35 questions.
2. Logical Reasoning-15 questions
3.Quant- 20
4.English( Sentence Completion)-10
5.English( antonyms and synonms )-10 questions
6.RC- 10 questions.

For each section attempt limited no. of questions first n then cum back to remaining ones. Each section will have FEW difficult n MANY simple ones. Attempt those simple ones.

1.Nonverbal Section:
1. if 11:101::77:?
a)776 b)707 c)717 d)772 Ans.707
many such simple questions

2. alphabetical series completion.

3.Figure series completion ,analogy, odd man out.

2.Logical reasoning
1.find the odd man out EAR, TONGUE, LUNGS, KIDNEY.
2.one puzzle test question on sitting arrangement.
3. 2 blood relation question.
like if p+q implies p is father of q
p-q implies p is brother of q and so on then find which is eqn gives p is son in law of q.
advice: dnt attempt this question to save time.
3.analogy n series completion.

3.Quant.(REFER R.s. AGARWAL)
1.2-3 que on SIMPLE INTEREST n COMPUND INTEREST.
if sum of 10000 amounts to 12100 compounded annualy for 2 years. find the rate of interest.
2.Simle que on boat and stream, numbers.

4.English(Senternce Completion)
1.He ——————-that he had stolen the money.
a)acknowleged b)confessed
2.prepositions

5.antonyms and synonms
1. antonym of MALEVOLENT.
and der were simpler ones too.
6.RC.

AMAZON PAPER ON 27th NOVEMBER AT HYDERABAD

Written Test has 2 Sections A, B In Section A there were 20 Questions:

Time :30 min
Small Answer Type
Multiple choice
Aptitude

1. Two tables emp (empid,name,deptid,sal) and dept(deptid,deptname) are there.write a query which displays empname,corresponding deptname also display those employee names who donot belong to any dept.

2. Display the employees whose salary is less than average salary.

3. what is the output of the program
main()
{
int c=5;
printf(“%d\n%d\n%d”,c,c<<2,c>> 2);
}

4. main()
{
int a[8][10],c=0,i,j;
for(i=0;i<10;
i++) for(j=0;
j<8;j++) a[j][i]=c++;
printf(“%d”,a[3][6]);
}

5. What is the wrong in this program
main()
{
char *p,*q;
p=(char *)malloc(25);
q=(char*) malloc(25);
strcpy(p,”amazon” );
strcpy(q,”hyd”);
strcat(p,q);
printf(“%s”,p);
}

6. write prefix and post fix notation for (a+b)*c-(d+e)^(f-g)

7. what is the output of the program
main()
{
int i=5;
printf(“%d”,fun(fun(fun(fun( fun(i))))));
}
void fun (int i)
{ if(i%2) return (i+(7*4)-(5/2)+(2*2));
else return (i+(17/5)-(34/15)+(5/2));
}

8. When it is always true boolean fun
(node *p)
{
return ((p==null)||(p->next==null)|| (p->info<=p->next->info)&&( fun(p->next)));
}
a) when list is empty or has one node
b) when the ele are sorted in non decreasing order
c) when the ele are sorted in non increasing order

9. what is x here (x&&!(x&(x-1))==1)
a) x is always a prime
b) x is a power of 2
c) x is even d)x is odd

10 .What is the difference between deep copy and shallow copy

11. In java what is the difference between sleep() and wait() .

12. What happens when the parent process of a child process exits before the child ?

13. There are three persons A,B,C .A shots the target 6 times out of 7 shots .B shots 4 out of 5 shots .Then what is the probability of hitting the target twice when 2 persons are selected at random.

14. what is valid in cpp char *cp; const char *cpp; 1) cpp=cp; 2) cp=cpp;

15. write program to swap 2 variables without using extra memory.

16. write a shell command to find all java files present in nested directories.

17. There are 6 pairs of black socks and 6 pairs of white socks.What is the probability to pick a pair of black or white socks when 2 socks are selected randomly in darkness.

18. A string of alphanumeric is there.Find a string that starts with b and ends with 3 characters. section B (we have to write programs) time:30 min
1. There is a sorted array which is of very large size.In that all except one no. are repeated once.How to find that non repeated no.
2. There are 2 linked lists.Those 2 lists are meeting at a point.How to find that meeting point.