ADOBE Written Test

Adobe's India campus was inaugurated in February 1998 to augment engineering resources for the Product Development
organization. From the very outset, the focus was on hiring top engineering talent and establishing a world-class work ethic. The
results were soon evident. In 1999 the India engineering team shipped key components for InDesign 1.0-Adobe's premium offering
in the page layout and design area. A small engineering team was seeded to work on the Acrobat Desktop Product. In 2000, the
team expanded further and shipped components for Illustrator, Golive, Photoshop and Indesign 1.0 (J). A new team was setup to
proliferate the Adobe Acrobat Reader on various alternative platforms. A singular achievement in 2001 was the release of
PageMaker 7.0 from the India campus. This was perhaps the first instance of a major international Desktop product being
engineered from India. The Hand Held team shipped the Acrobat Reader on Palm OS and Pocket PC. These products had more than
a million downloads. The Digital Imaging and Digital Video team was set up in 2002. In October 2002, as the headcount crossed
130, the campus shifted to a new 200,000 square feet state of the art building in the heart of Noida. New Engineering teams were
set up to work on the next release of Frame Maker (FM 7.1) and for working on a plug-in to move PageMaker customer's to
InDesign. A small team was formed to work on New Product ideas. The DI team released the Photo Shop Album Starter Edition in
2003.The Acrobat team released key components for the Acrobat 6.0 release. To support Adobe's thrust in the Forms based
solutions area, the Acrobat Server group was set up at the campus. A new team was set up to work on PostScript. A Pre-release
Program Management team to run the Beta programs for some Adobe products from India was formed. Another milestone was the
signing up of partnerships with major Indian software companies like TCS and Wipro to sell Adobe Forms solutions to Enterprises as
part of their overall solution. A Team was set up to partner with these companies and provide support. We exited the year with 250
people on board. The campus would continue to grow in 2004. The areas of expansion include the Acrobat Server group, Digital
Imaging and Digital Video. In the Creative Pro Business Unit growth is expected in the Post Script team.
ADOBE Written Test
Section -1
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 Cool prove that a tree is BST.what is height of a tree?
9) Given A,B & C Boolean polynomials.Prove That (A+BC)=(A+B)(A+C)
Section - 2
There Were four section:
1. Aptitude: They had fairly simple arithmatic question, questions on geometry and questions like whether
information can be deduced from the comments given. It was fairly easy and jst u need to have basic clear.
2. Analytical: Questions like pattern matching, odd one out were there. Be careful while attempting these two sections
that u wont be having much time. Before u know the time is over.
3. Computers: This paper is mostly from the topics u cover in B.Tech. there was one question on finite automata,Bit
manipultaion(flipping the bits), drawing the tree given preorder and inorder traversal, finding the formula for N-ary
tree to fine number of external nodes.
4. C/Java: Here u had to write C programs(Mind u no mutiple questions).There was one question to write program to
search a string from bigger string, write a algorithm to compute X^n which is of complextity log n, implement atoi
function.(U cannot use any standard function in these.)
Questions
1. what percentage of total mass does liver has

Ans 2.4%
What is the ratio of bones to total mass
All the questions are simple ..
3. 45 min Testing concept test: 20 objective multiple choice qustions like binary form of numbers, virtual memory,
lossy compression, while loop, if-then-else, error codes.
ba. lossy compression

b. lossless Compression
c.text
d image
2. output of 11000100 minus 2
3. Memory leakage is because of

a. variable not decraled
b. variable not free.. like this 4 options were given
4. Virtual memory concept is related to

a. memory leagkage {mospagebreak}
5.Regretion testing is defined as

