C-Tutorial: C PROGRAMS

Latest

Showing posts with label C PROGRAMS. Show all posts
Showing posts with label C PROGRAMS. Show all posts

Sunday, 8 December 2019

sine series 1-x^2/2!+x^4/4!-x^6/6!+.....

Sunday, December 08, 2019 0

/* Program for sine series 1-x^2/2!+x^4/4!-x^6/6!+..... */

#include<stdio.h>
#include<conio.h>
#include<math.h>

void main()
{
    double x, sum = 1, m;
      int n, i, j, fact, y=2, term=1;

    clrscr();

    printf("\n Enter x value: ");
    scanf("%lf",&x);
   printf("\n Enter no.of terms: ");
   scanf("%d",&n);

    for (i = 1; i < n; i++) {
        fact = 1;
        for (j = 1; j <= y; j++) {
            fact = fact * j;
        }
        term = term * (-1);
        m = term * pow(x, y) / fact;
        sum = sum + m;
        y += 2;
    }

    printf("\n Sine series: %.2lf",sum);

   getch();
}

Read More

program to convert hexadecimal to decimal

Sunday, December 08, 2019 0

/* program to convert number from hexadecimal to decimal*/

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

void main()
{
    char hex[32]={0};
    int  dec = 0, i, cnt = 0, dig;
    clrscr();
    printf("Enter hexa decimal value: ");
    gets(hex);
    for(i=(strlen(hex)-1);i>=0;i--)
    {
        switch(hex[i])
        {
            case 'A':
                dig=10; break;
            case 'B':
                dig=11; break;
            case 'C':
                dig=12; break;
            case 'D':
                dig=13; break;
            case 'E':
                dig=14; break;
            case 'F':
                dig=15; break;
            default:
                dig=hex[i]-48;
        }
        dec= dec + (dig)*pow((double)16,(double)cnt);
        cnt++;
    }
    printf("DECIMAL value is: %d", dec);
    getch();
}

Read More

Program for convert binary to decimal

Sunday, December 08, 2019 0

/*  Program for convert binary to decimal */

#include <stdio.h>
#include <math.h>

void main()
{
    long int n;
    int dec = 0, temp = 0, r;

    clrscr();

    printf("Enter a binary number: ");
    scanf("%ld", &n);

    while (n!=0)
    {
        r = n % 10;
        n = n / 10;
        dec = dec + r * pow(2,temp);
        temp++;
    }

    printf("\n\n Equivalent decimal number is: %d", dec);

   getch();
}

Read More

Program for convert octal to decimal

Sunday, December 08, 2019 0

/*  Program for convert octal to decimal */

#include <stdio.h>
#include <math.h>

void main()
{
    long int n;
    int dec = 0, temp = 0, r;

    clrscr();

    printf("Enter a octal number: ");
    scanf("%ld", &n);

    while (n!=0)
    {
        r = n % 10;
        n = n / 10;
        dec = dec + r * pow(8,temp);
        temp++;
    }

    printf("\n\n Equivalent decimal number is: %d", dec);

   getch();
}

Read More

convert decimal to binary / octal / hexadecimal

Sunday, December 08, 2019 0

/* Program for convert decimal to binary / octal / hexadecimal */

#include <stdio.h>
#include <conio.h>

void main()
{
long n;
int i=0,a[20],b;

clrscr();

printf("\n Enter a decimal value: ");
scanf("%ld", &n);
printf("\n Enter base value (2, 8, 16): ");
scanf("%d", &b);

while(n!=0)
{
a[i] = n % b;
n = n/b;
i++;
}

if(b==2) {
printf("\n After conversion binary value: ");
}
else if(b==8) {
printf("\n After conversion octal value: ");
}
else {
printf("\n After conversion hexadecimal value: ");
}

for(i=i-1;i>=0;i--)
printf("%d",a[i]);

getch();
}

Read More

program for histogram given array elements

Sunday, December 08, 2019 0

/* program printing stars equal to each element in the list */

#include<stdio.h>
#include<conio.h>

void main()
{
int a[20], i, j, n;
clrscr();

printf("\n Enter the how many array elements: ");
scanf("%d",&n);
printf("\n Enter %d elements: ",n);
for(i=0;i<=n-1;i++)
scanf("%d",&a[i]);

for(i=0;i<n;i++)
{
          printf("\n a[%d] = %d : ",i,a[i]);
          for(j=0;j<a[i];j++)
          printf(" *");
}

getch();

}





Read More

Array order reversal without using second array

Sunday, December 08, 2019 0

/*   Array order reversal without using second array */

#include<stdio.h>

