Placement Papers: Deshaw Placement Paper 2008
Download PDF of This Page (Size: 163K) ↧
Examrace Placement Series prepares you for the toughest placement exams to top companies.
This paper comprises of an Aptitude test and Clanguage test
Aptitude20 questions (2 marks each)
Clanguage20 questions (3 marks each)
APTITUDE TEST
20 QUESTIONS; 2 MARKS EACH
TIME20 MINUTES

ONE RECTANGULAR PLATE WITH LENGTH 8INCHES, BREADTH 11 INCHES AND 2 INCHES THICKNESS IS THERE. WHAT IS THE LENGTH OF THE CIRCULAR ROD WITH DIAMETER 8 INCHES AND EQUAL TO VOLUME OF RECTANGULAR PLATE? ANS: 3.5INCHES

WHAT IS THE NUMBER OF ZEROS AT THE END OF THE PRODUCT OF THE NUMBERS FROM 1 TO 100

in some game 139 members have participated every time one fellow will get bye what is the number of matches to choose the champion to be held? ans: 138

one fast typist type some matter in 2hr and another slow typist type the same matter in 3hr. If both do combinely in how much time they will finish. Ans: 1hr 12min

in 8 * 8 chess board what is the total number of squares refer odel ans: 204

falling height is proportional to square of the time. One object falls 64cm in 2sec than in 6sec from how much height the object will fall.

gavaskar average in first 50 innings was 50. After the 51st innings his average was 51 how many runs he made in the 51st innings

2 oranges, 3 bananas and 4 apples cost Rs. 15.3 ornages 2 bananas 1 apple costs Rs. 10. What is the cost of 3 oranges, 3 bananas and 3 apples. Ans Rs. 15.

in 80 coins one coin is counterfiet what is minimum number of weighings to find out counterfiet coin

in a company 30% are supervisors and 40% employees are male if 60% of supervisors are male. What is the probability that a randomly choosen employee is a male or female?

statement: All green are blue are blue, all blue are white conclusion:

some blue are green

some white are green

some green are not white

all white are bluehe has given four choices like gre type


all teachers are students. Some students are girls. This type of questions are there. We cant able to reproduce them.
Section B

The function strcmp (str1, str2) returns

int * x[] (); means

#define PRINT (int) printf ( “int = %d” int); main () { int x, y, z; x = 03; y = 1; z = 01; PRINT (x^{x}); z< ⇐ 3; PRINT (x); y>> = 3; PRINT (y); }

struct list { int x; struct list * next; } * head; the struct head. x = 100 above is correct/wrong

‘’ = 45 ‘/’ = 47 printfr (%d/n, ‘’ ‘’ ‘’ ‘’ ‘/’ ‘/’ ‘/’ ); o/p =?

o/p =? int i; i = 1; i = i + 2 * i + +; printf (%d, i)

{ ch = ‘A’ while (ch ⇐ ‘F’ ) { switch (ch) { case ‘A’ Case ‘B’ Case ‘C’ Case ‘D’ Ch + +; continue; case ‘E’ Case ‘F’ Ch + +; } putchar (ch); } }

ABCDEF

EFG

FG

error


FILE * fp1, * fp2; fp1 = fopen ( “one” “w” ) fp2 = fopen ( “one” “w” ) fputc ( ‘A’ fp1) fputc ( ‘B’ fp2) fclose (fp1) fclose (fp2)

int a = 1; b = 2; c = 3; * pointer; pointer = &c; a = c/* pointer; b = c; printf ( “a = %d b = %d” a, b)

a = 1 b = 3

a = 3 b = 3

3 2

error


#include char * f () { char * s = malloc (8); strcpy (s, “goodbye” ) }

main () { char * f (); printf ( “%c” * f () = ‘A’ ); } o/p =?

int sum (n) int n; if (n<1) return n; else return (n + sum (n − 1) )

when a function is recursively called all, automatic variables are

#define MAN (x, y) (x) > (y) (x)? (y) { int i = 10; j = 5; k = 0; k = MAN (i + +, + + j) printf (%d %d %d %d, i, j, k) }

a = 10; b = 5; c = 3; d = 3; if (a < b) && (c = d + + ) printf (%d %d %d %d a, b, c, d) else printf ( “%d %d %d %d a, b, c, d” )

if the following program (my prog) main (int size of, char * arg[]) { while (size of arg) printf ( “%s” arg[size of arg]) } is run from the command line as myprog jan feb mar apr what would be the o/p

myprog jan, feb, mar, apr

rev

jan, feb, mar, apr

error


what is o/p main () { int i = 3; while (i) { int i = 100 i; printf ( “%d.” i); } }

infinite loop

error

99. 99. 99. 99

3. 22. 1.


What is the o/p of the program
main () { int rows = 3, colums = 4; int a[rows][colums] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12 }}.
i = j = k = 99.
for (i = 0; i < rows; i + + )
for (j = 0; j < colums; j + + )
if (a[k][j] < k) k = a[i][j].
printf ( “%d\n” k).