Palindrome of String

##############Palindrome of String ##############


#include <stdio.h>
#include <string.h>

int main(){
    char string1[20];
    int i, length;
    int flag = 0;
   
    printf("Enter a string:");
    scanf("%s", string1);
   
    length = strlen(string1);
   
    for(i=0;i < length ;i++){
        if(string1[i] != string1[length-i-1]){
            flag = 1;
            break;
   }
}
   
    if (flag) {
        printf("%s is not a palindrome", string1);
    }   
    else {
        printf("%s is a palindrome", string1);
    }
    return 0;
}

Sum of Diagonal of matrix

    #include <stdio.h>

    void main ()

    {

         static int array[10][10];

        int i, j, m, n, a = 0, sum = 0;


        printf("Enetr the order of the matix \n");

        scanf("%d %d", &m, &n);

         if (m == n )

        {

             printf("Enter the co-efficients of the matrix\n");

            for (i = 0; i < m; ++i)

            {

                for (j = 0; j < n; ++j)

                {

                    scanf("%d", &array[i][j]);

                }

            }

            printf("The given matrix is \n");

            for (i = 0; i < m; ++i)

            {

                for (j = 0; j < n; ++j)

                {

                    printf(" %d", array[i][j]);

                }

                printf("\n");

            }

             for (i = 0; i < m; ++i)

            {

                sum = sum + array[i][i];

                a = a + array[i][m - i - 1];

            }

            printf("\nThe sum of the main diagonal elements is = %d\n", sum);

            printf("The sum of the off diagonal elements is   = %d\n", a);

         }

         else

            printf("The given order is not square matrix\n");

     }

Transpose Of Matrix

#include <stdio.h>

int main()
{
    int a[10][10], transpose[10][10], r, c, i, j;
    printf("Enter rows and columns of matrix: ");
    scanf("%d %d", &r, &c);

    // Storing elements of the matrix
    printf("\nEnter elements of matrix:\n");
    for(i=0; i<r; ++i)
        for(j=0; j<c; ++j)
        {
            printf("Enter element a%d%d: ",i+1, j+1);
            scanf("%d", &a[i][j]);
        }

    // Displaying the matrix a[][] */
    printf("\nEntered Matrix: \n");
    for(i=0; i<r; ++i)
        for(j=0; j<c; ++j)
        {
            printf("%d  ", a[i][j]);
            if (j == c-1)
                printf("\n\n");
        }

    // Finding the transpose of matrix a
    for(i=0; i<r; ++i)
        for(j=0; j<c; ++j)
        {
            transpose[j][i] = a[i][j];
        }

    // Displaying the transpose of matrix a
    printf("\nTranspose of Matrix:\n");
    for(i=0; i<c; ++i)
        for(j=0; j<r; ++j)
        {
            printf("%d  ",transpose[i][j]);
            if(j==r-1)
                printf("\n\n");
        }

    return 0;
}

Linear search

///////////////////////////////Program for Linear Search using 1D///////////////////////

#include <stdio.h>

int main()
{
   int array[20], search, c, n;

   printf("Enter the number of elements in array\n");
   scanf("%d",&n);

   printf("Enter %d integer(s)\n", n);

   for (c = 0; c < n; c++)
      scanf("%d", &array[c]);

   printf("Enter the number to search\n");
   scanf("%d", &search);

   for (c = 0; c < n; c++)
   {
      if (array[c] == search)     /* if required element found */
      {
         printf("%d is present at location %d.\n", search, c+1);
         break;
      }
   }
   if (c == n)
      printf("%d is not present in array.\n", search);

   return 0;
}

GCD and LCM using Function

Write Program to calculate  GCD and LCM of two numbers using Function


#include<stdio.h>
void gcd(int,int);
void lcm(int,int);

int main()
{
    int a,b;

    printf("Enter two numbers: \t");
    scanf("%d %d",&a,&b);

    lcm(a,b);
    gcd(a,b);


    return 0;
}

//function to calculate l.c.m
void lcm(int a,int b)
{
    int m,n;

    m=a;
    n=b;

    while(m!=n)
    {
        if(m<n)
            m=m+a;
        else
            n=n+b;
    }

    printf("\n L.C.M of %d  &  %d is %d",a,b,m);
}

//function to calculate g.c.d
void gcd(int a,int b)
{
    int m,n;

    m=a;
    n=b;

    while(m!=n)
    {
        if(m>n)
            m=m-n;
        else
            n=n-m;
    }

    printf("\n G.C.D of %d  &  %d is %d",a,b,m);
}


========================================

Program for Fibonacci series using Recursion

#include <stdio.h>

int fibo(int);