void main()
{
   int arr[50], i, j, num, temp;

  clrscr();

   printf("\n Enter number of elements  to be entered to the array: ");
   scanf("%d", &num);
   printf("Enter %d number of elements into array arr", num);  
   for (i = 0; i < num; i++) {
      scanf("%d", &arr[i]);
   }

    j = i - 1;           
   i = 0;    
 
   while (i < j) {
      temp = arr[i];
      arr[i] = arr[j];
      arr[j] = temp;
      i++;                
      j--;                 
   }

    printf("\n Resultant array after reversal : ");
   for (i = 0; i < num; i++) {
      printf("%d \t", arr[i]);
   }

getch();
 }

Read More

sum of factorials in between range

Sunday, December 08, 2019 0

/* sum of factorials in between m and n */

#include<stdio.h>
#include<conio.h>

void main()
{
int i, j, m, n, fact=1, sum=0;
clrscr();
printf("\n Enter the starting and ending point :");
scanf("%d%d", &m, &n);
for(i=m ;i<=n ;i++)
{
fact=1;
for(j=1; j<=i; j++)
{
fact = fact * j ;
}
sum = sum + fact;
}
printf("\n The sum of factorials between %d and %d is: %d", m, n, sum);
getch();
}

Read More

PRIME NUMBER SERIES IN BETWEEN RANGE

Sunday, December 08, 2019 0

/*  PRIME NUMBER SERIES IN BETWEEN RANGE */

#include<stdio.h>
#include<conio.h>

void main()
{
int i,j,m,n,c=0;
clrscr();
printf("\n Enter the starting point  and ending point : ");
scanf("%d%d",&m,&n);
printf("\n The prime number in between %d and %d",m,n);
for(i=m;i<=n;i++)
{   c=0;
for(j=1;j<=i;j++)
{
if(i%j == 0)
c++
}
printf(" %2d",i);
}
getch();
}

Read More

Program for +ve count, -ve count, +ve sum and -ve sum

Sunday, December 08, 2019 0

/* Program for +ve count, -ve  count, +ve sum and -ve sum */

#include<stdio.h>
#include<conio.h>

void main()
{
int i,a[50],n, pc=0, nc=0, psum=0, nsum=0;

clrscr();

printf("\n Enter the n value: ");
scanf("%d",&n);
printf("\n Enter the %d array elements: ",n);
for(i=0 ;i<=n-1; i++)
scanf("%d",&a[i]);

for(i=0; i<=n-1; i++)
{
if(a[i] >= 0)
{
pc++;
psum = psum + a[i];
}
else
{
nc++;
nsum = nsum + a[i];
}
}

printf("\n positive count = %d, negitive_count=%d, positive_summ=%d, negtive_sum=%d", pc, nc, psum, nsum);

getch();
}

Read More

Factors between 1 to 100 for a given number

Sunday, December 08, 2019 0

/* Factors between 1 to 100 for given number */

#include<stdio.h>
#include<conio.h>

void main()
{
int n, i;
clrscr();
printf("\n Enter a number: ");
scanf("%d",&n);
printf("\n The factors of %d is: \n", n);
for(i=1;i<=100;i++)
{
if(n%i==0)
printf("\t %d", i);
}
getch();
}

Read More

Finding and print 2nd largest element in the array

Sunday, December 08, 2019 0

/*  Program for 2nd largest element in the array */

#include<stdio.h>
#include<conio.h>

void main()
{
int i,n,a[30],max1,max2;
clrscr();
printf("\n Enter no.of elements: ");
scanf("%d",&n);
printf("\n Enter %d array elements : ",n);
for(i=0;i<=n-1;i++)
scanf("%d",&a[i]);
max1 = max2 = a[0];
for(i=0;i<=n-1;i++)
{
if(a[i]>max1)
{
max2=max1;
max1=a[i];
}
else
if(a[i] > max2 && a[i] < max1)
{
max2=a[i];
}
}
printf("\n Second largest number = %d",max2);
getch();
}

Read More

Series 1-3+5-7+9-11 .....

Sunday, December 08, 2019 0

/*    1-3+5-7+9-11 ..... */

#include<stdio.h>
#include<conio.h>

void main()
{
int i, n, sum=0,k=-1;
clrscr();
printf("\n Enter the no.of terms: ");
scanf("%d",&n);
for(i=1;i<=2*n;i=i+2)
{
k=-k;
sum= sum + (k*i);
}
printf("\n Sum of %d terms: %d", n, sum);
getch();
}

Read More

Friday, 20 January 2017

PROGRAM FOR PRINT ASCII VALUES

Friday, January 20, 2017 0
/*  PROGRAM FOR PRINT ASCII VALUES */


#include<stdio.h>
#include<conio.h>

void main()
{
    int i;
    clrscr();
    for(i=0;i<=255;i++)
         printf("ASCII value of character %c: %d \n",i,i);
    getch();
}
Read More

Floyd’s Triangle in C

Friday, January 20, 2017 0
/*  Floyd’s Triangle in C  */



