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
A BST was given, find the fourth largest node Ans- Do an InOrder Traversal, should give you the 4th largest node ?
write an algorithm, to find if two binary trees are same Ans - /* Compares the receiver to another tree to see if they are structurally identical. */ public boolean sameTree(BinaryTree other) { return( sameTree(root, other.root) ); } /** Recursive helper -- recurs down two trees in parallel, checking to see if they are identical. */ boolean sameTree(Node a, Node b) { // 1. both empty -> true if (a==null && b==null) return(true); // 2. both non-empty -> compare them else if (a!=null && b!=null) { return( a.data == b.data && sameTree(a.left, b.left) && sameTree(a.right, b.right) );} // 3. one empty, one not -> false else return(false); }
Hi, I am preparing for Adobe, I am concentrating more on Data-structure and my C++ skills. I am ready to put my 100% effort but lacking direction. Can anybody please guide me some good books and links to follow for this preprations? I appriciate your response.
HI Everybody, I attended Adobe test on 16-07-2006. it was cool test. The test was 3 hours. I am sending u Questions Asked on Engineering and C. Merit-Trac conducted the test. The test was for both Developmnt & testing Domain. I attended for Dev posn. ADOBE Written Test1) 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
Hi appeared for adobe test on 13th August.I m yet to get any response from adobe...has anybody appearing on that day got a call.pls mention my cell 9818249394
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 possibleThe C/Java/quant are from bestsamplequestions.comThe
Latest Answer : Hi,I am preparing for Adobe, I am concentrating more on Data-structure and my C++ skills. I am ready to put my 100% effort but lacking direction. Can anybody please guide me some good books and links to follow for this preprations? I appriciate ...
Polaris Interview Preparation and Model Question papers : Please find Aptitude(41), Analytical(28), Interview Procedure(1)Click here to view the section
Nucleus Interview Preparation and Model Question papers. The following model question papers are added. Up One Level Global-Interview-Questions » Nucleus »
Mascot Interview Procedure, Pattern and Model Question Papers Interview ProcedureAt the moment we do not have much informaton about the interview though the candidate may be required to go through both technical and HR interviews. There are a total 6 sections in the written test. Each section h
Ramco Interview Procedure, Pattern and Model Question Papers section added.Interview ProcedureThe information on the interview is pretty sketchy but it consists of both technical grilling and HR interview.The written test consists of both aptitude and a technical test.The aptitude section of the tes
Hi all , I recently went for Keane India Testing Paper.
They offer 2 courses.
1. Advanced Application Programming 5 months course roughly
2. Testing Course 45 days roughly Selected students are given trainig and then the one efficient in their work are absorbed by Keane as Trainee on Stipend b
Looking to garner more sales to business customers, Adobe has beefed up its server software for handling the flow of business forms based on the PDF format.
I was looking for something on google groups last night and came across a post by Mladen that included a link to his website. As I did not remember him having a site I went for a look. Mladen's site....[Read More] Posted by Pete On 03/10/05 At 10:36 PM
