Provided by www.YuvaJobs.com - Ikanos    Paper    Whole Testpaper        - 21  November  2004  


Ikanos - Sample Questions 2004 NOV 21
There were three sections: 
1. Software 
2. Hardware 
3. Analytical 
&nbsp; Only one MCQ question; all others to be solved analytically.&nbsp; 
1.) Each of the letters below represents a non-zero and unique digit. &nbsp;&nbsp;&nbsp; Find the digit. 
&nbsp;&nbsp;&nbsp;&nbsp; one&nbsp; &nbsp;&nbsp;&nbsp;&nbsp; one&nbsp; &nbsp;&nbsp;&nbsp;&nbsp; one&nbsp; &nbsp;&nbsp;&nbsp; +one&nbsp; &nbsp;&nbsp;&nbsp; -----&nbsp; &nbsp;&nbsp;&nbsp;&nbsp; ten&nbsp; Find the digits.&nbsp; Ans( one = 182 , ten=728). 
2. Calculate the maximum permissible propagation delay of each FF in a modulo 1023 counter. 
3. Find the error if any -&nbsp; { 
struct *sPtr, *nPtr 
for(;*nPtr;nPtr=nPtr-&gt;next) 
&nbsp;&nbsp;&nbsp; free(nPtr); 
} 
4. Find the output -&nbsp; &nbsp; main()&nbsp; { void f(int, int); 
&nbsp;&nbsp; int i, j; 
&nbsp;&nbsp; i=10; 
&nbsp;&nbsp; j=10; 
&nbsp;&nbsp; f(++i,j++); 
} 
void f(int i, int j) 
{if(i&gt;50)return; 
&nbsp; else 
&nbsp;&nbsp; i+=j; 
&nbsp; f(i,j); 
&nbsp; printf("%d",i); 
&nbsp; }&nbsp;&nbsp; 
Ans 413121 
5. Implement the following using 4X1 MUX. 
&nbsp;&nbsp; A,BC + AB,C +ABC,&nbsp;&nbsp;&nbsp;&nbsp; 
6. How will you convert an S-R FF into J-K FF ? 
&nbsp;
Provided by www.YuvaJobs.com - Ikanos    Paper    Whole Testpaper        - 21  November  2004