a. testing the whole application
b.testing the different modules in the application
6. If the time is very limited for the testing then what would u test in the application.
a. run all the tests
b.look for the most used featues in the application
c.go to the test plan and run the test based on the priority
I would suggest to go thru all the definition like what is regretion testing .what is unit smoke.etc.
1 Test Case Writing questions: 10 test cases for entering 3 values representing sides of a triangle and the program
giving output as scalene, isosceles or eqilauteral (10 Marks)
1 Output of a calculator and finding the error in the output, write the defect log for the bug (5 Marks)
1 Ques on weather Dev should do the testing or not. Give 3 reason on favour and 2 against it. (5 Marks)
1 Question diff between priority of a bug and severity of a bug. Give example of one case where priority is high but
severity is low and one case where severity is high bur priority is low.
1 Question on a program that calculates P=R/I where R, I are integer inputs and P a floating point output. Write 10
test cases for this - 5 Marks.
2nd LEVEL INTERVIEW PROCESS

1. Software test: One hour Software test. U will be placed on a system with an application opened that is containing bugs in it. A
reference doc will be provided where u will find the description of six modules of the application. U have to find maximum number
of bugs in those six modules given in the reference doc in one hour. Each module contains at least one bug. U will have to keep
writing the bug in a paper provided to u as u keep finding it with the time when u found it.
2. 5 rounds of Interviews each of approximately 1 hour.
1st will be by a Senior Team member level guy, focusing on everything from simple codes to find errors in them, writing simple
algos, giving very simple puzzles, test cases for a marker, ur projects, about urself, etc. The guy will keep giving hints and help u to
solve the problem.
2nd will be by a Manager level guy, based on ur technical skills, puzzles to be solved on the whiteboard in front of him, algo to
reverse a string using array, questions on ur projects, test cases of a duster, the projects u have mentioned in ur CV. More of a
question-answer based approach, not very interactive.
3rd will be by a senior HR on why Adobe, what keeps u going, where r u placed in ur organization, all HR questions and about ur
projects and Organizational levels.
4th will be by a Senior Team member level guy, focusing only on puzzles, lots of puzzles and scenario based test cases, like how to
test an imaging application that removes the red eye affect from an image, test cases of an VOIP phone. The guy will keep giving
hints and help u to solve the problem.
5th will be by a Senior Team member level guy, focusing on problem solving approach, scenario based error investigation, like an
attachment is not opening in outlook on a particular system, what all can be the reasons. The guy will sort of discuss with u the
problem and will try to find out the solution at the same time assessing ur problem solving skill. Then he will play a logical game,
then some general questions, test cases for a radio, something about Adobe etc.
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;
foo(){
arr[0]=10;
}
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

