1.

Adobe Written Test on 5th April 2009There were 4 sections

DS 10 ds quesions
Java/J2EE 15 java questions+ 5 j2ee
Analytical
Quanta

Some of the questions I remember

1) a bst was give and asked the forth smallest element (easy one)
2)an inorder of binary tree was given and asked to draw tree as well as state its
postorder(easy)
3) 2 coordinate points p(x,y)and q(x,y) are given and write an algorithm to draw aline
4)write the prefix and infix of the given algebric expression
5)algo to prove that given bt are same
6)computer numbers and there connection ordinates are give prove that all computers are
connected to each other
7)give the binary equivalance of -5
8)and 9) 2 assembly programs were given
one i am not able to recall

java

1)transiant variable
2) difference between wait() notify() and notifyall()
3)2 questions on output
5) choose the correct variable declaration
6)what is a thin client
7)j2ee componenets
8)diffenece between entity bean and session bean

in all java was quit simple

analiitical portion . I found it a little tough as i am bad at it

Quanta : it was dame easy nothing more easy can u expect :)it was 30 qestions basd on
algebric expersions orjunior maths
2. Test on 27-Sep-2008Test has been made simple than before.

Few easy questions on output of programs.

1.
int arr[10]; //in file1.c
extern int *arr; //in file2.c
main()
{
arr[0]=1;
}
//Find Error? how and why
2.
Hash key function was given and some numbers. Have to find numbers which are mapped to
same hash key.
3.
To Reverse doubly link list
4.
Given Assemply program. To find what it does.
My given program was calculation ===> n! / (n-r)!
5.
to find value of expression *+A/AB/-ABB when vaules of A and B was given
6.
To find o/p of crazy function.
crazy(int n, int a, int b)
{
if(n==0) return;
crazy(n-1,b+n,a);
printf("%d%d%d",n,a,b);
crazy(n-1,b,a+n);
}
find crazy(3,4,5);

7.
question on macro
#define SUM(A,B) (A * B)
#define MUL(A,B) (A) + (B)
a=2;b=3;
value = SUM( SUM(a-b , b) + MUL (a,b) ) - SUM( MUL (b,a) + SUM(a, b-a) )

8.
To find smallest common Ancestor of two given nodes of BST. ?? Really tough one.

9.
To print 2's compliment of binary no. given in string. output should also be in string only.

10. To find middle of link list.

11. to find missing no. from unsorted array without using another array.

12. To make a BST from given values. // Simplest one

3. Adobe Puzzles
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 aloso be an apti n quant paper. Otherwiser only two papers
Enginerring - based on college courses
C/Java - whatever opt for - this too is theoretical
Questions like
what is transient variable
what is finally
what is the significance of package
wree 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

RE: how will you find the number of leaf nodes in a tr...

FindLeafNodes(Tree *root)

if (root->left NULL && root->right NULL)

return 1;

else

return (FindLeafNodes(root->left) + FindLeafNodes(root->right))

4. 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.
5. ADOBE PAPER ON 29th DECEMBER AT BANGALORE
Hai guys,

There are 3 sections.

A. analytical: 15 questions 15min (reasoning mcqs)

B. quantitative: 30min 30 questions (maths and generic mcqs)

C. Computers: data structires (linklist and graph.. a question on quad-a tree with max 4

nodes), algorithms (writing a few), compilers (make a dfa of a given expression), output

evaluation

[1 hour]

D. C/Java: 5 questions of C paper

1. count the bits required to be altered while swaping values a and b

2. rotate an array using reverse

eg .. arraA[1 2 3 4 5]

u have rev(arrA, 2, 3) -> arrA[1, 2, 4, 3, 5] using this .. rotate arrA

for this kind of a solution

rotate(arrA, 2) -> arrA[3 4 5 1 2]

3. reverse a linklist using recursion

4. check for divisibility by 3 without using /,*,% when you have itoa() available

6. ADOBE SAMPLE TEST PAPER 3 rd SEPTEMBER AT MUMBAI

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

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)

1st LEVELWRITTEN 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

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.

1. Winzip is a

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

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 INTERVIEWPROCESS FOR QA:

-------------------------------------

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.