MOTOROLA PLACEMENT PAPER (TECHNICAL)

Started by vedha.v, Dec 27, 2012, 10:39 PM

previous topic - next topic
Go Down

vedha.v

MOTOROLA PLACEMENT PAPER (TECHNICAL)

There were basically 3 papers -software ,DSP, Semiconductor software paper (20 questions 45 minutes) concentrate more on data structures 10 questions from data structures and 10 from C++ and data structures10 questions were in the fill in the blank format and 10 questions were multiple choice questions.

1. bubble sorting is

a) two stage sorting
b).....
c)....
d) none of the above

2. c++ supports

a) pass by value only
b) pass by name
c) pass by pointer
d) pass by value and by reference

3. Selection sort for a sequence of N elements
no of comparisons = _________
no of exchanges = ____________

4. Insertion sort
no of comparisons = _________
no of exchanges = ____________

5. what is a language?

a) set of alphabets
b)set of strings formed from alphabets
c)............
d)none of the above

6. Which is true abt heap sort
a)two method sort
b)has complexity of O(N2)
c)complexity of O(N3)
d)..........

7. In binary tree which of the following is true

a) binary tree with even nodes is balanced
b) every binary tree has a balance tree
c) every binary tree cant be balanced
d) binary tree with odd no of nodes can always be balanced

8. Which of the following is not conducive for linked list implementation of array

a) binary search
b) sequential search
c) selection sort
d) bubble sort

9. In c++ ,casting in C is upgraded as

a)dynamic_cast
b)static_cast
c)const_cast
d)reintrepret_cast

10. Which of the following is true abt AOV(Active On Vertex trees)

a)it is an undirected graph with vertex representing activities and edges representing precedence relations
b)it is an directed graph "" "" """ "" "" "" "" "" "
c)........
d)......

.11. Question on worst and best case of sequential search

12. question on breadth first search

13. char *p="abcdefghijklmno"
         then printf("%s",5[p]);

14. what is the error

struct { int item; int x;}
main(){ int y=4; return y;}
error:absence of semicolon

15. Which of the following is false regarding protected members

a)can be accessed by friend functions of the child
b) can be accessed by friends of child's child
c)usually unacccessible by friends of class
d) child has the ability to convert child ptr to base ptr

16. What is the output of the following

void main()
{
int a=5,b=10;
int &ref1=a,&ref2=b;
ref1=ref2;
++ ref1;
++ ref2;
cout<<a<<b<<endl;
} value of a and b
a)5 and 12
b)7 and 10
c)11 and 11
d)none of the above

17. What does this return

f(int n)
{
return n<1?0:n==1?1:f(n-1)+f(n-2)
}
hint:this is to generate fibonacci series
code for finding out whether a string is a palindrome,reversal of linked list, recursive computation of factorial with
blanks in the case of some variables.we have to fill it out

18. for eg; for palindrome

palindrome(char * inputstring)
{
int len=strlen ( ?);
int start= ?;
end =inputstring + ?-?;
for(; ?<end && ?==?;++ ?,--?);
return(?==?); }
we have to replace the question marks(?) with corresponding variables

19. .linked list reversal

Linked (Link *h)
{
Link *temp,*r=0,*y=h;
while(y!= ?) (ans:Null)
{
temp = ?;(ans:y->next)
some code here with similar fill in type
}

20. fill in the blanks type question involving recursive factorial computation

Go Up
 

Quick Reply

With Quick-Reply you can write a post when viewing a topic without loading a new page. You can still use bulletin board code and smileys as you would in a normal post.

Warning: this topic has not been posted in for at least 120 days.
Unless you're sure you want to reply, please consider starting a new topic.

Note: this post will not display until it's been approved by a moderator.
Name:
Email:
Verification:
Please leave this box empty:

Type the letters shown in the picture
Listen to the letters / Request another image

Type the letters shown in the picture:

shortcuts: alt+s submit/post or alt+p preview
IT Acumens Web Designing Chennai | GinGly :: Build your Personal Website | CineBuzz :: Cinema News | My Kids Diary :: Kids Memories Writing :: Book Website @ 349 Rs monthly
Copyright 2005 - 2020 :: IT Acumens :: All Rights Reserved. :: Sitemap
ITAcumens Discussion Forum with 2 lakhs post running for 15 years - Powered by IT Acumens Dedicated Server