(1) PASCAL’S TRIANGLE

#include <stdio.h>
int main()
{
int i,n,c,s,num;
printf("Enter a number : ");
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(s=n;s>i;s--)
{
printf(" ");
}
num=1;
for(c=0;c<=i;c++)
{
printf("%d ",num);
num = num*(i-c)/(c+1);
}
printf("\n");
}
}

(2) FLOYD’S TRIANGLE

#include <stdio.h>
int main()
{
int i,n,c,s,num=1;
printf("Enter a number : ");
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(c=0;c<=i;c++)
{
printf("%d ",num++);
}
printf("\n");
}
}
 (3) PRIME NUMBER (or) NOT:

#include <stdio.h>
int main()
{
int n,i,flag=0;
printf("Enter a number : ");
scanf("%d",&n);
if(n==1)
printf("Given number is either prime or composite");
else
{
for(i=2;i<=n/2;i++)
{
if(n%i==0)
flag=1;
break;
}
if(flag == 0)
printf("Given number is a prime number");
else
printf("Given number is not a prime number");
}
}

(4)(a) FIBONACCI SERIES IN NOMAL METhod :

#include<stdio.h>
void main()
{
int a=0,b=1,c,i,n;
printf("Enter n value : ");
scanf("%d",&n);
for(i=0;i<n;i++)
{
c=a+b;
printf("%d ",a);
a=b;
b=c;
}
}
(4)(b) FIBONACCI SERIES using recursion:

#include<stdio.h>
int fib(int x);
int main()
{
int i,n;
printf("Enter n value : ");
scanf("%d",&n);
for(i=0;i<n;i++)
{
printf("%d ",fib(i));
}
}

int fib(int x)
{
if(x<=1)
return x;
return fib(x-1)+fib(x-2);
}

(5)(a) FACTORIAL USING RECURSION :

#include<stdio.h>
int factorial(int x);
int main()
{
int n;
printf("Enter n value : ");
scanf("%d",&n);
printf("%d ",factorial(n));
}

int factorial(int x)
{
if(x >= 1)
return x*factorial(x-1);
else
return 1;
}
(5)(b) FACTORIAL USING FOR LOOP

#include<stdio.h>
int main()
{
int n,i,fact=1;
printf("Enter n value : ");
scanf("%d",&n);
for(i=1;i<=n;i++)
{
fact = fact*i;
}
printf("%d",fact);
}

(6)(a) SWAPPING OF TWO NUMBERS :

#include<stdio.h>
int main()
{
int a,b,t;
printf("Enter a and b values : ");
scanf("%d %d",&a,&b);
printf("Before swapping : %d %d\n",a,b);
t = a;
a = b;
b = t;
printf("After swapping : %d %d\n",a,b);
}

(6)(b) SWAPPING OF TWO NUMBERS WITHOUT THIRD VARIABLE:

#include<stdio.h>
int main()
{
int a,b,t;
printf("Enter a and b values : ");
scanf("%d %d",&a,&b);
printf("Before swapping : %d %d\n",a,b);
a = a+b;
b = a-b;
a = a-b;
printf("After swapping : %d %d\n",a,b);
}
(7)(a) REVERSE OF STRING :

#include<stdio.h>
void main()
{
int i,l=0,j=0;
char c[100];
printf("Enter a string :");
scanf("%s",c);
printf("%s\n",c);
while(c[j] != '\0')
{
l++;
j++;
}
for(i=l;i>=0;i--)
{
printf("%c",c[i]);
}
}

(7)(b) REVERSE OF STRING USING LIBRARY FUNCTION

#include<stdio.h>
#include<string.h>
void main()
{
char s[20];
printf("Enter a string to reverse\n");
scanf("%s",s);
printf("Reverse of the string: %s\n", strrev(s));
}

(8)(a) PALINDROME (or) NOT :

#include<stdio.h>
int main()
{
long int n,a,b=0,c;
printf("Enter a number : ");
scanf("%ld", &n);
c = n;
while(n > 0)
{
a = n%10;
b = b*10+a;
n = n/10;
}
if(c == b)
printf("palindrome\n");
else
printf("not a palindrome");
}
(8)(b) STRING PALINDROME (or) NOT :
#include<stdio.h>
#include <string.h>

int main()
{
char s[1000];
int i,n,c=0;

printf("Enter the string : ");

scanf("%s",s);
n=strlen(s);

for(i=0;i<n/2;i++)
{
if(s[i]==s[n-i-1])
c++;
}

if(c==i)
printf("string is palindrome");
else
printf("string is not palindrome");

return 0;
}

(9) ARMSTRONG NUMBER (OR) NOT

#include<stdio.h>
#include<math.h>
int main()
{
int n,c=0,a,b,x,sum=0;
printf("Enter a number : ");
scanf("%d",&n);
a = x = n;
while(n>0)
{
n = n/10;
c++;
}
while(a>0)
{
b = a%10;
sum =sum+pow(b,c);
a = a/10;
}
if(x == sum)
printf("arm strong number");
else
printf("not a armstrong number");
}
(10) PATTERN AND PARAMIDS

#include<stdio.h>
int main()
{
int n,i,j,k;
printf("Enter number of rows : ");
scanf("%d",&n);
for(i=0;i<n;i++,printf("\n"))
{
for(j=n;j>i;j--)
{
printf(" ");
}
for(k=0;k<=i;k++)
{
printf("* ");
}
}
}

(11) EVEN OR ODD PROGRAM :

#include<stdio.h>
int main()
{
int n;
printf("Enter a number : ");
scanf("%d",&n);
if(n%2 == 0)
printf("Given number is even number");
else
printf("Given number is odd number");
}

By 4163.