Adobe – Sample Placement Paper (With Answers)

A solid cube of 4 inches has been painted red, green and black on the pairs of opposite faces. It has then been cut into one inch cubes. Following questions relate to the smaller one inch cubes.

1.How many cubes have only one face painted?
(1) 8 (2) 16
(3) 24 (4) 32

2. How many cubes have only two faces painted?
(1) 0 (2) 16
(3) 24 (4) 32

3. How many cubes have only four faces painted?
(1) 0 (2) 8
(3) 12 (4) 16

4. How many cubes have no faces painted?
(1) 0 (2) 8
(3) 16 (4) 24

5. ‘Win’ is related to ‘Competition’ in the same way as ‘Invention’ is related to?
(1) Discovery (2) Experiment
(3) Trial (4) Laboratory

6. In a certain code language,
i. ‘Guda buka’ means ‘Clear water’
ii. ‘Pin gola’ means ‘Overcast sky’
iii. ‘Pin saf buka’ means ‘Clear blue sky’

Which word in that code language means ‘Blue’?
(1) Pin (2) Buka
(3) Saf (4) Guda

7. I was born on August 11. Mohan is younger to me by 11 days. This year Independence Day falls on Monday. The day on which Mohan’s birthday will fall this year will be
(1) Monday (2) Tuesday
(3) Sunday (4) Thursday

8. The flowers in a basket become double after every minute. In one hour, the basket becomes full. After how many minutes, the basket would be half-filled?
1) 30 (2) 45
(3) 59 (4) 58

9. Which of the following will come in place of the question mark (?) in the following letter series?
BXF, DVI, FTL, HRO,?
1) JPL (2) KPL
(3) JOL (4) None of these

10. If ‘+’ means ‘*’, ‘-’ means ‘/’ , ‘/’ means ‘+’ and ‘*’ means ‘-’ , then what will the value of 20/ 40 – 4 * 5 +6 ?
1) 60 (2) 1.67
(3) 150 (4) 0

Answers:

1.(3)
2.(3)
3.(1)
4.(2)
5.(2)
6. (3)
7.(3)
8.(3)
9.(4)
10.(4)

Adobe Systems (Technical)

I went through the Adobe process some months back for a dev position (I have 3+ yrs of exp.).
They have a written test day followed by (if you cleared the tests!) a interview day.
Tests are fairly easy… hey I sailed through them! Typical quantitative, problem solving (puzzles), coding. Some areas to brush up on for the tests:

- C pointers (goes without saying!)

- Searching (bsearch)

- Binary trees and in-order, pre-order etc.

- Recursion (a C test of some standing without recursion? Nah..!)

- Automata / state machines

- General C concepts – diff between macro and inline fn. diff between static, local, dynamic vars etc.

Tests last for 2-3 hours but are not very intensive (if you’ve taken the JEE you’ll know what intensive is…).

Interview day is.. intensive! My suggestion is.. no matter how much you’ve worked on C/C++ and low-level algo stuff – DON’T go into the interview day without 4-5 days of solid revision of core concepts.

I had to go through 4 tech and 1 hr interview. You’ll either be asked *very* deep technology or no technology (only puzzles that is)… no general probing tech questions here.

Tech areas that were covered:

- C++ – inheritance, polymorphism – VPTR/VTBL questions, operator overloading, templates

- Linked lists and trees! Lots about this

- Find general algos for list questions etc

- Deeper areas like compression algos, algo complexity

Tech questions to puzzles split was 40:60. That is mostly puzzles… but this is upto you – you might be asked which you want. If you’re confident about knowing tech inside out go for tech questions — easier to prove yourself. Puzzles have a luck component.

Great place to work btw… very cool plush office. Lots of smart people.

So how did I fare? Do I work for Adobe now? That’s the mystery…

Adobe Systems (Candidates Experiences)

I had a chance to attend the interview at Adobe.

There is a written test and followed by a gruelling rounds (6 intervies and a written test in 7 hrs – single day) of interview that were interesting but at times too stereotyped.

