Answer Posted / sayandip ghosh

The max number of binary trees that can be formed from n
nodes is given by the Catlan Number C(n).

C(n) = (2n)! / (n+1)!*n! for n>=0.

int findNoTree(int low ,int high)
{
int sum=0;
if(low<=high)
{
for(int k=low;k<=high;k++)
{
if(k==low)
sum+=findNoTree(low+1,high);
else
{
if(k==high)
sum+=findNoTree(low,high-1);
else

sum=sum+findNoTree(low,k-1)*findNoTree(k+1,high);
}
}

return sum;
}
return 1;
}

What is data _null_? ,Explain with code when u need to use it in data step programming ?

3407

---

Given a spherical surface, write bump-mapping procedure to generate the bumpy surface of an orange

3434

---

why nlogn is the lower limit of any sort algorithm?

2898

---

How do you verify if the two sentences/phrases input is an anagram using predefined functions in string.h and by using arrays?

2605

---

write a program for area of circumference of shapes

2630

---

Design an implement of the inputs functions for event mode

3585

---

can you use proc sql to manpulate a data set or would u prefer to use proc report ? if so why ? make up an example and explain in detail

3110

---

Write a Program in 'C' To Insert a Unique Number Only. (Hint: Just Like a Primary Key Numbers In Database.) Please Some One Suggest Me a Better Solution for This question ??

2543

---

how to create a 3x3 two dimensional array that will give you the sums on the left and bottom columns

3704

---

How to palindrom string in c language?

11359

---

#include int main(void) { int a=4, b=2; a=b<>2 ; printf("%d",a); return 0; }

1697

---

write a simple calculator c program to perform addition, subtraction, mul and div.

3779

---

In a gymnastic competition, scoring is based on the average of all scores given by the judges excluding the maximum and minimum scores. Let the user input the number of judges, after that, input the scores from the judges. Output the average score. Note: In case, more than two judges give the same score and it happens that score is the maximum or minimum then just eliminate two scores. For example, if the number of judges is 5 and all of them give 10 points each. Then the maximum and minimum score is 10. So the computation would be 10+10+10, this time. The output should be 10 because 30/3 is 10.

3009

---

Can you send Code for Run Length Encoding Of BMP Image in C Language in linux(i.e Compression and Decompression) ?

4467

---

write a function to give demostrate the functionality of 3d in 1d. function prototye: change(int value,int indexX,int indexY,int indexZ, int [] 1dArray); value=what is the date; indexX=x-asix indexY=y-axis indexZ=z-axis and 1dArray=in which and where the value is stored??

4751

---