| |
GeekInterview.com > Placement Papers > Adobe > Placement Papers
| Print | |
Question: Adobe Placement Papers
Answer: Please use the comments section to share any Adobe Placement Papers from your interviews and written tests. |
| February 02, 2006 14:09:23 |
#2 |
| Gaurav |
Member Since: Visitor Total Comments: N/A |
RE: Adobe Placement Papers
|
| Adobe came to r campus today(25th Feb) n took the written test n will declare the results after some days .There were 4 sections as told in the previous post n the first 2 sections were very easy compared to 3 rd n4th .The question in 3 n4 were basically related to C n algorithm n maximum of them were the same as posted by Pratiksha Powar"Hi guys,I attended the most recent Adobe test in B'lore.It had 4 sections(2 1/2 hrs)1. Analytical Aptitude: 15 mins 15 Qs2. Quantitative Aptitude: 30 mins 30 Qs3. Engineering Test :13 Qs, 1 hr4. C/Java Test 15-20 Qs, 45 minsThe 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 minsThanks "some more questions which i remember r 1. given a tree generate its mirror image tree 2. print a number in hexademical notation without using sprintf3.given a tree n a sum , calculate if there is a path from the root to a leaf with the sum of values at the node equal to the given sum . |
| |
Back To Question | |
