Motorola Placement Question Papers

Motorola Placement Question Paper

Motorola Interview.

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.

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

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

5. what is a Real Time OS.Name some.

6. Describe VRTX in few words.

7. How does the scheduler know the time how it should be scheduled

8. sockets, TLI, streams.. and much about project

9. What is deadlock? How do you avoid it?

10. What is a semaphore?

11. What exactly happens after each system call in sockets, both at the client and at the server.

12. What is the difference between widget & gadget in XWindows?

13. Tell about strtok & strstr functions.

Motorola Placement Question Paper

Hardware questions

1. Draw the state transition diagram for sequence detector for the sequence 011. if the first bit detected is zero then SCRH should be asserted when the second bit is 1 the SCRH should remain asserted when the third bit is 1 the FOUND should be asserted and the SCRH should be disasserted. No bits should be left.

2. ts=0.5 and Th=0.7 (for the this is the setup time reqd and hold time reqd)
buffer has the delay of 1nsec
what is the setup time _________ns
what is the hold time ___________ns

Image no.1,2

3. for Each gate delay time is 0.5 ns

Image no.3

a. For each gate the delay time is 0.5 ns when will the glitch occur draw the glitch waveform.

b. How the circuit should be modified to avoid glitch.

4. describe the driving inverter? What inverter is weak and which has more strength? why?

Image no.4

5. what is the output of the following circuit?

Image no.5

6. Draw the output waveform for the following ckt Vtp=Vtn=1V

Image no.6

7. obtain expression for the output (the i/ps may not be in correct order)

Image no.7

8. Determine the output waveform input is

Image no.8,9

9. a. What is the output waveform
b. What will happen when the AND gate is replaced by OR gate

Image no.10

10. using 2:1 Mux and one inverter make XOR gate

11. using 2:1 Mux make a transparent latch (D f/f)

12. Design a ckt such that f (clk_out)=2 f (CLK_in) that is frequency doubling circuit is needed

Image no.11

13. Find the outputs of the following ckts

Image no.12

a). assume Vt = threshold voltage

Image no.13,14,15

Software questions:

Totally 20 questions were asked
* Most of them from C and datastructures (in equal nos)
* few from c++

1. Numbers sequential search has to compare ______ elements on worst and _______numbers on an average

2. Which of the following algorithm is not applicable for lived list representation of numbers
1. binary search 2. Sequential search 3. Selection sort

3. program to reverse a linked list all the variables 3 left pair of statements they give, we have to write the logic part
i.e. live
typedef struct link
{
int element;
struct link *next;
}code;
struct link rev(node *p)
{
node *t;
node *r=0;
while(p!=___)
{
t=____;
p=_____;
r=______;
}
return=______

4. exactly same type of question to check whether the given string is palindrome or not

5. they gave one program and asked what it is (it is fibonacci series)

6. int i=7;
printf(“%d”,i++*i++); what is the answer

7. int i=7;
printf(“%d”,i++*i++); what is the answer
7. struct code
{ int I;
int t;
}
/* some code */
main()
{

}
what is wrong ?
semicolon is missing after structure declaration

8. Selection sort for N elements the no of comparisions needed and no of swapping

9. One question from heap sort

10. One question about breadth search

11. what is a language
* set of alphabet
* combination of alphabet
* strings of some alphabet

Motorola Placement Question Papers

Hardware questions

1. Draw the state transition diagram for sequence detector for the sequence 011. if the first bit detected is zero then SCRH should be asserted when the second bit is 1 the SCRH should remain asserted when the third bit is 1 the FOUND should be asserted and the SCRH should be disasserted. No bits should be left.

2. ts=0.5 and Th=0.7 (for the this is the setup time reqd and hold time reqd)
buffer has the delay of 1nsec
what is the setup time _________ns
what is the hold time ___________ns

Image no.1

3. for Each gate delay time is 0.5 ns

Image no.2

a. For each gate the delay time is 0.5 ns when will the glitch occur draw the glitch waveform.

b. How the circuit should be modified to avoid glitch.

4. describe the driving inverter? What inverter is weak and which has more strength? why?

Image no.3

5. what is the output of the following circuit?

Image no.4

6.Draw the output waveform for the following ckt Vtp=Vtn=1V

Image no.5

7. obtain expression for the output (the i/ps may not be in correct order)

Image no.6

8. Determine the output waveform input is

Image no.7

9. a. What is the output waveform
b. What will happen when the AND gate is replaced by OR gate

Image no.8

10. using 2:1 Mux and one inverter make XOR gate

11. using 2:1 Mux make a transparent latch (D f/f)

12. Design a ckt such that f (clk_out)=2 f (CLK_in) that is frequency doubling circuit is needed

Image no.9

13. Find the outputs of the following ckts

Image no.10

Software questions:
Totally 20 questions were asked
* Most of them from C and datastructures (in equal nos)
* few from c++

1. Numbers sequential search has to compare ______ elements on worst and _______numbers on an average

2. Which of the following algorithm is not applicable for lived list representation of numbers
1. binary search 2. Sequential search 3. Selection sort

3. program to reverse a linked list all the variables 3 left pair of statements they give, we have to write the logic part
i.e. live
typedef struct link
{
int element;
struct link *next;
}code;
struct link rev(node *p)
{
node *t;
node *r=0;
while(p!=___)
{
t=____;
p=_____;
r=______;
}
return=______

4. exactly same type of question to check whether the given string is palindrome or not

5. they gave one program and asked what it is (it is fibonacci series)

6. int i=7;
printf(“%d”,i++*i++); what is the answer

7. int i=7;
printf(“%d”,i++*i++); what is the answer
7. struct code
{ int I;
int t;
}
/* some code */
main()
{

}
what is wrong ?
semicolon is missing after structure declaration

8. Selection sort for N elements the no of comparisions needed and no of swapping

9. One question from heap sort

10. One question about breadth search

11. what is a language
* set of alphabet
* combination of alphabet
* strings of some alphabet