I think the Adobe people (i mean those who took my interview) are obsessed with the idea that a person who can solve the puzzles fast is suited best to their job.

Well, as my talks are indicating I was not selected but it was a good overall experience.

One thing I would like to state is that in Adobe the work in more or less related to graphics and pixel testing as far as testing is concerned. So beware if you are not interested in the pixel matchinmg stuff as it can be hell of a work there.

But overall USP of the company is good, so it is worth a try

Adobe Placement Paper Pattern (C – Language + Engineering Test)

Both of the paper has 10 questions and 10 marks for each test. And each test is for 45 minutes.

C Paper:

1.

What is the difference between Char a[ ]=”string” and char *a=”String”

2.

What is wrong with the code? The code was for conversion from Celsius to Fahrenheit

degF =5/9*(c+32)
In code this line was wrong as we want 5/9 and that to be multiplied with bracket result. But here 9 will be first multiplied with bracket result.

3.

What are Data breakpoints? Give two scenarios where we make the use of this?

4.

What do you mean by Bit fields? Give example.

5.

Write the function for changing a number from hexadecimal to integer hoe’s?

6.

Compare two binary trees they are same or not.

7.

You have N computers and [Ca, Cb] means a is connected to b and this connectivity is symmetric and transitive. then write a program which checks that all computers are interconnected and talk two each other?

8.

WAP to find Depth of tree program. We were given the structure of the node using that we need to write the code.

9.

In binary search we have two comparisons one for greater than and other for less than the mid value. Optimize so that we need to check only once

10.

Question was some what like we need to write the function so that we get the two dimensional array and memory is assigned to it using malloc function. Don’t remember the question exactly. But this was the only question in proper language?

Engineering Paper:

I remember only 5 questions in this. A s this was taken first

1. Binary search Tree was given. Find 4ths smallest element.

2. Some code in assembly was given and given five options. What is being calculated?

Ans (XY) 2 + Y + Z

3. Represent (-5)10 in 2’s complement representation in 8 bits

4. Expression was given. Draw tree and then find the postfix

Some commands in the assembly language were given. Then need to convert this code in assembly

A=300;

For (i=0 ; i<=10 ; i++)

A=A+200;

C test:

Q1) linked list using recursion.

Q2) Find if a number is divisible my 3, without using %,/ or *. You can use atoi().

Q3) 2 integers A and B are given, find the no of bits that need to be flipped in A to get B. ( xor a and b and count the number of bits)

Q4) Write a Rotate function for rotating elements in an array, using a reverse function.

Q5) Given 2 sorted arrays A and B with duplicate elements, get C= A -B and does not have duplicates(use a variation of merging 2 arrays and then remove the duplicates.)

Q6) Some routines to swap int pointers.

Q7) Subtraction of 2 base 13 numbers.

Q8) Min and max nodes of a quad tree.

Q9) Prove that in a tree no of internal nodes is one less than leaves.

Q10) A couple of boolean logic proofs

Q11) Code to see if a binary tree is a BST or not.

Q12) Switch case program out put?

Engineering test:

Most of it had algorithms( no code)

Q1) Given an array with some repeating numbers. Like 12,6,5,12,6

output: 12,12,6,6,512 should come before 6 since it is earlier in list. So cant use a dictionary.

Q2) Implement a dictionary manually with a lil overhead.

Q3)finding nth element from end in a list

Q4)inserting an element into a sorted linked list.

ADOBE PAPER – AUG 2007

ADOBE PAPER – AUG 2007

Most of the problems in Adobe are solved here, though it is not mentioned that they are from Adobe, so this means he has to go through them as many as possible

The C/Java/quant are from bestsamplequestions.com
The questions are mostly (99%) theoretical, or algo type

If he is fresher then there will also be an apti n quant paper. Otherwiser only two papers
Engineering – based on college courses
C/Java – whatever opt for – this too is theoretical

what is transient variable
what is finally
what is the significance of package
were asked.

A few of the question that were asked to me are