Company Name : ADOBE
Type : Fresher, Job Interview
Exam Date: 17th July 2010
No of Rounds : Screening Test, Aptitude Test, Technical Round-1, Technical Round-2
Location : Allahabad (India)
WRITTEN ROUND:
Section 1 - 45 mins
15 Ques. Analytical Analysis
30 Ques. Quantitative Analysis (too much easy from my point of view)
Section 2 - 90 mins
Paper 1:
1. There are N address lines in the procesor, which is true regarding the virtual space of the running process
a. there is no limit on virtual space
b. 2^N bytes in virtual space
c. it depends upon size of RAM
d. Nothing can b said or none of the above( i m not sure abt this option)
Question : 2
A. threads share memory at heap
B. threads share stack
C. (this option was related to somthing death of thread then wat happens to other child thread)
D. thread improve efficiency in multiprocessor system
a. only A
b. Only A & D(or may b option was Only A &C)
c. Only A,C,D
d. none of the above
3. in this a BST was given and u have to find average search for a number of keys then select the appropriate option for that
average value
4. if there N processors in a multiprocessor system them wat is the order of summing N numbers
a. log n^2
b. log n/2
c. log n
d. n*n
5. indented set of loops were given then u have to find number of the times the function will b called in the most interior loop. loop
was varying like i=1 to N then inner one j=1 to i then so on....
6. relation sum of degree of each node of the graph and number of edges (may vertex i dont remember and even dont want to
think much more about it) then relation between number of vertex and number of edges in the graph.
7. write a function with arg NODE *p , NODE* q such that it inserts q between p and p->next
8. calculate power of a number and complexity of your process.
9. program to find whether a point lies in a traingle or not u were not supposed to check that the given 3 points representing
traingle form a traingle coz u were allowed to assume that they form a traingle(hint :- there was hint something related to area i
actually dont remember that bt that hint applies that u have to calculate area of the given traingle then u have to find area of three
traingle formed by the given point and points of the traingle and if they are equal then point is inside the traingle).
10. write a function for y=a0+a1x+a2x^2.........+anx^n-1 (i actually dont remember question the question completely because i
havennt done this ques)
Paper 2:
1. a union was given with member int and pointer then u have to tell what will sizeof return
2. difference between calloc and malloc
3. int fun(int n)
{
unsigned static int b=2;
int a=3;
/*some simple code was also there bt i dont remember that with action performed on a and b*/
return (n+a+b)
}
o/p when u will call printf("%d %d",fun(4),fun(5))
4.write a function to return index of string s where that index represent righmost occurenece of string t in s
5. write a function to flip odd bits of a unsigned int
6. write a function to print sum of two unsigned integer if there is no overflow otherwise print a message that overflow is happening
7. write a function to generate all anagrams of a string
8. struct node{
int data;
struct node *prev,*next;
}
if a head pointer is given to the list having the above structure then print the item in the reverse order that is from end to starting
(nothing was given whether list is doubly linked list or circularly double linked list in all there was no information abt how list is
being mantained).
9. suppose u write this line on command line myprog.exe hello world then u have to print world hello myprog.exe
10. write a program to swap to interger pointer
Company Name : Adobe India

Type : Experienced
Guys!! Double check your offer before you join Adobe India. These managers and HR fool you like anything.
Offer seems so inviting as if you're the king, its only after you join, you come to know that you've been screwed and fooled. If your
actual CTC is X, these guys make it look like 1.5X in offer letter and make u believe that this is actually even more than 1.5X.
Also they might cheat you on project details and will sure lie about the quality of work you'll be offered. It sucked me and I came
out within 2 months (Thank God). Best of luck to you people.
Exam/Interview Date : 24-Oct-2009

No of Rounds : Screeing Test, Aptitude Test, Techincal Round-1, Techincal Round-2, Group Discussion - GD, Client/Manager
Interview
Location : Noida
Contributor: Rohit
C Language:
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 :
I remember only 5 questions in this. A s this was taken first....
1. Binary search Tree was given. Find 4th 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
5. 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;
Adobe Latest Placement Paper At Noida (2008)

C Paper:
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.
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
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 4th smallest element.
Ans (XY) 2 + Y + Z
5. 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.
Paper: Adobe Placement Paper Pattern May-2006
There were four section:
1. Aptitude: They had fairly simple arithmetic question, questions on geometry and questions like whether information can be
deduced from the comments given. It was fairly easy and just u need to have basic clear.
2. Analytical: Questions like pattern matching, odd one out were there. Be careful while attempting these two sections that u wont
be having much time. Before u know the time is over.
3. Computers: This paper is mostly from the topics u cover in B.Tech. there was one question on finite automata, Bit manipulation
(flipping the bits), drawing the tree given preorder and inorder traversal, finding the formula for N-ary tree to fine number of
external nodes.
4. C/Java: Here u had to write C programs (Mind u no mutiple questions). There was one question to write program to search a
string from bigger string, write a algorithm to compute X^n which is of complexity log n, implement atoi function. (U cannot use
any standard function in these.)
Paper: Adobe Campus Placement Paper 3rd Sep 2006 at Mumbai (Technical Section-C++)
1) Write a program 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.
5) Write a program to swap two integer pointers.
6) Write a function 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

