1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31

#include "stdio.h"
#include "conio.h"
 
int a[5],b[5];
 
void accept()
{
   int j;
   printf("Enter the list \n");
   for(j=0;j=0;j--,i++)
   {
     b[i]=a[j];
   }
}
 
void display()
{
   int j;
   printf("The list in reverse is \n");
   for(j=0;j<5;j++)
   printf("%d ",b[j]);
   printf("\n");
}
 
void main()
{
   accept();
   reverse();
   display();
getch();
}

Output:

Enter the list
5
4
3
2
1
The list in reverse is
1 2 3 4 5

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24

#include "conio.h"
#include "stdio.h"
 
void main()
{
  int num[10],low,i=0,j=1;
  printf("\nPlease provide 10 numbers to find lowest one ");
  for(;i<10;i++,j++)
  {
  printf("\nEnter number %d : ",j);
  scanf("%d",&num[i]);
  }
  low=num[0];
  i=0,j=1;
//finding greatest number
  for(;inum[i+1])
    {
    low=num[i+1];
    }
  }
//displaying lowest value
  printf("\nThe lowest number is : %d",low);
getch();
}

Output:

Please provide 10 numbers to find lowest one
Enter number 1 : 45
Enter number 2 : 63
Enter number 3 : 85
Enter number 4 : 77
Enter number 5 : 21
Enter number 6 : 68
Enter number 7 : 79
Enter number 8 : 82
Enter number 9 : 101
Enter number 10 : 22
The lowest number is : 21

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26

#include "conio.h"
#include "stdio.h"
 
void main()
{
  int num[10],grt,i=0,j=1;
  printf("\nPlease provide 10 numbers to find largest one ");
  for(;i<10;i++,j++)
  {
  printf("\nEnter number %d : ",j);
  scanf("%d",&num[i]);
  }
  grt=num[0];
  i=0,j=1;
//finding largest number
  for(;i<9;i++)
  {
    if(grt<num[i+1])
    {
    grt=num[i+1];
    }
  }
//displaying largest value
  printf("\nThe largest number is : %d",grt);
getch();
}

Output:

Please provide 10 numbers to find largest one
Enter number 1 : 41
Enter number 2 : 75
Enter number 3 : 76
Enter number 4 : 40
Enter number 5 : 55
Enter number 6 : 59
Enter number 7 : 48
Enter number 8 : 54
Enter number 9 : 71
Enter number 10 : 48
The largest number is : 76

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24

#include "stdio.h"
#include "conio.h"
void main()
{
 float a[100],sum=0,x;
 int n,i;
 clrscr();
 printf("Enter the degree of the polynomial:");
 scanf("%d",&n);
 printf("Enter the coefficients into the array:");
 for(i=n;i>=0;i--)
 {
  scanf("%f",&a[i]);
 }
 printf("Enter the value of x:");
 scanf("%f",&x);
 for(i=n;i>0;i--)
 {
  sum=(sum+a[i])*x;
 }
 sum=sum+a[0];
 printf("\nValue of the polynomial is =%f",sum);
 getch();
}

Consider the polynomial 3x^4+2x^3+x^2+x+2 where x=2, then the output will be as follows,
Output:

Enter the degree of the polynomial:
4
Enter the coefficients into the array:
3
2
1
1
2
Enter the value of x:
2
Value of the polynomial is:72.000000

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40

#include<stdio.h>
#include<conio.h>
void main()
{
 int  i,j,gen[4],rem[4],frl=8,genl=4,k,k1,fr[11];
 clrscr();
 printf("enter frame:");
 for(i=0;i<frl;i++)
{ 
scanf("%d",&fr[i]);
} 
for(i=frl;i<11;i++)
{ 
fr[i]=0;
}
printf("enter generator:");
 for(i=0;i<4;i++)
 scanf("%d",&gen[i]);
  for(k=0;k<frl;k++)
  {
   if(fr[k]==1)
   {
   k1=k;
    for(i=0,j=k;i<genl;i++,j++)
    {
     rem[i]=fr[j]^gen[i];
    }
 
    for(i=0;i<genl;i++)
    {
	  fr[k1]=rem[i];
     k1++;
    }
   }
    }
      printf("\nremainder is: ");
      for(i=0;i<4;i++)
     printf("%d",rem[i]);
     getch();
}