A BST was given, find the fourth largest node
Evalutae the psotfix expression
Evalutae (-5) in 2′s complement
An expression was given, we had to make the expression tree for that
and the postfix expression for that. It was something like
a* ((b+c/d) *d) +e

You have N computers and [Ca, Cb] means a is connected to b and this connectivity is symmetric and transitive. then write a program which checks that all computers are interconnected and talk two each other
Soln : – Breadth First Search(I guess)

Some code in assembly was given and given five options. What is being calculated?
Ans (XY) 2 + Y + Z

Some commands in the assembly language were given. Then need to convert this code in assembly

Commands were like
Add- Adds top 2 elemnrts from stack and pushes the result back in to it
Sub
and others

The code is
A=300;
For (i=0 ; i<=10 ;  i++)
A=A+200;

Algorithm to draw a line in a 2-D axes.
Given P1(x1,y1), P2(x2,y2) where x1>x2.

My Soln:  find the slope m and intercept c, using standard formulae
Increment x2 by 1(this was given) and calculate y2′
and join the dots
Easy though

write an algorithm, to find if two binary trees are same

Adobe interview for freshers

Adobe interview for freshers

Written rounds:

Round 1: Aptitude – Trivially simple. Time could be a problem for junta not preparing for CAT. Fifteen questions in fifteen minutes.

Round 2: Quant – This was even more trivial. Thirty questions in thirty minutes.

These two rounds were entirely objective, multiple-choice with no negative marking. We had to fill in an OMR sheet and very few of us had pencils and erasers with us – almost everybody had pens. That was bad as we couldn’t change an option after marking it.

Round 3: Engineering. This included a lot of general stuff. Don’t remember much about it. Thirty minutes. 15 marks

Round 4: Code. This was a real test. A lot of questions and quite a few that I hadn’t seen before. We were supposed to write working C code in a limited time. 15 questions. 45 marks. It was like Neo fighting Smith in Matrix 3!

10 were selected out of 60 people who wrote the test.

Interview1:

He is very soft-spoken and one of my friend told me that this guy had brutally destroyed him. So I was terribly nervous. I usually am confident but in that room, I was stammering! Finally, it turned out that he wasn’t that brutal after all. Moral of the story: Stay confident at all times.

1. He asked me my specialization? When I told him that I had none as I didn’t want to specialize in this stage, he was a little surprised but appeared satisfied with my reason.

