Motorola Placement Paper

Company: Motorola


there are 45 question . no technical question are asked.time 45 mins.
2 reasoning question means total 11 questoins.reasoning is not from GRE.

1. antonym
p…. ans. static
2.there are 1800 coin is counterfiet many minimum
weight is required to find counterfiet coin.
3. there are six question of series.
1 2 3 5 8 ? ans.
102 204 102 ans. 256
questions are very easy .you can solve easily there.
4. word1 : word2 = motorola : ….. ans . c
5 . this type are question are asked.
1 2 4
10 ?
3 4 …
6. instruction to add 3 ……. ans. 4
7.floor problem …… ans. 11th floor

Motorola Interview.

There was a Technical Interview,followed by personal interview.
Mainly concetrating on the interesting subjects.

write a C code reverse a string using a recursive function, without
swapping or using an extra memory.
2.To reverse a linked list as above.

given a macro like
#define MAX(A,B) {to return that is larger}
what will MAX(i++,j),MAX(i,j++) return.

Difference between Macro and ordinary definition.
Difference between Class and Struct.

Testing and Maintenance.(will you work in it and what are they)

Give the outputs of a compiler and assembler and loader
and linker etc.
If a new data structure, suppose a queue is to be added
like int, long

where shall the changes be — lex or yacc or where.

what is a Real Time OS.
Name some.
Describe VRTX in few words.
How does the scheduler know the time how it should be scheduled.

sockets, TLI, streams.

and much about project.

What is deadlock? How do you avoid it?
What is a semaphore?
What exactly happens after each system
call in sockets,
both at the
client and at the server.
What is the difference between widget & gadget in XWindows?
Tell about strtok & strstr functions.

7.Interchanging strings and numbers Ans C
8. Matricide:Mother:: Homicide:? Ans Human
9.Some Mammels are Vertebrates
Some Vertebrates are……. Ans d
10. Figure patteren: –|–…….etc. direction changes problem.
11. work problem………etc. (not clear).


1. main()
int arr[100];
int c:
int N;
for(i=-:i<n;i++) arr=”i;” minvalue=”” i=”…..” maxvalue=”” ans=”” 0,100=”” resp=”” 2.=”” union=”” problem=”” …..=”” :=”” a=”” or=”” c=”” 3.=”” for=”” n=”2″ the=”” following=”” fn=”” returning=”” value=”” is=”” int=”” fun(int=”” n)=”” {=”” for(i=”1;i<=n;i++)” for(j=”i;j<=i;j++)” sum=”sum+j;” return(sum);=”” }=”” 6=”” 4.=”” calculate=”” i<=”x;j<=i” 5.=”” x=”2″ y=”3″ z=”1″ return=”” n;=”” y;=”” z)=”” 0(check)=”” 6.=”” values=”” of=”” from=”” above=”” 1=”””” can=”” you=”” insert=”” in=”” stack=”” and=”” numbers=”” 10,20,30,40,50.60=”” [][][][][][]=”” numb=”” [][][][][][][]=”” 60=”” 50=”” 40=”” 30=”” 20=”” 10=”” check.=”” 8.=”” #=”” if=”” ndif=”” xyz=”” #include=”” “xyz.h”=”” #endif=”” what=”” meaning=”” ?=”” ans:=”” not=”” defined=”” then=”” only=”” include=”” header=”” file=”” xyz.h.=”” 9.=”” p:malloc(int*sizeof(int));=”” 10.a=”5″ b=”10″ c=”7″ (a=”” c)?a:((b=”” c)?b:c)=”” 10=”” 11.=”” debugging=”” eliminates=”” ans[c]=”” both=”” logical=”” &=”” ruin=”” time=”” errors.=”” 12.=”” term=”” (int=”” x)=”” i;=”” sum+=”x;” *problel=”” wrong=”” but=”” 650.*=”” =”” 650=”””” x;=”” scanf(”%d”,x);=”” ————-=”” ————–=”” error=”” program=”””” a[]=”{” 1,=”” ,=”” 9,2…….}=”” *p;=”” p=”&a[2];” printf(”%s”,p);=”” a)7=”” b)2=”” c)4407=”” d)none=”” d=”” 15.a[][]=”{1,2},{3,4}” b[]=”” []=”{” void=”” fun(a,b)=”” i,j;=”” sum;=”” function?=”” 16.=”” other=”” questions=”” are=”” mainly=”” concentrated=”” on=”” errors=”” like=”” (i)syntax=”” (ii)=”” runtime=”” (iii)=”” (iv)=”” debugging.=”” 17.=”” binary=”” tree=”” with=”” depth=”” ‘3′=”” has=”” max=”” kof=”” nodes=”” no.=”” 18.=”” breadth=”” search=”” tree.=”” analytical=”” 1.20%loss;20=”” %=”” gain=”” 4%=”” loss=”” 2.order=”” bo,ka,a,tp=”” bo=”” 3.10%5+3*2-3=”” ans:5=”” 4.calls:tissus::atom:?=”” ans:molecules=”” 5.cube=”” problem(=”” 32=”” bigger+4=”” smaller=”” cubes)-=”” r.s.aggrawal=”” nonverbal=”” -=”” pg=”” 92:=”” 5=”” questions=”” 6=”” pqrstu-=”” problem-=”” verbal=”” reasoning=”” …….do…….pg=”” 430=”” 5=”” question.=”” 7=”” rs=”” aggrawal=”” 207=”” quest=”” 17=”” to=”” 21.=”” test=”” 1.=”” malloc=”” ?=”” char=”” *=”” hwllo=”” world=”” ”=”” wrong?=”” *(*(*a(n))())();?=”” 4.*p++=”?” printf(=”” “%d=”” n”,i++=”” i++)=”” o=”” 56=”” 6.n=”2″ pow((2.0,n),++n)?=”” #define=”” macro=”” (=”” i,g)=”” reg=”2″ there=”” any=”” write=”” reason=”” q=”*max;” wrong=”” 10.=”” strcat(=”” string,’o’);=”” wrong?=”” werite=”” reason?=”” 11.char=”” *s=”char” ….=”” else=”” (string)….?=”” reason?=”” psg=”” paper:=”” arithmetics=”” venn=”” diagram=”” white,=”” clothes,flowers=”” 2.male=”” members=”” abcdef,=”” female=”” pqrstu=”” this=”” same=”” as=”” [5questions]=”” clear.=”” ims=”” material=”” sales=”” person=”” problem.=”” [5=”” question]=”” conditions:=”” m=”” must=”” visit=”” before=”” p&q=”” r=”” “=”” mnopqrs=”” containor=”” contains=”” lt=”” milk,=”” 8=”” water=”” ans:(=”” 0.80)^3=”” direction=”” (playing=”” cards)=”” ams=”” south-west.=”” antonym=”” p….=”” ans.=”” static=”” six=”” question=”” series.=”” 2=”” 3=”” 102=”” 204=”” 256=”” very=”” easy=”” .you=”” solve=”” easily=”” there.=”” word1=”” word2=”motorola” .=”” type=”” asked.=”” 4=”” …=”” instruction=”” add=”” …….=”” 7.floor=”” ……=”” 11th=”” floor=”” <=””></n;i++)>

Motorola Placement Paper

Read More