you can use B & C registers in addition to A register
8) Prove that a tree is BST. What is height of a tree?
9) Given A, B & C Boolean polynomials. Prove That (A+BC) = (A+B) (A+C)
INTERVIEW PROCESS FOR QA:
2. 5 rounds of Interviews each of approximately 1 hour. 1st will be by a Senior Team member level guy, focusing on everything
from simple codes to find errors in them, writing simple algos, giving very simple puzzles, test cases for a marker, ur projects,
about urself, etc. The guy will keep giving hints and help u to solve the problem. 2nd will be by a Manager level guy, based on ur
technical skills, puzzles to be solved on the whiteboard in front of him, algo to reverse a string using array, questions on ur
projects, test cases of a duster, the projects u have mentioned in ur CV. More of a question-answer based approach, not very
interactive. 3rd will be by a senior HR on why Adobe, what keeps u going, where r u placed in ur organization, all HR questions and
about ur projects and Organizational levels. 4th will be by a Senior Team member level guy, focusing only on puzzles, lots of
puzzles and scenario based test cases, like how to test an imaging application that removes the red eye affect from an image, test
cases of an VOIP phone. The guy will keep giving hints and help u to solve the problem. 5th will be by a Senior Team member level
guy, focusing on problem solving approach, scenario based error investigation, like an attachment is not opening in outlook on a
particular system, what all can be the reasons. The guy will sort of discuss with u the problem and will try to find out the solution at
the same time assessing ur problem solving skill. Then he will play a logical game, then some general questions, test cases for a
radio, something about Adobe etc.
APER FOR FRESHERS (WRITTEN & INTERVIEW )
Written rounds:
Round 1: Aptitude - Trivially simple. Time could be a problem for candidates not preparing for CAT. Fifteen questions in fifteen
minutes.
Round 2: Quantitative - 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 Inter process 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 fundamental of Mersenee primes (luckily remembered it) and he was decently impressed.
3. We also talked a bit about my phone browser project.
PAPER: ADOBE SYSTEM PLACEMENT PAPER ON 25th FEBRUARY AT NOIDA( CONSISTING OF C, JAVA & ENGINEERING)
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:

2. What is wrong with the code? The code was for conversion from Celsius to Fahrenheit degF =5/9*(c+32)
Ans. 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.
7. You have N computers and [Ca, Cb] means a is connected to b and this connectivity is symmetric and transitive. then write a
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:
1. Binary search Tree was given. Find 4ths smallest element.

Ans (XY) 2 + Y + Z
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;
algorithms related to data structures.
So read Arrays, Linked list, postfix prefixes inorder post order etc.
PAPER: ADOBE SYSTEM PLACEMENT PAPER (CONSISTING OF C & ENGINEERING)

The test predominantly consists of algorithm questions and a lot of questions on trees.
Some questions are:
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. ( X-OR 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,5 12 should come before 6 since it is earlier in list. So cant use a dictionary.
Q2) Implement a dictionary manually with a littel overhead.
Q3)finding nth element from end in a list
Q4)inserting an element into a sorted linked list.
In the another part many questions were based on the rule that square root of 25 is +5/-5. Not just 5. Similarly for 1.
Geometry the questions were a littel bit tricky, but they are few that u can ignore them.
Paper Type : Technical - C & C++
The test predominantly consists of algorithm questions and a lot of questions on trees.
Some questions are:-

C Test:
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)
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
Q10) A couple of boolean logic proofs
Q12) Switch case program out put
Engineering test:

output: 12,12,6,6,5
12 shud come before 6 since it is earlier in list. So cant use a dictionary.
Q2) Implement a dictionary manually with a lil overhead.

In the anal part many questions were based on the rule that square root of 25 is +5/-5. Not just 5. Similarly for 1.
Geometry the questions were a lil bit tricky, but they are few that u can ignore them.
I got lot of queries about the kind of questions asked in Adobe test.
There were four section:

