Motorola Placement Papers

thereare45question.notechnicalquestionareasked.time45mins.
2reasoningquestionmeanstotal11questoins.reasoningisnotfrom
GRE.

1.antonym
p....ans.static
2.thereare1800coins.onecoiniscounterfietcoin.howmanyminimum
weightisrequiredtofindcounterfietcoin.
3.therearesixquestionofseries.
12358?ans.
102204102ans.256
questionsareveryeasy.youcansolveeasilythere.
4.word1:word2=motorola:.....ans.c
5.thistypearequestionareasked.
124
10?
34...
6.instructiontoadd3.......ans.4
7.floorproblem......ans.11thfloor

CTEST

1.main()
{
intarr[100];
intc:
intN;
for(i=-:i<N;i++)
arr[i]=i;
minvaluei=.....
Maxvaluei=.....Ans0,100resp

2.UnionProblem.....Ans:aorc
3.forn=2thefollowingfnreturningvalueis
intfun(intn)
{
for(i=1;i<=n;i++)
for(j=i;j<=i;j++)
sum=sum+j;
return(sum);
}Ans6


4.Calculatesum=1+1+2+1+2+3+1......
Ansi<=x;j<=i
5.forx=2y=3z=1
thefollowingfnreturn
intfun(intn;inty;intz)
{
intsum
for(i=x;i<=y;i++)
for(j=1;j<=z;z++)
sum=sum+z;
returnsum
}
Ans0(check)

6.Thevaluesofsumfromabovefn
forx=0;y=0;z=1Ans1
7.howcanyouinsertthefollowingvaluesinstackandnumbers
10,20,30,40,50.60
stack[][][][][][]
numb[][][][][][][]

Ans
605040302010
102030405060
check.

8.#ifndifXYZ

#include"XYZ.h"
#endif
whatismeaning?
Ans:
ifXYZisnotdefinedthenonlyincludetheheaderfileXYZ.h.

9.p:malloc(int*sizeof(int));

ans:a

10.a=5b=10c=7
(ac)?a:((bc)?b:c)ans10
11.debuggingeliminatesAns[c]
ans:bothlogical&ruintimeerrors.
12.intterm(intx)
{intsum=0;inti;
for(i=0;i<=5;i++)
sum+=x;/*probleliswrongbutAnsis650.*/
return(sum);
}Ans650
theabovefnvalueforx=150
13.intx;
scanf("%d",x);
-------------
--------------
whatiserrorintheaboveprogram

14.inta[]={1,,9,2.......}
int*p;
p=&a[2];
printf("%s",p);
a)7b)2c)4407d)none

ans:d
15.a[][]={1,2},{3,4}
b[][]={
voidfun(A,B)
inti,j;
for(i=1;i<N;i++)
for(j=1;j<N;j++)
sum=sum+A[i][j];
returnsum;
}
whatiswrongintheabovefunction?

16.OTHERQUESTIONSAREMAINLYCONCENTRATEDONERRORSLIKE
(i)syntax(ii)runtime(iii)logical(iv)debugging.

17.Abinarytreewithdepthof'3'hasmaxkof20nodesans:no.
18.breadthsearchanddepthsearchinbinarytree.
ANALYTICAL

1.20%loss;20%gainAns4%loss
2.OrderproblemAns:Bo,Ka,A,TpAnsBo
3.10%5+3*2-3ans:5
4.Calls:Tissus::Atom:?Ans:Molecules
5.cubeproblem(32bigger+4smallercubes)-R.S.Aggrawalnonverbal
-pg92:5questions
6PQRSTU-problem-VerbalReasoning-.......do.......pg430:5
question.
7problem-verbalreasoning-rsaggrawalpg207Quest17to21.


CTEST

1.malloc?2.char*p="hwlloworld",whatiswrong?
3.char*(*(*a(N))())();?
4.*p++=?
5inti=7
printf("%d\n",i++i++)o/p=?ans56
6.n=2pow((2.0,n),++n)?
7#definemacrofor(i,g)?
8.intreg=2isthereanywrong?writeareason
9.#definemax10
p=&(a+b);
q=*max;
}whatiswrong


10.strcat(string,'O');
wrong?weritereason?
11.char*s=char*....
else(string)....?wrong?writereason?