Answer / guest

Motorola Placement Papers | Motorola Interview Procedure |
Motorola Aptitude Questions | Motorola TechniMotorolal
Questions | Motorola Interview Questions



Motorola Interview.
==========================
>>
>>There was a Technical Interview,followed by personal
interview.
>>Mainly concetrating on the interesting subjects.
>>
>>
>>write a C code
>>1.to 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
>>etc.,
>>
>>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.
>>
>>


Motorola Placement Papers | Motorola Interview Procedure |
Motorola Aptitude Questions | Motorola TechniMotorolal
Questions | Motorola Interview Questions



>>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.




Motorola Placement Papers | Motorola Interview Procedure |
Motorola Aptitude Questions | Motorola TechniMotorolal
Questions | Motorola Interview Questions


>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).

>C TEST
>
>1. main()
>{
>int arr[100];
>int c:
>int N;
>for(i=-:i<N;i++)
> arr[i]=i;
> minvalue i = .....
> Maxvalue i = ..... Ans 0,100 resp
>
>2. Union Problem ..... Ans : 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);
>} Ans 6
>
>
>4. Calculate sum=1+1+2+1+2+3+1......
> Ans i<=x;j<=i
>5. for x=2 y=3 z=1
>the following fn return
>int fun(int n; int y; int z)
>{
>int sum
>for(i=x;i<=y;i++)
>for(j=1;j<=z;z++)
>sum=sum+z;
>return sum
>}
> Ans 0(check)
>
>6. The values of sum from above fn
>for x=0; y=0;z=1 Ans 1
>7.how can you insert the following values in stack and
numbers
10,20,30,40,50.60
>stack [][][][][][]
>numb [][][][][][][]
>
>Ans
>60 50 40 30 20 10
>10 20 30 40 50 60
>check.
>
>8. # if ndif XYZ
>
>#include "XYZ.h"
>#endif
>what is meaning ?
>Ans:
>if XYZ is not defined then only include the header file
XYZ.h.
>
>9. p:malloc(int*sizeof(int));
>
>ans: a
>
>10.a=5 b=10 c=7
>(a>c)?a:((b>c)?b:c) ans 10
> 11. debugging eliminates Ans[c]
> ans: both logical & ruin time errors.
> 12. int term (int x)
> { int sum=0;int i;
> for(i=0;i<=5;i++)
> sum+=x; /*problel is wrong but Ans is
650.*/
> return(sum);
> } Ans 650
> the above fn value for x=150
> 13.int x;
> scanf("%d",x);
> -------------
> --------------
> what is error in the above program
>
>14.int a[] = { 1, , 9,2.......}
>int *p;
>p=&a[2];
>printf("%s",p);
>a)7 b)2 c)4407 d)none
>
>ans: d
>15.a[][] = {1,2},{3,4}
>b[] [] ={
>void fun(A,B)
>int i,j;
>for(i=1;i<N;i++)
>for(j=1;j<N;j++)
>sum=sum+A[i][j];
>return sum;
>}
>what is wrong in the above function?
>
>16. OTHER QUESTIONS ARE MAINLY CONCENTRATED ON ERRORS LIKE
>(i)syntax (ii) runtime (iii) logical (iv) debugging.
>
>17. A binary tree with depth of '3' has max kof 20 nodes
ans: no.
>18. breadth search and depth search in binary tree.
> ANALYTICAL
>
>1.20%loss;20 % gain Ans 4% loss
>2.Order problem Ans : Bo,Ka,A,Tp Ans 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 problem -> verbal reasoning -> rs aggrawal pg 207 Quest
17 to 21.
>
>
> C TEST
>
>1. malloc ? 2. char * p =" hwllo world " , what is
wrong?
>3. char *(*(*a(N))())();?
>4.*p++ = ?
>5 int i=7
>printf( "%d \n",i++ i++) o/p =? ans 56
>6.n=2 pow((2.0,n),++n)?
>7 #define macro for ( i,g) ?
>8. int reg=2 is there any wrong ? write a reason
>9. #define max 10
> p=&(a+b);
> q=*max;
> } what is wrong
>
>
> 10. strcat( string,'O');
> wrong? werite reason?
>11.char *s=char * ....
> else (string)....? wrong? write reason?
>
> PSG PAPER: ARITHMETICS
>
>1. Venn diagram for white, clothes,flowers
>2.Male members ABCDEF, female members PQRSTU
> This problem is same as in rs aggrawal [5questions]
>3. not clear.
>
>4. IMS material A sales person problem.
>[5 question] conditions: M must visit before P&Q
> R " " " MNOPQRS
>5. A containor contains 40 lt milk, 8 lt water
>
>ans:( 0.80)^3 * 40 = 20.41lts.
> 6. direction problem (playing cards) Ams south-
west.