information can be deduced from the comments given.
It was fairly easy and jst u need to have basic clear.
3. Computers: This paper is mostly from the topics u cover in B.Tech. there was one question on finite
automata, Bit manipultaion(flipping the bits), drawing the tree given preorder and inorder traversal, finding the
formula for N-ary tree to fine number of external nodes.
4. C/Java: Here u had to write C programs(Mind u no multiple questions). There

was one question to write program to search a string from bigger string, write a algorithm to compute X^n which is of
complexity log n, implement atoi function.(U cannot use any standard function in these.)
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 Written Test
Section -1
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.
7) write an ALP to find sum of First n natural numbers using the following Instructions LDA num ; load Accumulator
with num

you can use B & C registers in addition to A register Cool prove that a tree is BST.what is height of a tree?
Section - 2
There Were four section:
information can be deduced from the comments given. It was fairly easy and jst u need to have basic clear.
3. Computers: This paper is mostly from the topics u cover in B.Tech. there was one question on finite automata,Bit
manipultaion(flipping the bits), drawing the tree given preorder and inorder traversal, finding the formula for N-ary
tree to fine number of external nodes.
4. C/Java: Here u had to write C programs(Mind u no mutiple questions).There was one question to write program to
search a string from bigger string, write a algorithm to compute X^n which is of complextity log n, implement atoi
function.(U cannot use any standard function in these.)
Questions

Ans 2.4%
3. 45 min Testing concept test: 20 objective multiple choice qustions like binary form of numbers, virtual memory,
lossy compression, while loop, if-then-else, error codes.
ba. lossy compression

c.text
d image

a. variable not decraled

a. memory leagkage {mospagebreak}

1 Test Case Writing questions: 10 test cases for entering 3 values representing sides of a triangle and the program
giving output as scalene, isosceles or eqilauteral (10 Marks)
1 Question diff between priority of a bug and severity of a bug. Give example of one case where priority is high but
severity is low and one case where severity is high bur priority is low.
1 Question on a program that calculates P=R/I where R, I are integer inputs and P a floating point output. Write 10
test cases for this - 5 Marks.
2nd LEVEL INTERVIEW PROCESS

solve the problem.
Trianz Pattern
1.Written test(75q-60min)
Verbal(15)
Reasoning(15)
Technical(35)
Quantitative(10)
2.Group Discussion(15 min)
3.TR+HR round(30 min)

C
Java
DBMS
Written Test:
1.APPRENTICE : PLUMBER ::
player : coach
child : parent
student : teacher
author : publishe
intern : doctor
2.MUSICIAN : ORCHESTRA ::
mechanic : car
songwriter : lyrics
desk : office
player : team
actor : screen
3.ASSENGERS : AIRPLANE ::
audience : theater
birds : nest
sailors : submarine
freight : warehouse
students : classroom
CORRAL : LIVESTOCK ::
fence : posts
capture : thieves
nest : birds
devise : plans
fire : employees
4&5 etc. given
7,8,9,10
fill in the blanks are given
10-15:
Some Verbal Reasoning Questions
Aptitude:
time & distance
work and time
some basic questins
rations
clocks
intersts
true discount
Analitical Questions
1.arrange ments
Technical
C
java(few)
CN
DBMS
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?
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?
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:
Ans (XY) 2 + Y + Z
3. Represent (-5)10 in 2?s complement representation in 8 bits
A=300;
For (i=0 ; i<=10 ; i++)
A=A+200;
C test:
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)
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
Q10) A couple of boolean logic proofs
Q12) Switch case program out put?
Engineering test:
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.
Here are the questions asked:

There were 3 parts...but i am only posting Testing comcepts question ofdescriptive type.
1) Give 5 reasons why a build can be released with bug
2) Write a bug report for a word processor program which crashes when the contents of 89th column is been sorted in
assending order.
3) Write test 10 cases for program which has a table with 2 fields of NAME od char type & CLASS of INT type.NAME
fields is truncated after 26 charaters & CLASS takes value between 1 to 9 both included.
There are 3 possible opearations program can perform

