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 Profile Answers by kaushurtz Questions by kaushurtz

• Jun 30th, 2010

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

• 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 Profile Answers by sweetbla Questions by 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...

• #### 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 Profile Answers by pardeepg Questions by 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={3,2,5,4,3,4,6,12,4,12,6}the...

#### manasonnet Profile Answers by manasonnet Questions by 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 Profile Answers by manasonnet Questions by 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...  