Provided by www.YuvaJobs.com - Motorola   Paper    Technical - C & C++


MOTOROLA PSGTECH 2003There 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.
bubble sorting is a)two stage sorting&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; b).....c).... d)none of the above
.c++ supports a) pass by value onlyb) pass by namec) pass by pointer d) pass by value and by reference
.Selection sort for a sequence of N elementsno of comparisons = _________no of exchanges = ____________
Insertion sort no of comparisons = _________no of exchanges = ____________
what is a language?a) set of alphabetsb)set of strings formed from alphabetsc)............d)none of the above
Which is true abt heap sorta)two method sortb)has complexity of O(N2)c)complexity of O(N3)d)..........
In binary tree which of the following is true&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; a)binary tree with even nodes is balancedb)every binary tree has a balance treec)every binary tree cant be balancedd)binary tree with odd no of nodes can always be balanced
Which of the following is not conducive for linked list implementation of arraya)binary searchb)sequential searchc)selection sortd)bubble sort
In c++ ,casting in C is upgraded as a)dynamic_castb)static_castc)const_castd)reintrepret_cast
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 relationsb)it is an directed graph "" "" """ "" "" "" "" "" "c)........d).......
Question on worst and best case of sequential search&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
question on breadth first search
char *p="abcdefghijklmno"then printf("%s",5[p]);
&nbsp;what is the error struct { int item; int x;} main(){ int y=4; return y;}error:absence of semicolon
Which of the following is false regarding protected membersa)can be accessed by friend functions of the childb) can be accessed by friends of child,s childc)usually unacccessible by friends of classd) child has the ability to convert child ptr to base ptr
What is the output of the following void main(){ int a=5,b=10;int &amp;ref1=a,&amp;ref2=b;ref1=ref2;++ ref1;++ ref2;cout&lt;&lt;a&lt;&lt;b&lt;&lt;endl;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; } value of a and ba)5 and 12b)7 and 10c)11 and 11d)none of the above
What does this returnf(int n){return n&lt;1?0:n==1?1:f(n-1)+f(n-2)}hint:this is to generate fibonacci seriescode 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
for eg; for palindromepalindrome(char * inputstring){ int len=strlen ( ?);int start= ?;end =inputstring + ?-?;for(; ?&lt;end &amp;&amp; ?==?;++ ?,--?);return(?==?); }we have to replace the question marks(?) with corresponding variables
.linked list reversal Linked (Link *h){Link *temp,*r=0,*y=h;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; while(y!= ?) (ans:Null){temp = ?;(ans:y-&gt;next)some code here with similar fill in type}
fill in the blanks type question involving recursive factorial computation
&nbsp;
Provided by www.YuvaJobs.com - Motorola   Paper    Technical - C & C++