1. antonym
p.... ans. static


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
8.




Motorola Placement Papers | Motorola Interview Procedure |
Motorola Aptitude Questions | Motorola TechniMotorolal
Questions | Motorola Interview Questions

SNAPDEAL QUESTIONS 1. A train is going at a speed of 60kmph towards Delhi and returned back at a speed of 30kmph. What is its average speed? ANS : (2*30*60)/(30+60) = 40kmph 2. How many different 4 letter words can be framed that have at least one vowel? ANS : 264 - 214 (total no of 4 digits words – no of words with no vowels) 3. Write an algorithm to find out a number from an array of numbers where only one number occurs once and rest all occurs twice. ANS : XOR all the numbers ,you will get the number with single occurrences . 4. Which among the following have the product of the distance between opposite sides of a regular polygon and it side equals one fourth of the area. A. hexagon B. octagon C. n=16 D. n=18 ANS : n=16.(area of regular polygon = apothem*perimeter/2 Apothem = distance between opposite sides/2 Area = (opp_side_dist * n * a )/4 Product of opp_side_dist and side of reg. polygon = opp_side_dist * a For n= 16 the ration becomes 1:4 5. Which of the following cannot be a relation between two variables? ANS = 4th diagram. 6.what will be the output of this program Void print (int n) { If (n>0) { printf(“hello”); print(n-1); } printf(“world”); } ANS : N times hello followed by N+1 times world. 7. Which among the following cannot be used for future prediction? ANS : 4th Diagram. 8. There are 25 horses. We have to find out the fastest 3 horses In one race maximum 5 horses can run. How many such races are required in minimum to get the result. ANS : 7 races (A. first run all horses = 5 races, eliminate 4th 5th of all races. B. Run horses who came 1st in those 5 races = 1 race , the horse coming first is the fastest Run horses a. 2nd and 3rd with the fastest horse (in first time race A) b. 2nd and 3rd coming horse in B. c. The horse who came 2nd with the horse(who came 2nd in race B) in race A You will have the fastest 3 horses.) 9. In a game of rolling dice you are given 2 dice and you have to roll them. Whatever is the outcome the player will win that many dollars. What should the game owner charge each player (optimum) so that he doesn’t have to bear any loss? ANS : $7 10. We have a function REV(“string”,m,n).This function is capable of reversing the caharacters in the string from mth location to nth location. e.g. REV(“abcd”,2,3) &#61672; the output will be acbd We need to swap a string from a position,e.g. SWAP(“abcdefg”,4) &#61672; output needs to be efgabcd. How can the REV function used do this. ANS : L = string length,N= position given in SWAP function. SWAP(“abcdefg”,4) = REV(REV(REV(“abcdefg”,N+1,L),1,N),1,L).

1 Answers   SnapDeal,

---

C interview Programs for TCS

2 Answers   TCS,

---

Tcs Freshers Interview On 27 jan 2007 In Hyderabad.

1 Answers   TCS,

---

CTS placement papers -------- placement paper 6

2 Answers   CTS,

---

mechanical engineering

1 Answers   Bhel, PDF,

---

PHILIPS PLACEMENT PAPERS ________ Placement Paper 2

1 Answers   Philips, Samsung,

---

29 Mar 2007 Interview and written test with Infosys

8 Answers   Infosys,

---

Syntel Campus Interview In Bangalore HKBKCE (April 7 2007)

22 Answers   HCL, Syntel, TCS, Torry Harris,

---

7th of october TCS placement paper

4 Answers   CINT, TCS,

---

jr. software engineer

1 Answers   Consagous,

---

MBT Interview And Selection Procedure For Freshers

1 Answers   MBT, Unisys,

---

TCS

3 Answers   TCS,

---