2. Why not further studies? (He had noted that I was third in my batch. He appeared impressed by that

Answer : I told him that my profile clearly indicated that I’ve been trying to get into the industry via internships, industry-funded projects right from second year, second sem. I said that I was fully sure that I didn’t want to do MS anytime soon.

3. He asked me to tell him about my favorite project.

Answer : I told him about the web-browser that I had developed for cell-phones. I thought that was the only project which was closest to what Adobe was working on. He appeared satisfied with my answers.

4. He then looked at my grades. He commented that my lowest grade – B- was in Digital Image Processing. I just looked at him like a doofus thinking of what to say. But he quickly added, ‘don’t worry, it happens.’ So people, be fully prepared to explain any anomalous grades. I was prepared with the explanation of the W in the my grade-sheet but not of the B- in DIP. I know that this is really stupid considering that I was interviewing with Adobe. Don’t make this mistake.

5. He then asked me a question that had been asked in Round 4, written test:

Describe an optimal algorithm to find the second minimum number in an array of numbers. What is the exact number of comparisons required in the worst case? Note that they didn’t ask the order in Big-Oh notation. They wanted the exact number of comparisons.

Answer : I screwed up, big time in this question. I had superficially discussed this question with my friend a while ago and he had outlined an algorithm which I thought that I had understood, but I hadn’t. I started off explaining it but got stuck in the middle. He sternly told me to read it up again. One solution that I could tell him, and which I had written in the test was this:

Use two variables – min and second min. Initialize them by comparing the first two elements of the array. This is (1) comparison. Then, go through the entire array, from index 2 to n-1 comparing each element, first with min and then with second min, updating each variable as necessary. This will involve a worst case of two comparisons for each element. Therefore, total number of comparisons = 2*(n-2) + 1 = 2*n – 3 comparisons.

I’ll try to update this with a better solution, sometime soon.

6. Given a polygon (could be regular, irregular, convex, concave), find out whether a particular point lies inside it or outside it.

Answer : This is an easy, straight question from graphics. You shoot a ray parallel to the x-axis passing through this point. Start with odd parity. Change parity of ray each time it intersects an edge of the polygon (consider special case of when the line passes through a vertex of the polygon. Change parity only if it passes through a vertex which has one edge above it and one edge below the ray). If the parity of ray is even when it passes through the point, it is inside the polygon, else it is not.

7. He asked me to explain Canny’s algorithm to him. (this was because my DIP project was related to this)

Answer : This is simple. Study DIP

8. Then, he gave me a practical problem to solve: Suppose you are given an image which contains some text and some photos. How do you find the location of the image?

Answer : I gave various alternatives – from searching for RGB components, to using OCR.. he didn’t appear fully satisfied. I think he was looking for edge-detection, but that would fail, if the text contained tables, etc.

Interview2 :

He was friendly at the start but this interview was my worst. He asked me my favorite subject. I said that it was Programming. (He laughed at that)

1. Which are the four storage classes in C.

Answer : static, extern, register, auto

2. Given a program:

int i;

int main()
{

int j;

int *k = (int *) malloc (sizeof(int));

…

}

Where are each of these variables stored?

Answer : I started off correctly, but he was able to confuse me. He brought in shared libraries, static libraries fundas into the discussion. We had a discussion for about twenty-minutes on this. Finally, he was happy with one of my answers because I had deduced which policy made sense and answered correctly. He said that out of all the people interviewed so far (I was second last), nobody had been able to answer all of these questions correctly
3. Question on polymorphisms.

this is easy – get it from any C++ book. He tried to confuse me again, but this time I was ready and he was finally satisfied.

Then he looked at my grades and said that out of all your grades, you have only two Bs and one of them is in Compilers. Why? (Damn it.. three non-A grades and that’s all they ask about. What’s wrong with this world?!)

Didn’t you like Compilers? “Not in particular”, I replied. “Fine. Now, I HAVE to ask you questions on compilers”, he said.
4. He again went back to the first question he had asked me. Once again, I had no satisfactory answer for him.

5. Then he wrote out some code and asked me how the compiler will generate code for it. I gave some answer, but he was clearly not satisfied. I thought it was all over by then.

Then, he asked me a DIP question. He commented that he had given that particular question to his juniors in IITB once and they had done a very good job at it. The problem is this:

A teacher is writing on a blackboard and we want to pass all the information on the blackboard over a low-bandwidth network in real-time. How do we do it.

Answer : I first suggested that we capture only a small portion of the board. To locate that portion, we could search for the chalk in the prof’s hand – of course, taking care that it had the blackboard in the background (no point capturing a video of the prof scratching his chin, na?). Further, if the prof was writing only text, we could convert the video into text by OCR and then transmitting. Simple diagrams could also be reduced to a set of vector-graphics instructions (we rarely, see the prof shading stuff). I think he liked my approach, but was not completely satisfied. Anyway, we left it at that and went forward.

6. Given a set of words one after another, give me a data structure so that you’ll know whether a word has appeared already or not.

Answer : I suggested various alternatives. but he kept helping me and finally, we came up with an array of pointers to 26-trees (each node of the tree has 26 children). Store every word as a path from the root to a leaf with pointers in the correct places. For example, hello would be stored as – pointer from ‘h’ index of the root array to a node which had a pointer from ‘e’ index of it’s array to a node which had a pointer from ‘l’ index of the array.. and so on. This is both time and space efficient.
7. He asked me some questions on Interprocess Communication: What’s a semaphore? How are they used? He would often pick out words from my answers and ask me what they meant. He wanted to make sure that I really knew what I was talking about. I was able to answer all his questions, but I made the mistake of telling him, when we started off that I didn’t know much about this subject as I had done it a long time ago. He was very annoyed at that, apparently because a lot of people before me had said this.
8. He then asked me some DB fundas. Transaction. Serializability, Consistent state, etc. I was able to answer all of them. I stumbled around a bit in a few questions where I was explaining correctly, but not using the keywords that he was looking for.

9. Finally, he asked me whether I had any questions. I thought that I should say something to make him realize that I was not completely stupid and so asked him whether there was any logic to the order in which the short-listed candidates were called. This turned out to be a dumb move. The order was alphabetic and he sent me off with a parting shot, saying “You guys do pattern recognition and stuff and still you can’t recognize such a simple pattern” Me and my big mouth! Moral of the story: Don’t ask questions for the sake of asking.

Interview3 : Puzzle round

After the first two interviews, this one was like having a warm batch after being cold and wet for days! I did well in this one.

1. There is a clock at the bottom of the hill and a clock at the top of the hill. The clock at the bottom of the hill works fine but the clock at the top doesn’t. How will you synchronize the two clocks. Obviously, you can’t carry either of the clocks up or down the hill! And you have a horse to help you transport yourself. And, the time required for going up the hill is not equal to the time required to go down the hill.

Answer : You have to go up the hill and come back, with horse, without horse, getting four equations to solve four unknowns – time to go uphill – with horse, without horse, time to go downhill – with horse, without horse. Then you can go up the hill and set the clock to ‘(time when you left) + (time to go uphill with horse)’

2. There was one more puzzle.. I don’t remember it. but I do remember that we started discussing ways of generating large prime numbers. I told him the funda of Mersenee primes (luckily remembered it) and he was decently impressed.

3. We also talked a bit about my phone browser project.

Finally, two people were selected out the ten that were shortlisted.

ADOBE PAPER ON 25th FEBRUARY AT NOIDA

ADOBE PAPER ON 25th FEBRUARY AT NOIDA

I have given the test on 25 February for the Developer. This was for the experienced people <=1year. We had to give two tests of Engineering and C or Java.

Both of the paper has 10 questions and 10 marks for each test. And each test is for 45 minutes.

C Paper:

1. What is the difference between Char a[ ]=”string” and char *a=”String”

2. What is wrong with the code? The code was for conversion from Celsius to Fahrenheit

degF =5/9*(c+32)

In code this line was wrong as we want 5/9 and that to be multiplied with bracket result. But here 9 will be first multiplied with bracket result.

3. What are Data breakpoints? Give two scenarios where we make the use of this

4. What do you mean by Bit fields? Give example

5. Write the function for changing a number from hexadecimal to integer htoi(s

6. Compare two binary trees they are same or not.

7. You have N computers and [Ca, Cb] means a is connected to b and this connectivity is symmetric and transitive. then write a program which checks that all computers are interconnected and talk two each other

8. WAP to find Depth of tree program. We were given the structure of the node using that we need to write the code.

9. In binary search we have two comparisons one for greater than and other for less than the mid value. Optimize so that we need to check only once

10. Question was some what like we need to write the function so that we get the two dimensional array and memory is assigned to it using malloc function. Don’t remember the question exactly. But this was the only question in proper language

Engineering Paper:

I remember only 5 questions in this. A s this was taken first

1. Binary search Tree was given. Find 4ths smallest element.
2. Some code in assembly was given and given five options. What is being calculated?
Ans (XY) 2 + Y + Z
3. Represent (-5)10 in 2’s complement representation in 8 bits
4. Expression was given. Draw tree and then find the postfix

Some commands in the assembly language were given. Then need to convert this code in assembly

A=300;

For (i=0 ; i<=10 ; i++)

A=A+200;

NOTE: NO Automata questions were asked. Good News!!!!

The engineering paper was totally based on the Data Structure, simple assembly programs implementation and some simple algorithms related to data structures.

So read Arrays, Linked list, postfix prefixes inorder post order etc.

By,
Anand

Next Page »