Embedded Files
WAP to find nCr , nPr using function
WAP to find nCr , nPr using function
#include<stdio.h>
int factorial(int x)
{
int i,fact=1;
for(i=1;i<=x;i++)
{
fact=fact*i;
}
return fact;
}
int nPr(int n, int r)
{
int z=(factorial(n))/(factorial(n-r));
return z;
}
int nCr(int n,int r)
{
int p = factorial(n) / (factorial(r) * factorial(n-r));
return p;
}
int main()
{
int n,r;
printf("enter n,r: \n");
scanf("%d %d",&n,&r);
printf("%d\n",nPr(n,r));
printf("%d\n",nCr(n,r));
}
WAP to define multiple functions.
WAP to define multiple functions.
#include<stdio.h>
float sum(float x,float y)
{
return x+y;
}
float sub(float x,float y)
{
return x-y;
}
float mul(float x,float y)
{
return x*y;
}
float div(float x,float y)
{
return x/y;
}
int main()
{
float x,y,c;
printf("enter numbers: \n");
scanf("%f %f",&x,&y);
c=sum(x,y);
printf("%f\n",c);
c=sub(x,y);
printf("%f\n",c);
c=mul(x,y);
printf("%f\n",c);
c=div(x,y);
printf("%f\n",c);
}
WAP to find factorial using function.
WAP to find factorial using function.
#include<stdio.h>
facto(int n)
{
int i,fact=1;
for(i=1;i<=n;i++)
{
fact=fact*i;
}
return fact;
}
int main()
{
int n;
printf("enter number: \n");
scanf("%d",&n);
int c=facto(n);
printf("%d",c);
}
WAP to find factorial using recursion.
WAP to find factorial using recursion.
#include<stdio.h>
facto(int n)
{
if (n==1)
return 1;
else
return n*fact(n-1);
}
int main()
{
int n;
printf("enter number: \n");
scanf("%d",&n);
int c=facto(n);
printf("%d",c);
}
WAP to add even natural numbers using recursion.
WAP to add even natural numbers using recursion.
#include<stdio.h>
sum(int n)
{
if (n==0)
return 0;
else
return n+sum(n-1);
}
int main()
{
int n;
printf("enter number: \n");
scanf("%d",&n);
int c=sum(n);
printf("%d",c);
}
WAP to add even natural numbers using recursion.
WAP to add even natural numbers using recursion.
#include<stdio.h>
sum(int n)
{
if (n==0)
return 0;
else
return n+sum(n-1);
}
int main()
{
int n;
printf("enter number: \n");
scanf("%d",&n);
int c=sum(n);
printf("%d",c);
}
WAP to add odd natural numbers using recursion.
WAP to add odd natural numbers using recursion.
#include<stdio.h>
sum(int n)
{
if (n==1)
return 1;
else
return n+sum(n-2);
}
int main()
{
int n;
printf("enter number: \n");
scanf("%d",&n);
int c=sum(n);
printf("%d",c);
}
WAP to print fibonacci series using function.
WAP to print fibonacci series using function.
#include<stdio.h>
fib(int count)
{
int fibo,i,first=0,second=1;
if(count==0)
return 0;
else if(count==1)
return 1;
else
{
for(i=2;i<=count;i++)
{
fibo=first+second;
first=second;
second=fibo;
}
return fibo;
}
}
int main()
{
int n,i;
printf("enter number: \n");
scanf("%d",&n);
for(i=0;i<=n;i++)
{
int c=fib(i);
printf("%d ",c);
}
}
WAP to print fibonacci series using recursion.
WAP to print fibonacci series using recursion.
#include<stdio.h>
int fib(int n)
{
if(n==0)
{
return 0;
}
else if(n==1)
{
return 1;
}
else
{
return fib(n-1)+fib(n-2);
}
}
int main()
{
int n,i;
printf("enter number: \n");
scanf("%d",&n);
for(i=0;i<=n;i++)
{
int c=fib(i);
printf("%d\n",c);
}
}
WAP to calculate sum of series using recursion.
WAP to calculate sum of series using recursion.
#include<stdio.h>
int sumsq(int n)
{
if(n==0)
return 0;
else
return n*n+sumsq(n-1);
}
int main()
{
int n;
printf("enter number:\n");
scanf("%d",&n);
printf("%d",sumsq(n));
}
Page updated
Google Sites
Report abuse