Adobe Written Test Section I

Well my feedback for this test would be it was easy not so tough (if you had atleast prepared with basic stuff).All direct questions were there.
Set included few standard questions like to find the depth of a tree.
conversion of a hexadecimal number to integer etc,..


I know most of the people from north India staying here at bangalore wud like to get into adobe for there own reasons(near to home,gud sal etc..).

It seems like the adobe fellas are bit lazy in changing the question paper.
This paper was repeating from past 1 month, ditto paper not even a comma change.
I came to know about this after the test :( .

So this for all those desparate junta who wants to get in to adobe.


There were 2 sections one on C and other on Algorithms .

Section I:


1) WAP to check the equality of two trees

2) Draw the tree structure given an infix equation and write the postfix equation for the same

a*(b+c/d)*e-f;

3) assembly code given : we have to find whats it does. Only one register is there

Load X
MULT Y
STORE T1
LOAD T1
MULT T1
LOAD Y
ADD Z
MULT T1
STORE R

(I am not so sure about the above statements and they gave 4 choices. We have to choose among them)


4)A shared queue is there between 2 threads T1,T2 .
T1 writes in to queue and T2 reads from the queue.
T1 cannot write when the queue is full and T2 cannot read when the queue is empty.
Write an solution for this situation.
you are given following operators
createEvent
Event.setName
Event.Reset
enterCriticalSection
Leave Critical Section
Wait
etc,.

[Producer Consumer problem]


5) They gave some assembly instructions and asked to write the following c code in assembly

a=300;
for(i=10;i>0;i--)
a=a+200;

available assembly codes are push #number , add NO(adds the NO to top stack element and pushes it to stack again) ,sub,exchange ( changes the postion of 2 top numbers in stack),JNZ (tricky : loops back if the top element is non zero and Pops out the top element), duplicate – pushes a duplicate entry of top element back to stack.



6) There are some (c1….cn) computers connected by k connections. Write a algorithm to find out if all the computers are connected ?
Connections are transitive and symmetric .
( Any solutions for this question are welcome )


7) The gave a BST tree structure and u have to find the 4th smallest element in the tree…..

8)
A stack implementation was given whose size was 1….N.

Push begin v[i] : = x; i=i+1 end;

Pop begin i=i-1 x=v[i] end;

3 options were given. We need to identify which operation has to be done so that push and pop work properly.
They were something like
1)Replace statements of pop with that of push
2)Exchange statements In push and in pop.(i.e make v[i]=x as 2nd stmnt and i=i+1 as 1st stmnt.
etc…

9)WAP for Conversion of hexadecimal to integer.
You need to consider even 'a' and 'A'.
Input can be oxabc or OXAbF


10)There was a question on drawing a line from one given point to other.
You are given a function like drawpoint(double x, double y);
WAP to draw a line from point p1 to point p2.