Answer / biplab sinha

2nChoosen/(n+1)

Answer / a.s.

it's Ω((4^n)/(n^(3/2)))

Answer / ss

it is 2^n-n trees.

Answer / maverick

answer: 2^n-2

Answer / v.suresh kumar

It is possible to form 2^n - 1 binary trees with n nodes.

Answer / rk

2^n-1

main() { signed int bit=512, i=5; for(;i;i--) { printf("%d\n", bit = (bit >> (i - (i -1)))); } } a. 512, 256, 128, 64, 32 b. 256, 128, 64, 32, 16 c. 128, 64, 32, 16, 8 d. 64, 32, 16, 8, 4

2 Answers   HCL,

find A^B using Recursive function

2 Answers  

How can u say that a given point is in a triangle? 1. with the co-ordinates of the 3 vertices specified. 2. with only the co-ordinates of the top vertex given.

1 Answers  

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

0 Answers   Honeywell,

String copy logic in one line.

11 Answers   Microsoft, NetApp,

char *someFun() { char *temp = “string constant"; return temp; } int main() { puts(someFun()); }

1 Answers  

main( ) { char *q; int j; for (j=0; j<3; j++) scanf(“%s” ,(q+j)); for (j=0; j<3; j++) printf(“%c” ,*(q+j)); for (j=0; j<3; j++) printf(“%s” ,(q+j)); }

1 Answers  

Implement a t9 mobile dictionary. (Give code with explanation )

1 Answers   Amazon, Peak6, Yahoo,

program to Reverse a linked list

12 Answers   Aricent, Microsoft, Ness Technologies,

main() { int c[ ]={2.8,3.4,4,6.7,5}; int j,*p=c,*q=c; for(j=0;j<5;j++) { printf(" %d ",*c); ++q; } for(j=0;j<5;j++){ printf(" %d ",*p); ++p; } }

2 Answers   CSS, Wipro,

hello sir,is there any function in C that can calculate number of digits in an int type variable,suppose:int a=123; 3 digits in a.what ll b answer?

6 Answers  

main() { printf("\nab"); printf("\bsi"); printf("\rha"); }

3 Answers