Adobe papers

Adobe test in B'lore-2007


It has 4 sections(2 1/2 hrs)
1. Analytical Aptitude: 15 mins 15 Qs
2. Quantitative Aptitude: 30 mins 30 Qs
3. Engineering Test :13 Qs, 1 hr
4. C/Java Test 15-20 Qs, 45 mins

The first 2 are ultra-cool, no probs at all.
The fun starts with the third one:
Those thirteen questions are completely based on your problem solving capacity:
There are questions based on data-structures like
-height of a tree,
-finding second largest number in an array
-questions using finite automata
- write a pgm to find whether a m/c is little endian or big endian
- lots on bit-wise manipulation
i could answer 8 out of 13 qs very well.
The 4th test on C/Java(i took C): is almost the same as the third one with questions like
- print a number in hexadecimal format without using sprintf
- optimise the computations in the recursive "nth fibonacci number" algo without using iteration(fairly simple)
"Instead of using return(fib(n-2)+fib(n-1)), use init lofib=0,hifib=1, start with n=2,lofib=hifib;hifib=fib;fib=lofib+hifib"
-given any number say 12, find the next multiple of 8 eg 16 using bit-wise manipulations.
-exchange the integers in a matrix across the secondary diagonal(or non-major diagonal)
i tried hard but couldn't get a common formula for all cases.
and many more. No data structures book can directly help.
one should have very good capacity to solve problems in a very efficient manners.
One drawback about the test is that it is very lengthy.
They could have kept some qs for the interview. Nobody can attempt 28 programs in 1 hr 45 mins

SAMPLE 2

1. analytical part : 15 qs in 15 min..most are like if this is written as 13234243 what will be that written as ....and qs like a doctor can go to 4 clinics on each day..and various conditions given..then 2-3 questions..........based on it

2. quant part : 30 questions in 30 min..easy ones ..some conditions...qs based on it......like which of these 2 quantities is greater..........given some conditions.......

3. testing part if u giving for QE........

10-15 obj qs on testing avg........

Subjective

some scenario write test cases

shud developers test ? write 3 in favor reasons and 2 against

what is severity and priority of bugs? give examples.....


May 13, 2006 18:15:56 #7
prashant nakil Member Since: Visitor Total Comments: N/A
RE: Adobe Interview Procedure, Pattern and Model Quest...


hey there ppl,
well i appeared for the Adobe test today in my campus today ie. 12-05-06, n it was the same as mentioned above.
the Quanti was very easy..but requires fast solving ability, involves basic Geometry, algebra and Percentages n ratios etc.
the analytical problems were not that difficult too.
there were about (15 + 30) objective questions..then came the subjective…

some questions like…
1) diff bet char a[]=”123″;
char *a = “123″;
2) whats the problem with the function

int function(int x)
{
return(x*function (x-1));
}
3) some basic c syntax

then the Programs.

some C programs worth mentioning would be:

1) finding height of a binary tree
2) Displayin the fibonacci series (with recursion)
3) Flippin the 20th bit of a number
4) Flippin all the Odd bits of a number
5) ATOI() function
6) prdict the output of the following program :
***** some program (mainly recursion)
7)program to find if mc is little endian or big endian.
8)program to generate the mirror of the binary tree
program to swap two linked list nodes.
9) calculate the complexity of
*****some code****

SAMPLE PAPER 2

I attended Adobe test on 16-07-2006. it was cool test. The test was 3 hours. I am sending u Questions Asked on Engineering and C. Merit-Trac conducted the test. The test was for both Developmnt & testing Domain. I attended for Dev posn.

ADOBE Written Test

1) Wap to reverse a linked list and sort the same.

2) Given two integers A & B. Determine how many bits required to convert
A to B. Write a function int BitSwapReqd(int A, int B);

3) Write an algorithm to insert a node into sorted linked list.After inserting,
the list must be sorted.

4) Without using /,% and * operators. write a function to divide a number by 3.
itoa() function is available.

5) Wap to swap two integer pointers.

6)Write a funcn int round(float x) to round off a floating point num to int.

7) write an ALP to find sum of First n natural numbers using the following Instructions

LDA num ; load Accumulator with num
DCR R ; decrement Register R
INR R ; increment Register R
MOV x,y ; move the contents of register y into register x
JZ label ; jump to label if A=0
DJNZ label; Decrement & Jump if A <> 0
you can use B & C registers in addition to A register

Find the n th node in a Singly Linked list starting from the End in a Single Pass.

9)prove that a tree is BST.what is height of a tree?

10) Given A,B & C Boolean polynomials.Prove That (A+BC)=(A+B)(A+C)