SAP Placement Paper Whole Testpaper Chennai-15 Oct 2006

Posted by FreshersWorld

7 Jan, 2012

SAP labs on 15^{th} oct,2006 in chennai.

The paper was set by merittrac. There were 2 sections.

1^{st} section had general aptitude questions and the 2^{nd} section had ques based on C and data structures.

Section 1:

30 ques :30 mins(time was not sufficient)

I remember only a few questions.

Sheela getssalary, along with an increment given at the end of each year.After 4 years from her date of joining she gets Rs.15,000 and after 10 years she gets Rs.18000.wat is her salary when she joined?

There were few elephants and an equal number of mahouts.Half of the mahouts were sitting on the elephants and half were walking.Totally there was 84 legs,hw many elephants were there?

some data sufficiency ques

one question based on venn diagram

Usual merittrac pattern,some 7 ques like, if * stands +,- stands for /,+ stands for * and / stands for ?,then 24+7-6*8/2=?

Section 2:

1).main()

{

inti =0;

printf(?In the name of lord?);

for(i =0;i<5;i++)

main();

}

2)struct one

{

int j;

char m;

union two

{

int a;

char b;

float c;

struct three

{

int x;

float y;

char z;

};};};

wat is the size of union?

3).fun( int a,int b)

{

/*some code*/

}

fun (a.b)

int a,b;

{

/*some code*/

}

a)Both functions are in ANSI notation

b)1^{st} one in ANSI & 2^{nd} in K& R notation(Ans)

c)1^{st} in K&R,2nd in ANSI

d)Both in K&R

4).An array of numbers were given and sorted using insertion and selection sort, options will b given, correct one has to be chosen

5)Programs based on Binary search tree,binary tree were given

Results wil b out by next week.

Regards,

Mayura.

Ad Blocker Detected

We have noticed that you have an ad blocker enabled which restricts ads served on the site.
Please disable it to continue using Downloadmela.

SAP labs on 15

^{th}oct,2006 in chennai.1

^{st}section had general aptitude questions and the 2^{nd}section had ques based on C and data structures.Section 1:

30 ques :30 mins(time was not sufficient)

I remember only a few questions.

Section 2:

1).main(){

int i =0;

printf(?In the name of lord?);

for(i =0;i<5;i++)

main();

}

2)struct one

{

int j;

char m;

union two

{

int a;

char b;

float c;

struct three

{

int x;

float y;

char z;

};};};

wat is the size of union?

3).fun( int a,int b)

{

/*some code*/

}

fun (a.b)

int a,b;

{

/*some code*/

}

a)Both functions are in ANSI notation

b)1

^{st}one in ANSI & 2^{nd}in K& R notation(Ans)c)1

^{st}in K&R,2nd in ANSId)Both in K&R

4).An array of numbers were given and sorted using insertion and selection sort, options will b given, correct one has to be chosen

5)Programs based on Binary search tree,binary tree were given