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

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

Answer Question  Select Best Answer