a)When a new student joins the class the program adds a new field
b)When student leaves the class the field get deleted
c)when student gets promoted then program increments the class by 1
Write 5 test cases for the scenario.

4) write 10 test cases for a program that takes date in dd/mm/yyyy format & prints it out with a increment of 1.
for dates (dd) can be given in the range 1<=dd>=30
for months (mm) canbe given in the range 1<=mm>=12
for years(yyyy) can be given in the range 1600<=yyyy>=9999
5)Give 5 bugs that could cause a program to crash when it printed the 999999 th pages 1000001th line.
Some objective question were there but they were easy.
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)
Paper : ADOBE Written Test Paper Pattern
ADOBE Written Test

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.

DJNZ label; Decrement & Jump if A <> 0 you can use B & C registers in addition to A register
8) prove that a tree is BST.what is height of a tree?
Paper : ADOBE Job Interview Placement Paper Pattern 2006
Adobe sample test paper 3 rd september at mumbai Written Test

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);
4) Without using /,% and * operators. write a function to divide a number by 3.itoa() function is available.
6) Write a funcn int round (float x) to round off a floating point num to int.
DJNZ label; Decrement & Jump if A <> 0 you can use B & C registers in addition to A register
1st LEVEL WRITTEN TEST FOR QA:
1. 15 min Logical Ability test: Simple syllogism based questions, sequence related questions, etc
2. 30 min Quantitative Aptitude test: Simple Arithmetic, angles, geometry, profit/loss, number system
There will be 15 questions for match the column
Mark A if column A is GREATER than column B
Mark B if column A is LESS than column B
Mark C if column A is = column B
Mark D if DATA IS INSUFFICIENT
There are very simple typical baron based
There would be 3 questions on triangles all three were from RS Aggarwal.
17. there was one set of questions on the DI question on 20 -25 were on this graph
It was about the total mass of human body is 70,000 gms
Muscles 30000
Bones 10000
Blood 5000
Liver
There were two pie charts
Which tell the percentage of water in the food.
And the second one tells the which parts ,,something like that
Question

Ans 2.4%
3. 45 min Testing concept test: 20 objective multiple choice qustions like binary form of numbers, virtual memory, lossy
compression, while loop, if-then-else, error codes.
1. Winzip is a
a. lossy compression
c.text
d image

a.variable not decraled

a. memory leagkage

1 Test Case Writing questions: 10 test cases for entering 3 values representing sides of a triangle and the program giving output as
scalene, isosceles or eqilauteral (10 Marks)
1 Question diff between priority of a bug and severity of a bug. Give example of one case where priority is high but severity is low
and one case where severity is high bur priority is low.
1 Question on a program that calculates P=R/I where R, I are integer inputs and P a floating point output. Write 10 test cases for
this - 5 Marks.
2nd LEVEL INTERVIEW PROCESS FOR QA:
solve the problem.
PAPER : Adobe Test Paper On 2007 At Noida

Paper Type : Whole Testpaper
Test Date : 25 February 2007
Test Location : Adobe 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.
C Paper:
What is the difference between Char a[ ]=”string” and char *a=”String”
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.
What are Data breakpoints? Give two scenarios where we make the use of this
What do you mean by Bit fields? Give example
Write the function for changing a number from hexadecimal to integer htoi(s
Compare two binary trees they are same or not.
You have N computers and [Ca, Cb] means a is connected to b and this connectivity is symmetric and transitive. then write a
WAP
to find Depth of tree program. We were given the structure of the node using that we need to write the code.
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
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:

Ans (XY) 2 + Y + Z

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

algorithms related to data structures.
So read Arrays, Linked list, postfix prefixes inorder post order etc.
PAPER : Adobe Test Paper On 2006 At Mumbai

Paper Type : Whole Testpaper
Test Location : Mumbai
Adobe Test Paper September At Mumbai
Written Test:
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);
4) Without using /,% and * operators. write a function to divide a number by 3.

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

