(Paper) Adobe Fresher Placement Paper : 23 July 2010

Adobe Fresher Placement Paper : 23rd July 2010

Company Name : ADOBE
Type : Fresher, Job Interview
Exam Date: 23rd July 2010
No of Rounds : Screening Test, Aptitude Test, Technical Round-1, Technical Round-2

Paper Pattern:

Quant was easy but speed matters... cut off went very high
Among the engineerin paper
Total of 20 questions were there...

1: given some values draw a binary search tree from them.. take them in order given

2: a hash function was given .. and few keys we had to tell which two keys map to the same location

3: find the lowest common ancestor of a bst

4: what is a doubly linked list ?? write a program to reverse a doubly linked list.

5: given a string which contains a number in binary format.. write a program to convert that number inplace to its 2's complement.

6:file 1:
int arr[10];

file 2:
extern int *arr;

what can be the problems and in whta conditions

7: a 3-d matrix was given in format a[3][2][4]={1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24} find **(*a+1)

8: a assembly code was given ... it was too ajeeb sa ..i cud not get that

9: which is the best data structure to check correct paranthesization of an expression ?? give reasons ?

10: in one line tell the maximum of 3 nos using tertiary operator(?:)

11: tell diff a) void (*P)(void *a[],int n);
b) void *(*p[])(void *a,int n);
12.. a question was there in which #defeine sum(a,b) (a*b)
#define mult(a,b) (a)+(b)

was given .. then a complex expression to solve

REST I DONT REMEMBER.. in all paper was very easy