for 3 rd question

let us take source arrays A & B and destinaton is C

take three index variables I J K respectively for each array

take n and m are the size of arrays

while(i< n &&j< m)

{

if (a[i]<b[j]) c[k++] a[i++]

else c[k++] b[j++]

}

while(i< n) c[k++] a[i++];

while(j< m) c[k++] b[j++];

then c array contains sorted data of A and B

for first question no need to take array

count 0;

for(int i 0;i<100;i++)

{

scanf( d &x)

if(x> 50 && x< 60) count++;

}

I am having a recursive solution to the 2nd problem though one can find a non-recursive solution thru the implementation of stack.

void printBinary(int n)
{
if (n>0)
{
printBinary(n/2);
printf( c 01 [n 2]);
}
else
{
printf( \n );
}
}

Solution of q4 could also be made with recursion.

void traverseInReverse(Node *hp)
{
if (hp! NULL)
{
traverseInReverse(hp->next);
printf( \n d hp->data);
}
else
{
return;
}
}

Three cheers for recursion. (sorry for those who always wants efficiency rather than some fun coding)

The answer to the first question

#include<stdio.h>
main()
{
int age[5] i 0 count 0;
for(i 0;i<5;i++)
{
printf( Enter the age of the d person i+1);
scanf( d &age[i]);
}
for(i 0;i<5;i++)
{
if((age[i]> 50)&&(age[i]< 60))
count++;
}
printf( The no of the people between the age group 50 and 60 is d count);
}

void agecheck(int a[])

{

int count 0;

for(int i 0;i<100;i++)

{

if(a[i]>50 ||a[i]< 60)

{

}count++;

}

else continue;

}

}

void main()
{
int i a[15] n;
clrscr();
printf("Enter a no:n");
scanf(" d" &n);
for(i 0;i<15;i++ n>> 1)//Vary de bit size accordingly
a[i] n&1;
for(i 15;i> 0;i--)
printf(" d" a[i]);
getch();
}