you can use B & C registers in addition to A register
1st LEVEL WRITTEN TEST FOR QA:

1. 15 min Logical Ability test: Simple syllogism based questions, sequence related questions, etc
2. 30 min Quantitative Aptitude test: Simple Arithmetic, angles, geometry, profit/loss, number system
There will be 15 questions for match the column
Mark A if column A is GREATER than column B
Mark B if column A is LESS than column B
Mark C if column A is = column B
Mark D if DATA IS INSUFFICIENT
There are very simple typical baron based
There would be 3 questions on triangles all three were from RS Aggarwal.
17. there was one set of questions on the DI question on 20 -25 were on this graph
It was about the total mass of human body is 70,000 gms
Muscles 30000
Bones 10000
Blood 5000
Liver
There were two pie charts
Which tell the percentage of water in the food.
And the second one tells the which parts ,,something like that
Question
Ans 2.4%

3. 45 min Testing concept test: 20 objective multiple choice qustions like binary form of numbers, virtual memory, lossy
compression, while loop, if-then-else, error codes.
1. Winzip is a
a. lossy compression
c.text
d image
a.variable not decraled
a. memory leagkage
5.Regretion
testing is defined as
1 Test Case Writing questions: 10 test cases for entering 3 values representing sides of a triangle and the program giving output as
scalene, isosceles or eqilauteral (10 Marks)
1 Question diff between priority of a bug and severity of a bug. Give example of one case where priority is high but severity is low
and one case where severity is high bur priority is low.
1 Question on a program that calculates P=R/I where R, I are integer inputs and P a floating point output. Write 10 test cases for
this - 5 Marks.
2nd LEVEL INTERVIEW PROCESS FOR QA:

solve the problem.

ADOBE Written Test

Caricato da

Informazioni sul documento

Descrizione originale:

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

ADOBE Written Test

Caricato da

Copyright:

Formati disponibili

Adobe's India campus was inaugurated in February 1998 to augment engineering resources for the Product Development

ADOBE Written Test

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

5) Wap to swap two integer pointers.

DCR R ; decrement Register R

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

There Were four section:

1. what percentage of total mass does liver has

What is the ratio of bones to total mass

All the questions are simple ..

ba. lossy compression

2. output of 11000100 minus 2

3. Memory leakage is because of

4. Virtual memory concept is related to

5.Regretion testing is defined as

2nd LEVEL INTERVIEW PROCESS

2. 5 rounds of Interviews each of approximately 1 hour.

Company Name : ADOBE

3: find the lowest common ancestor of a bst

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)

11: tell diff a) void (*P)(void *a[],int n);

was given .. then a complex expression to solve

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

8. calculate power of a number and complexity of your process.

10. write a program to swap to interger pointer

Company Name : Adobe India

Exam/Interview Date : 24-Oct-2009

Adobe Latest Placement Paper At Noida (2008)

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

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

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

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

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

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

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

LDA num ; load Accumulator with num

INTERVIEW PROCESS FOR QA:

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

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

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

Answer : This is simple. Study DIP

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

Where are each of these variables stored?

Interview3 : Puzzle round

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

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

PAPER: ADOBE SYSTEM PLACEMENT PAPER (CONSISTING OF C & ENGINEERING)

Some questions are:

Q1) linked list using recursion.

Some questions are:-

Q6) Some routines to swap int pointers.

Q7) Subtraction of 2 base 13 numbers.

Q8) Min and max nodes of a quad tree.

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

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

12 shud come before 6 since it is earlier in list. So cant use a dictionary.

Q2) Implement a dictionary manually with a lil overhead.

There were four section:

It was fairly easy and jst u need to have basic clear.

4. C/Java: Here u had to write C programs(Mind u no multiple questions). There

11: tell diff a) void (P)(void a[],int n);

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