int main()

{

    int num;

    int result;



    printf("Enter the nth number in fibonacci series: ");

    scanf("%d", &num);

    if (num < 0)

    {

        printf("Fibonacci of negative number is not possible.\n");

    }

    else

    {

        result = fibo(num);

        printf("The %d number in fibonacci series is %d\n", num, result);

    }

    return 0;

}

int fibo(int num)

{

    if (num == 0)

    {

        return 0;

    }

    else if (num == 1)

    {

        return 1;

    }

    else

    {

        return(fibo(num - 1) + fibo(num - 2));

    }

}

PATTERNS PROGRAMMING

        1       
      1 2 1     
    1 2 3 2 1   
  1 2 3 4 3 2 1 
1 2 3 4 5 4 3 2 1

#include<stdio.h> 

int main()
{
    int i, j;
    for(i=1;i<=5;i++)
    {
      for(j=5;j>i;j--)
        printf("  ");
      for(j=1;j<=i;j++)
          printf("%d ",j);
      for(j=j-2;j>=1;j--)
          printf("%d ",j);
      printf("\n");
    }
    return 0;
}
 

 ============================================================================

12345
1234
123
12
1

#include <stdio.h>



int main()

{

    int i, j;

    for(i=5;i>=1;i--)

    {

        for(j=1;j<=i;j++)

        {

            printf("%d",j);

        }

        printf("\n");

    }



    return 0;

}



===================================================================================

5
45
345
2345
12345





#include <stdio.h>



int main()

{

    int i, j;

    for(i=5;i>=1;i--)

    {

        for(j=i;j<=5;j++)

        {

            printf("%d",j);

        }

        printf("\n");

    }



    return 0;

}

 ===============================================================================

12      21
123    321
1234  4321
1234554321

#include<stdio.h>

int main()
{
  int i,j,k;
  for(i=1;i<=5;i++)
  {
    for(j=1;j<=5;j++)
    {
      if(j<=i)
        printf("%d",j);
      else
        printf(" ");
    }
    for(j=5;j>=1;j--)
    {
      if(j<=i)
        printf("%d",j);
      else
        printf(" ");
    } 
    printf("\n");
  }
  return 0;
} 

============================================================================

*000*000*
0*00*00*0
00*0*0*00
000***000

int main()
{
  int i,j,k;
  for(i=1;i<=4;i++)
  {
    for(j=1;j<=9;j++)
    {
      if(j==i || j==5 || 10-j==i)
        printf("*");
      else
        printf("0");
    }
    printf("\n");
  }
  return 0;
} 

==================================================================== 

      1
    2   2
  3       3
4           4
  3       3
    2   2
      1




int main()
{
  int i,j,k;
  for(i=1;i<=4;i++)
  {
    for(j=4;j>=(i-1)*2-1;j--)
      printf(" ");
    printf("%d",i);
    for(j=2;j<=(i-1)*4;j++)
      printf(" ");
    if(i>1)
      printf("%d",i);
    printf("\n");
  }
  for(i=3;i>=1;i--)
  {
    for(j=4;j>=(i-1)*2-1;j--)
      printf(" ");
    printf("%d",i);
    for(j=2;j<=(i-1)*4;j++)
      printf(" ");
    if(i>1)
      printf("%d",i);
    printf("\n");
  }
  return 0;  
}

=====================================================================

A
AB
ABC
ABCD
ABCDE


#include <stdio.h>

int main()
{
    int i, j;
    for(i=1;i<=5;i++)
    {
        for(j=1;j<=i;j++)
        {
            printf("%c",'A' + j-1);
        }
        printf("\n");
    }

    return 0;
}
 

===========================================================================

ABCDE
ABCD
ABC
AB
A


#include <stdio.h>

int main()
{
    int i, j;
    for(i=5;i>=1;i--)
    {
        for(j=1;j<=i;j++)
        {
            printf("%c",'A' + j-1);
        }
        printf("\n");
    }

    return 0;
}

===================================================================================

EDCBA
DCBA
CBA
BA
A


#include <stdio.h>

int main()
{
    int i, j;
    for(i=5;i>=1;i--)
    {
        for(j=i;j>=1;j--)
        {
            printf("%c",'A'-1 + j);
        }
        printf("\n");
    }

    return 0;
}

================================================================================

A
BB
CCC
DDDD
EEEEE


#include <stdio.h>

int main()
{
    int i, j;
    for(i=1;i<=5;i++)
    {
        for(j=1;j<=i;j++)
        {
            printf("%c",'A'-1 + i);
        }
        printf("\n");
    }

    return 0;
} 

======================Thank You For Visiting Here ===================================