GeekInterview.com > Placement Papers > Adobe > Placement Papers

Next Question

Placement Papers | Question 1 of 10

Adobe Placement Papers

Please use the comments section to share any Adobe Placement Papers from your interviews and written tests.

Total Answers and Comments: 20

Last Update: June 27, 2008

Sponsored Links

Best Rated Answer

—

No best answer available. Please pick the good answer available or submit your answer.

Sorting Options

Page 1 of 2

« First

Last »

December 21, 2005 02:04:28

Pratiksha Powar

RE: Adobe Placement Papers

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 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

Thanks

Is this answer useful? Yes | No

February 25, 2006 14:09:23

Gaurav

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 .

Is this answer useful? Yes | No

March 16, 2006 02:18:07

senn

Member Since: March 2006 Contribution: 1

RE: Adobe Placement Papers

hi friends

i have recently attended adobe writtne test.. its same as prithksha said... u people plz prepare GRE CAT questions c questions from bestsamplequestions.com.... sure u will clear.... all the best...

thanks

sen.

Is this answer useful? Yes | No

March 16, 2006 02:32:47

senn

RE: Adobe Placement Papers

hi frds

even iam telling the same what gaurav n prathiksha said.... some questions getting repeated... study the GRE/CAT sample questions from bestsamplequestions.com... there u will get c sampel questions also... iam sure then written will be easy to clear.... all the best....

frdly

sen

Is this answer useful? Yes | No

March 21, 2006 07:27:41

yashwantbpatil

Member Since: March 2006 Contribution: 1

RE: Adobe Placement Papers

Hi i would like to know the solutionsfor the following questions which were asked in Adobe test..

-questions using finite automata
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

i am not very clear abt the solution that was given ...

thanks

Is this answer useful? Yes | No

March 27, 2006 02:53:08

Net

RE: Adobe Placement Papers

Hi guys I have recently given adobe test. As others have already posted the test consists of Quantitative(30 questions - 30 mins) Analytical(15 mins - 15 questions) Engineering(1 Hour) and Technical(45 minutes) tests. These are some of the questions I remember.In Engineering:1) Complexity of binary search. and also write the algorithm to do the same.2) f(a b) 0 if ad){ stmt e; } if this loop is run 5000 times and ad is true 70 of the times how many times is stmt e executed.12) Some question on parallel computing like if a code takes 100 seconds to execute ona single processor and if 40 of the code is sequential what is the time taken by to execute the code on systems with 2 processors and 4 processors.In 'C' paper.1) Write 3 examples of preprocessor tags.2) What is the difference between char a[] hello and char *a hello ;3) how do you make sure a header file is not included twice in a program.4) what is the output of the following programint a[] {1 2 3 4);printf( d 2[a]);5) implemenatation of atoi();6) search a sub string in a string and return the index of the last occurence of the string.7) Implement fibinocci search8) some question on conversion of hexadecimal number to binary Prepare well for the Quantiative and Analytical. Quantitative is very easy. But Analytical is a little touch as the time is very less. 15 questions-15mintes so you have to be fast in solving the problems. As some one one has already suggested please solve the problems in bestsamplequestions.com you will clear the test easily.all the best.

Is this answer useful? Yes | No

May 11, 2006 08:06:02

mkag

RE: Adobe Placement Papers

Analytical:

If CURD is 321184 then MILK is -

Ans: 1391211

Engg.

1. Solve: (A V B) ^ (!A V B) ^ ( A V ! B)

2. If 0 on a sector represents vacant and 1 represents occupied and on a 32 bit area D4FE2003 is written then what is vacant.

3. A DFA was drawn .for a certain string.

You have to draw a DFA for language from alphabet (a b)* which does not accept strings containing aabb.

4.create a tree for which inorder and preorder traversal is given

like Inorder AVBEGHEHNEH

and Preorder VGHWEH .

Now draw tree for Postorder traversal

5. for 100 sorted elements array

a. what will be avg complexity of searching an element in the array

b. write a code for searching an element

Is this answer useful? Yes | No

May 30, 2006 02:46:10

tux

RE: Adobe Placement Papers

I have cleard the adobe written for dev any clue what they ask in interviews

Is this answer useful? Yes | No

July 02, 2006 14:45:11

Praveen

RE: Adobe Placement Papers

Hi some more info on Adobe Question paper-

Analytical/Quantitative - GRE book is sufficient - very low level but the time is short so you should practice.

Data Struct/OS - Binary Search Trees (isBST? depth node-leaf relations etc) Linked list (reverse search the element from it's end etc) some questions on OS. - Overall you should have good knowledge in BST and linked list.

C - swap int pointers malloc for mxn matrix function pointers const pointers typedef errors switch() errors #define bitwise operators (divisble by 3) arrays (find duplicates rotate elements from i j etc) recursion booleans (prove equations like A+BC (A+B)(B+C) simplify (~A)(A+B)+(AA+B)(~B)) postorder preorder. overall the question paper was tough you have to practice a lot before the test.

Is this answer useful? Yes | No

July 25, 2006 09:55:23

#10

shahil

RE: Adobe Placement Papers

I am a fresh graduate and got a call from Adobe and they called me for their QA position and i am told that i have to go through three round of written test like Quant analytical and finally Technical they are going to ask me Some concepts of testing can any body plz let me know what exactly they can ask me in this technical round...will it be just fundamentals of testing or they are gonna ask some thing about tools...

plz reply as soon as possible

Thanks

Is this answer useful? Yes | No

Page 1 of 2

« First

Last »

Go To Top

User Name		Remember Me?
Password

Question Bank

Analytical: