 Related Questions 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 binaryy 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 diditseg a[10]={3,2,5,4,3,4,6,12,4,12,6}the prog shud print {3,3,5,4,4,6,6,12,12}chk the sequence8. write prefix and postfix notation9. Read Answers (6) | Asked by : Sumit 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 Read Answers (11) | Asked by : Guru Pradeep Latest Answer : this works by double reversal principle to rotate an array by 3 postions ... first reverse the first 3 elements from the list and then reverse the remaining elements from the list in place and then reverse the entire array the result is that we have an ... Read Answers (2) | Asked by : x Test has been made simple than before.Few easy questions on output of programs.1. int arr[10]; //in file1.cextern int *arr; //in file2.cmain(){ arr[0]=1;}//Find Error? how and why2.Hash
Sponsored Links
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
