Adobe Interview Questions

Answered by: Atul on: 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 ?

Answered by: raj on: Oct 2nd, 2012

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

Answered by: kaushurtz on: 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[...

Answered by: raady on: 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 ...

Answered by: sweetbla on: Mar 17th, 2010

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

Answered by: Null Pointer Theorem The Null Pointer Theorem s on: 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...

Answered by: mishmani on: 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 ...

Answered by: pardeepg on: Sep 25th, 2008

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

Answered by: mrinmoy on: 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...

Answered by: manasonnet on: Jul 11th, 2008

For a boolean operation
A.A=A
A.1=A
A.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

Answered by: manasonnet on: 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...

Answered by: gupta_pratibha on: 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 b...

Answered by: doczenith on: 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 ...