#include<stdio.h>
#include<conio.h>

void main()
{
  int i,j,n,k=1;
  clrscr();
  printf("Enter the number: ");
  scanf("%d",&n);
  printf("FLOYD'S TRIANGLE\n\n");
  for(i=1;i<=n;i++)
 {
      for(j=1;j<=i;j++,k++)
           printf(" %d",k);
      printf("\n");
  }
  getch();
}

Sample output:
Enter the number: 5
FLOYD'S TRIANGLE

 1
 2 3
 4 5 6
 7 8 9 10
 11 12 13 14 15
Read More

GIVEN NUMBER IS ARMSTRONG NUMBER OR NOT

Friday, January 20, 2017 0
/* THE GIVEN NUMBER IS ARMSTRONG NUMBER OR NOT */


#include<stdio.h>
#include<conio.h>

void main()
{
    int n,a,sum=0,temp;
    clrscr();
    printf("Enter a number: ");
    scanf("%d",&n);
    temp=n;
    while(n>0)
   {
         a=n%10;
         sum=sum+(a*a*a);
         n=n/10;
    }
    if(sum==temp)
         printf("%d is an Armstrong number",temp);
    else
         printf("%d is not an Armstrong number",temp);
   getch();
}

Sample output:
Enter a number: 153
153 is an Armstrong number

EXAMPLE 1: 153
TOTAL DIGITS IN 153 IS 3
AND 1^3 + 5^3 + 3^3 = 1 + 125 + 27 = 153
Read More

GIVEN NUMBER IS PERFECT NUMBER OR NOT

Friday, January 20, 2017 0
/* THE GIVEN NUMBER IS PERFECT NUMBER OR NOT */


#include<stdio.h>
#include<conio.h>

void main()
{
  int n,i=1,sum=0;
  clrscr();
  printf("Enter a number: ");
  scanf("%d",&n);
  while(i<n)
{
      if(n%i==0)
     {
           sum=sum+i;
     }
          i++;
  }
  if(sum==n)
      printf("%d is a perfect number",i);
  else
      printf("%d is not a perfect number",i);
getch();
}

EXAMPLES:
For example 6 is perfect number since divisor of 6 are 1, 2 and 3.  Sum of its divisor is
1 + 2+ 3 =6
Next perfect number is 28 since 1+ 2 + 4 + 7 + 14 = 28
Some more perfect numbers: 496, 8128
Read More

THE GIVEN NUMBER IS STRONG NUMBER OR NOT

Friday, January 20, 2017 0
/* PROGRAM FOR THE GIVEN NUMBER IS STRONG NUMBER OR NOT */


#include<stdio.h>
#include<conio.h>

void main()
{
int sum=0,i,n,a,fact,temp;
clrscr();
printf("\n Enter a number: ");
scanf("%d",&n);
temp=n;
while(n>0)
{
a=n%10;
fact=1;
for(i=1;i<=a;i++)
{
fact=fact*i;
}
sum=sum+fact;
n=n/10;
}
if(sum==temp)
printf("\n The given number is strong number %d",temp);
else
printf("\n The given number is not a strong number %d",temp);
getch();
}

Example:    A number is called strong number if sum of the factorial of its digit is equal to number itself. For example: 145 since
1! + 4! + 5! = 1 + 24 + 120 = 145
Read More

Sunday, 16 October 2016

DIAGONAL SUM OF A MATRIX

Sunday, October 16, 2016 0
/* THE DIAGONAL SUM OF A MATRIX */


#include<stdio.h>
#include<conio.h>
main()
{
int m,n,i,j,a[5][5],dsum=0;
clrscr();
printf("\n Enter the row and column size:");
scanf("%d%d",&m,&n);
if(m!=n)
{
printf("\n The diagonal sum of matrix is not possible");
}
else
{
printf("\n Enter the 'A' Matrix elements is:");
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
scanf("%d",&a[i][j]);
}
}
printf("\n The diagonal sum of 'A' matrix is:");
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
if(i==j)
dsum=dsum+a[i][j];
}
}
}
printf("%d",dsum);
getch();
}
Read More

TRANSPOSE OF GIVEN MATRIX

Sunday, October 16, 2016 0
/* TRANSPOSE OF GIVEN MATRIX */


#include<stdio.h>
#include<conio.h>
main()
{
int m,n,i,j,a[5][5];
clrscr();
printf("\n Enter the row and column size:");
scanf("%d%d",&m,&n);
printf("\n Enter the 'A' Matrix elements is:");
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
scanf("%d",&a[i][j]);
}
}
printf("\n The Transpose of given matrix is:");
for(i=0;i<n;i++)
{
printf("\n");
for(j=0;j<m;j++)
{
printf("%3d",a[j][i]);
}
}
getch();
}
Read More