Provided by www.YuvaJobs.com - Grapecity  Placement Paper Noida 31 December 2011


 GrapeCity Company Profile, GrapeCity Latest Selection Procedure, GrapeCity Solved Question Paper, GrapeCity Free Sample Placement Papers, GrapeCity Previous Question Papers,GrapeCity Technical Questions and Answers


void foo(Item x);

which is right way to call with integer argument I?
a. foo(i);
b. foo (i);
c. foo(i);
d. foo( i);
e. foo( i);

8.
9. void quiz(int w)
{
if(w>1)
{ quiz (w/2);
quiz(w/2);
}
printf(“*”);
}
how many asterisks are printed by the function call quiz(5)?
a. 3
b. 4
c. 7
d. 8

10. void test_a (int n)
{
printf(“%d”,n);
if(n>0) 
test_a(n-2);
}
test_a(4)?

a . 0 2 4
c. 0 2
d. 2 4
e. 4 2
f. 4 2 0

11. char string[8]=”abcdefg”;
*string=’\0’;
printf(“%s”,string);
a. compiler error
b. run-time error
c. no o/p, but no error
d. creates bcdefg

12. char string[8]=”abcdefg”

o/p :
printf(“%s\n”,string +3);
a. abcdefg
b. abc
c. defg
d. cdefg

13. main()
{ int I=-3, j=2,k=0,m;
m=++I&&++j||++k;
printf(“\n%d%d%D”, I,j,k,m);

a. –2 3 0 1
b. –2 3 1 1 
c. –2 3 1 0
d. –2 3 0 0

14. main()
{
int I;
for(;;)
{
printf(“%d”,I++)
if(I>10)
break;
}
}
a. condition in a for-loop is mudt
b. no error
c. 2 ; shud be dropped

15.void goop ( int z[]);//prototype
int x[10];
which ois the correct way to call goop
a. goop(x);
b. goop(x[]);
c. goop(x[10]);
d. goop(&x);
e. goop(&x[]);

16. int a=3,b=17;
a=b%a;
b=++a+5;
printf(“a,b);

a. 2 8
b. 2 7
c. 3 7
d. 2 8
e. none

18. how many time shello will be printed?
FILE *fp=fopen(“test.txt”,w)
Fprintf(fp,”hello”);
Fork();

a. 1
b. 2
c. 0
d. none

19. int a;
int b=0;
while(a)
{
{ a&=a-1;
b++;
}
a &b
a. 0 & 15
b. 1 & 16
c. 0 & 16
d. none





20. class A
{
public:
static int a;
A() {a=10};
};
int main()
{
A b;
Printf(“%d”,b.a);
Return 0;
}
will the program compile?
a yes
b. no



NUMERICAL ABILITY

1. A salesman marks an item 60% above the cost price & offers 2 successive discounts of 25% & 15% on the marked price. His profit is:
a. 15% b 2% c 7.5% d. 10 e. none

2.Had it been sold at 55% loss, SP would have been Rs. 10.80. The C.P is;
a. Rs 26 b. 28 c. 36 d.24 e. none
3. If 18 men can build a wall 140 mtrs. In 42 days . In how many days can 15 men be able to construct a similar wall 100 mtrs . long??
a. 36 b. 60 c. 60 d. 33 e. none
4. Successive discounts of 15% & 20% on any goods amount to a total discount of :
a. 50 % b. 35% c, 34% d.32 % e.none
5. In a km race A beats B by 40 m or 7 secs. A’s time (in secs) over the cource is:
a.180
d. 280
e. 168
f. 175
g. none

7. A widow & a son are to receive Rs 20000 and Rs 10,000 respectively frm inheritance of Rs. 70,000. The rest is 2 be divide so that the widow recives 3/2 times as much of it as the son. Then the amnt received by (widow,son) pei9r in thousands of rs. Is:
a. (44,26)
b. 42,28
c. 40,30
d. 45,30
e. none

8.the demand for a commodity linearly decreases by 0.5 unit for each unit increase in price & it vanishes when the price is set at 60 . The supply of the commodity vanishes when the price is set at 25 & equals the square root of the price in excess of this threshold price. Then the equilibrium at which the supply coincides with the demand is:
a. 45
b. 50
c. 55
d. 62+/-3 under-root86
e. none

9. gre type column questions:
area of triangle pqs is 45:
PQ=12 P 

QR=20

Col. A : length of segment PS
COL. B: Length of SR

a. if A is greater
b. if B is greater
c. if both equal
d. d. can’t determined

10.Col. A: (0.82)^2(0.82)^3
Col. B: (0.82)^6

11. t is a positive integer
4/7 = t/s

Col. A: s
Col. B: 7

12. Col. A 1-1/27
Col. B: 8/9+1/81

13…. 14. these types simple (-0.64)^4 & (-0.6)^3

15…16

M/c A produces x units of output per hour, while m/c B produces x units of output every 1.5 hrs.

17. How many hrs. does it take 2 produce x units of o/p , with both m/cs A &B working together??
a. (4x +!)/4x
b. 5/4
c. 3/(5x)
d. 3/5

18. 4 more m/cs are installed with their capacities lying betn those of m/cs A & B . Wchi of the following ca’t be the average no. opf hrs. per m/c for producing x units of output?
a. 1.05
b. 1.15
c. 1.25
d. 1.35

Problem Solving (19-21)

19. if 0