-
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...
-
Maximum number of nodes in a binary tree with height 3 is 20
False
RaniSKumar
- Nov 26th, 2006
As stated above , answer is false.the explanation is as follows.the no of leaf nodes in a binary tree - max =2^(height+1) -1=(2^(3+1))-1 = 16-1=15so tha maximum number of nodes in a binary tree of height 3 is 15.
-
If a binary tree is constructed using nodes with two pointers each,how many null pointers does a tree with N nodes have?A. n-1B. nC. n+1D. Depends on the number of edges
RaniSKumar
- Nov 26th, 2006
let the total no of nodes = nlet the no: of leaf nodes = xtotal nodes in terms of leaf nodes = 2x -1i.e 2x-1 =nx=(n+1)/2since each leaf node has 2 empty pointers no of empx pointer = 2x = n+1
saravanan
- Aug 2nd, 2005
N+1
