Showing Questions 1 - 7 of 7 Questions
Sort by:
|
• #### Adobe Interview Procedure, Pattern and Model Question Paper

Please use comment section to submit Adobe Interview Procedure, Pattern and Model Question Paper

#### Atul

• Oct 31st, 2012

What are the chances of getting rejected in selection meet of adobe as i have tld tht ..now there will be ne selection meet ?

#### raj

• Oct 2nd, 2012

Even I gave written on same date.but havnt got a response till now.

#### kaushurtz

• Jun 30th, 2010

Use this code public int fib(int n){int[] array = new int[2];array[0]=0;array[1]=1;for(int i=2;i<=n;i++){  int sum = array[0]+array[1];    array[ i % 2] = sum;}return array[0]+array[1];}}

• Jun 27th, 2008

pathsum(*node,sum){static sum;if(node==NULL && sum==0){printf("n Path exists");}if(node==NULL &&Sum!=0){sum=sum+node->data; //To undo the effect of the ...

#### sweetbla

• Mar 17th, 2010

Answer is M(h-1)+1, where h stands for height of the tree.

#### Null Pointer Theorem The Null Pointer Theorem s

• Sep 18th, 2007

Null Pointer Theorem The Null Pointer Theorem states that given a regular n-ary tree, the number of nodes m is related to the number of null pointers p in the following way: p = (n - 1)×m + 1 Pr...

• #### Adobe Telephonic Interview Questions

Here are some questions I was asked.1) program to find height of a binary tree?Complexity of above program2) How do you know where the memory leaks when you have multiple files?3) What are virtual destructors?4) What should be done when an exception occurs in the constructor?5) What can be maximum memory that a process can have in 32-bit machine? What assigns a process this memory?6)Program to find...

#### mishmani

• Aug 17th, 2009

I have tried answering theoretical ones only2) May be when destructor is not doing clean up4) we cannot handle this because constructor cannot return any thing. Destructor will not be called for this ...

• #### Adobe India Written Test 2006

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 Development & 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...

#### pardeepg

• Sep 25th, 2008

isbst(tree* node){  return (node->left == NULL && node->right == NULL);          if(node->left == NULL && node->right...

#### mrinmoy

• May 1st, 2007

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)#includevoid showbits( int n);int main(){    int a,b,sa,sb;    re...

1. find the nth node from end in a linked list in single parse2. wap to check if the tree is BST3. prove A+BC =(A+B)(A+C)4. (A023AC5B)-(129B5321) to the base 135. prove that no of leaf nodes in any binary tree is one more than the no of nodes with degree 26. write a prog in assembly lang 2 calculate sum of first n natural nos7. print values in an array with recurring digitseg a[10]={3,2,5,4,3,4,6,12,4,12,6}the...

#### manasonnet

• Jul 11th, 2008

For a boolean operationA.A=AA.1=AA.0=0(A+B)(A+C)=A.A+A.C+B.A+B.C=A+A(B+C)+BC=A(1+B+C)+BC=A.1+BC=A+BC

#### manasonnet

• Jul 11th, 2008

Sorry by mistakely the enter key was pressed.ans continues:-.... for Q.11a-ab=a(1-b)=0 (False) if b is TRUE               &nb...

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 questions are mostly (99%) theoretical, or algo typeIf he is fresher then there will aloso be an apti n quant paper. Otherwiser only two papersEnginerring - based on college coursesC/Java...

#### gupta_pratibha

• Apr 20th, 2008

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.

#### doczenith

• Apr 8th, 2008

A BST was given, find the fourth largest nodeAns- Do an InOrder Traversal, should give you the 4th largest node ?write an algorithm, to find if two binary trees are sameAns - /*Compares the receiver ...