Thread: My Strand Life Sciences Exam

Hi all,
Strand Life Sciences came to IIIT for placements. Their question paper was quite easy with four sections. The first section had the program outputs like I just remember two of them:
1) int f(int a){
int b = 0;
int i;
for(i = 1;i <= a;i++)
b = b + i;
return b;
}

int main(){
printf("\n%d\n",f(200));
getch();
return 0;
}

2) int f(int a,int b){
if(a == 1)
return b;
else
{
printf("%d %d\t",a,b);
return b + f(a-1,b);
}
}

int main(){
printf("\n%d\n",f(1234,5));
getch();
return 0;
}

In the second section they asked short answers where they asked what a stack was and when it is to be used, what is the complexity of qsort, what is the disadvantage of recursion, what is super used for.

The third section was sort of aptitude where one of the interesting question was if we can for four equilateral triangles from six match sticks each of same length and the side of the triangle being the length of the match stick.

The fourth section had data sufficiency problems. and this section had the most number of questions, I think they were almost 10 of them.

On the whole it was quite a simple test...THough the pre placement talk was not that peppy in the sense they didn't give a proper intro to the company but as far as i saw it the company is good for anyone really interested in data structures and algorithms as they said they would give chance to work on them at our will...

siriatwork Thanks for your post on the questions and giving idea about how the test and talk was. Is it that they have opening in C programming. Also how many hours test was it. If you could share it it would be even more useful for all.

Hello,
The test was exactly for one hour only. I am not sure if they have vaccancies but they come to IIIT every year...And BTW it pays good too...whereas outside IIIT it doesn't...Will keep you posted if any vaccancies...

he! can anybody tell me what kind of questions strand life sciences ask these days in written exam and interview(more importantly)?
pls help me out
thanx in advance