OUTPUT:
enter frame:
1 0 1 1 0 1 0 0
enter generator:
1 0 1 0
remainder is:
0 0 1 0

Logic: The program follows the mathematical cosine series, where cosine of the entered radian angle ? is,

The program asks the user to enter the Angle x° . Also it asks for the number of iterations ‘n’ that the cosine loop should iterate. As the iteration increases, the accuracy boosts up. After the desired loop, the resultant gets printed out. Similar algorithm can be set to find the Sine value of the given number.

#include<stdio.h>
#include<math.h>
void main()
{
float pow = 2.0, nr, dr = 1.0, x1, sum;
int i = 1,n,s = -1,x;
clrscr();
printf(“\n\n\t ENTER THE ANGLE…: “);
scanf(“%d”, &x);
x1 = 3.142 * (x / 180.0);
sum = 1.0;
nr = x1*x1;
printf(“\n\t ENTER THE NUMBER OF TERMS…: “);
scanf(“%d”,&n);
while(i<=n)
{
dr = dr * pow * (pow – 1.0);
sum = sum + (nr / (dr * s));
s = s * (-1);
pow = pow + 2.0;
nr = nr * x1 * x1;
i++;
}
printf(“\n\t THE SUM OF THE COS SERIES IS..: %0.3f”, sum);
getch();
}
Download exe and source code here.

Logic: The program follows the mathematical sine series, where cosine of the entered radian angle x  is,

The program asks the user to enter the Angle x° . Also it asks for the number of iterations ‘n’ that the sine loop should iterate. As the iteration increases, the accuracy boosts up. After the desired loop, the resultant gets printed out. Similar algorithm can be set to find the Cosine value of the given number.

#include<stdio.h>
#include<math.h>
void main()
{
int i = 2, n, s = 1, x, pwr = 1, dr;
float nr = 1, x1, sum;
clrscr();
printf(“\n\n\t ENTER THE ANGLE…: “);
scanf(“%d”, &x);
x1 = 3.142 * (x / 180.0);
sum = x1;
printf(“\n\t ENTER THE NUMBER OF TERMS…: “);
scanf(“%d”, &n);
while(i <= n)
{
pwr = pwr + 2;
dr = dr * pwr * (pwr – 1);
sum = sum + (nr / dr) * s;
s = s * (-1);
nr = nr * x1 * x1;
i+= 2;
}
printf(“\n\t THE SUM OF THE SINE SERIES IS..: %0.3f”,sum);
getch();
}
Download exe and source code here.

Logic : The program asks the user to enter the number, to find out the sum of its digits. Sets the flag ‘sum’ to zero, implies that sum till now is Nil. Stores the entered number as Num. The while loop slices the number into digits. In each iteration, the current digit gets added up to the flag ‘Sum’ . Finally it prints out the number.

The same logic can be implemented for other programs too, where the situation comes to slice up the given number, as in the case of  Reversing the number.

#include<stdio.h>
#include<math.h>
void main()
{
long int num,sum = 0,dig;
clrscr();
printf(“\n\n\t ENTER A NUMBER…: “);
scanf(“%ld”,&num);
while(num>0)
{
dig = num % 10;
sum = sum + dig;
num = num / 10;
}
printf(“\n\t SUM OF DIGITS IS…: %ld”, sum);
getch();
}

Download exe and source code here.

Logic :  The program expects the user to enter the number to check if palindrome. The entered number is reversed and stored in another variable. Finally the reversed number is checked for equality with the entered number. If they are the same, then it is a palindrome.

A slight change in the code can check if the entered string is a palindrome.

#include<stdio.h>
#include<math.h>
void main()
{
long int n, num, rev = 0, dig;
clrscr();
printf(“\n\n\t ENTER A NUMBER…: “);
scanf(“%ld”, &num);
n = num;
while(num>0)
{
dig = num % 10;
rev = rev * 10 + dig;
num = num / 10;
}
if (n == rev)
printf(“\n\t GIVEN NUMBER IS A PALINDROME”);
else
printf(“\n\t GIVEN NUMBER NOT A PALINDROME”);
getch();
}
Download exe and source code here.