C Language

Write a C program to convert a Roman numeral to its decimal equivalent.

2011-05-20T04:07:00.000-07:00

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

void main()
{

int *a,len,i,j,k;
char *rom;

clrscr();

printf(“Enter the Roman Numeral:”);
scanf(“%s”,rom);

len=strlen(rom);

for(i=0;i<len;i++)
{
if(rom[i]==’I')
a[i]=1;
else if(rom[i]==’V')
a[i]=5;
else if(rom[i]==’X')
a[i]=10;
else if(rom[i]==’L')
a[i]=50;
else if(rom[i]==’C')
a[i]=100;
else if(rom[i]==’D')
a[i]=500;
else if(rom[i]==’M')
a[i]=1000;
else
{
printf(“\nInvalid Value”);
getch();
exit(0);
}
}
k=a[len-1];
for(i=len-1;i>0;i–)
{
if(a[i]>a[i-1])
k=k-a[i-1];
else if(a[i]==a[i-1] || a[i]<a[i-1])
k=k+a[i-1];
}
printf(“\nIts Decimal Equivalent is:”);
printf(“%d”,k);
getch();
}

Write a C program to find the 2’s complement of a binary number.

2011-05-20T04:04:00.000-07:00

2’s complement of a number is obtained by scanning it from right to left and complementing all the bits after the first appearance of a 1. Thus 2’s complement of 11100 is 00100. Write a C program to find the 2’s complement of a binary number.

Program:

clrscr();
printf("Enter the binary number");
gets(a);
for(i=0;a[i]!='\0'; i++)
{
if (a[i]!='0' && a[i]!='1')
{
printf("The number entered is not a binary number. Enter the correct number");
exit(0);
}
}
complement(a);
getch();
}
void complement (char *a)
{
int l, i, c=0;
char b[16];
l=strlen(a);
for (i=l-1; i>=0; i--)
{
if (a[i]=='0')
b[i]='1';
else
b[i]='0';
}
for(i=l-1; i>=0; i--)
{
if(i==l-1)
{
if (b[i]=='0')
b[i]='1';
else
{
b[i]='0';
c=1;
}
}
else
{
if(c==1 && b[i]=='0')
{
b[i]='1';
c=0;
}
else if (c==1 && b[i]=='1')
{
b[i]='0';
c=1;
}
}
}
b[l]='\0';
printf("The 2's complement is %s", b);
}
/*
Output:

Enter the binary number101
The 2's complement is 011

Write a C program to read in two numbers, x and n, and then compute the sum of this geometric progression: 1+x+x2+x3+………….+xn

2011-05-20T04:02:00.000-07:00

Write a C program to read in two numbers, x and n, and then compute the sum of this geometric progression:
1+x+x2+x3+………….+xn
For example: if n is 3 and x is 5, then the program computes 1+5+25+125.
Print x, n, the sum
Perform error checking. For example, the formula does not make sense for negative exponents – if n is less than 0. Have your program print an error message if n<0, then go back and read in the next pair of numbers of without computing the sum. Are any values of x also illegal ? If so, test for them too.

Program:

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

void main()
{
int s_sum,i,x,n;

clrscr();
printf("Enter the values for x and n:");
scanf("%d %d",&x,&n);

if(n<=0 || x<=0)
{
printf("Value is not valid\n");
}
else
{
s_sum=1;
for(i=1;i<=n;i++)
{
s_sum=s_sum+pow(x,i);
}
printf("Sum of series=%d\n",s_sum);
}
getch();
}
/*
Output:
Enter the values for x and n:2 4
Sum of series=31
*/

Write a C program to construct a pyramid of numbers.

2011-05-20T04:01:00.000-07:00

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

void main()
{
int num,i,y,x=35;
clrscr();
printf("\nEnter the number to generate the pyramid:\n");
scanf("%d",&num);

for(y=0;y<=num;y++)
{
/*(x-coordinate,y-coordinate)*/
gotoxy(x,y+1);

/*for displaying digits towards the left and right of zero*/
for(i=0-y;i<=y;i++)

printf("%3d",abs(i));
x=x-3;
}
getch();

}

/*
Output:
Enter the number to generate the pyramid:
5

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

Write a C program to generate Pascal’s triangle.

2011-05-20T04:00:00.000-07:00

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

void main()
{
int bin,p,q,r,x;
clrscr();
bin=1;
q=0;

printf("Rows you want to input:");
scanf("%d",&r);

printf("\nPascal's Triangle:\n");

while(q<r)
{
for(p=40-3*q;p>0;--p)
printf(" ");
for(x=0;x<=q;++x)
{
if((x==0)||(q==0))
bin=1;
else
bin=(bin*(q-x+1))/x;
printf("%6d",bin);
}

printf("\n");
++q;
}
getch();
}
/*
Rows you want to input:6

Pascal's Triangle:
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1

Write a C program to count the lines, words and characters in a given text.

2011-05-20T03:58:00.000-07:00

#include <stdio.h>
main()
{
char line[81], ctr;
int i,c,
end = 0,
characters = 0,
words = 0,
lines = 0;
printf(“KEY IN THE TEXT.\n”);
printf(“GIVE ONE SPACE AFTER EACH WORD.\n”);
printf(“WHEN COMPLETED, PRESS ‘RETURN’.\n\n”);
while( end == 0)
{
/* Reading a line of text */
c = 0;
while((ctr=getchar()) != ‘\n’)
line[c++] = ctr;
line[c] = ”;
/* counting the words in a line */
if(line[0] == ”)
break ;
else
{
words++;
for(i=0; line[i] != ”;i++)
if(line[i] == ‘ ‘ || line[i] == ‘\t’)
words++;
}
/* counting lines and characters */
lines = lines +1;
characters = characters + strlen(line);
}
printf (“\n”);
printf(“Number of lines = %d\n”, lines);
printf(“Number of words = %d\n”, words);
printf(“Number of characters = %d\n”, characters);
}

Output

KEY IN THE TEXT.
GIVE ONE SPACE AFTER EACH WORD.
WHEN COMPLETED, PRESS ‘RETURN’.
Admiration is a very short-lived passion.
Admiration involves a glorious obliquity of vision.
Always we like those who admire us but we do not
like those whom we admire.
Fools admire, but men of sense approve.
Number of lines = 5
Number of words = 36
Number of characters = 205

a) Write a C program that displays the position or index in the string S where the string T begins, or – 1 if S doesn’t contain T.

2011-05-20T03:51:00.000-07:00

#include<stdio.h>
#include<string.h>
#include<conio.h>
void main()
{
char s[30], t[20];
char *found;
clrscr();
/* Entering the main string */
puts("Enter the first string: ");
gets(s);
/* Entering the string whose position or index to be displayed */
puts("Enter the string to be searched: ");
gets(t);
/*Searching string t in string s */
found=strstr(s,t);
if(found)
printf("Second String is found in the First String at %d position.\n",found-s);
else
printf("-1");
getch();
}

/*
Output:
Enter the first string:
sridhar siricilla
Enter the string to be searched:
siri
Second String is found in the First String at 8 position.
*/

Write a C program to determine if the given string is a palindrome or not

2011-04-23T07:21:00.001-07:00

2nd method.......

#include<stdio.h>

#include<string.h>

enum Boolean{false,true};

enum Boolean IsPalindrome(char string[])

{

int left,right,len=strlen(string);

enum Boolean matched=true;

if(len==0)

return 0;

left=0;

right=len-1;

/* Compare the first and last letter,second & second last & so on */

while(left<right&&matched)

{

if(string[left]!=string[right])

matched=false;

else

{

left++;

right--;

}

return matched;

}

int main()

{

char string[40];

clrscr();

printf("****Program to test if the given string is a palindrome****\n");

printf("Enter a string:");

scanf("%s",string);

if(IsPalindrome(string))

printf("The given string %s is a palindrome\n",string);

else

printf("The given string %s is not a palindrome\n",string);

getch();

return 0;

}

Output:

****Program to test if the given string is a palindrome****

Enter a string:liril

The given string liril is a palindrome

Write a C program to determine if the given string is a palindrome or not

2011-04-23T07:19:00.000-07:00

#include<stdio.h>
#include<conio.h>
int stpal(char str[50]);
void main()
{
char str[50];
int pal;
clrscr();
printf(“nnt ENTER A STRING…: “);
gets(str);
pal = stpal(str);
if(pal)
printf(“nt THE ENTERED STRING IS A PALINDROME”);
else
printf(“nt THE ENTERED STRING IS NOT A PALINDROME”);
getch();
}
int stpal(char str[50])
{
int i = 0, len = 0, pal = 1;
while(str[len]!=’′)
len++;
len–;
for(i=0; i<len/2; i++)
{
if(str[i] == str[len-i])
pal = 1;
else
{
pal = 0;
break;
}
}
return pal;
}

write a c program to delete n Characters from a given position in a given string.

2011-04-23T07:13:00.000-07:00

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

void delchar(char *x,int a, int b);

void main()
{
char string[10];
int n,pos,p;
clrscr();

puts(“Enter the string”);
gets(string);
printf(“Enter the position from where to delete”);
scanf(“%d”,&pos);
printf(“Enter the number of characters to be deleted”);
scanf(“%d”,&n);
delchar(string, n,pos);
getch();
}

// Function to delete n characters
void delchar(char *x,int a, int b)
{
if ((a+b-1) <= strlen(x))
{
strcpy(&x[b-1],&x[a+b-1]);
puts(x);
}
}

write a c program to insert a sub-string in to given main string from a given position.

2011-04-23T07:09:00.000-07:00

#include<stdio.h>
#include<string.h>
void main( )
{
char st[20],sub[10],temp[10];
int pos, i, j;
clrscr( );
printf("Enter the main string:");
gets(st);
printf("\nEnter the substring to insert:");
gets(sub);
printf("Enter the index position:");
scanf("%d",&pos);
if(pos<=strlen(st)) {
for(i=0;i<=strlen(st);i++) {
if(i==pos)
{
for(j=0;st[i]!='\0';j++) // to store the 'st' to 'temp' from given position.
{
temp[j]=st[i];
i++;
}
temp[j]='\0';
i=pos;
for(j=0;sub[j]!='\0';j++) // to insert a sub-str to main string.
{
st[i]=sub[j];
i++;
}
for(j=0;temp[j]!='\0';j++) // Lastly to insert the 'temp' to 'st' after sub-str.
{
st[i]=temp[j];
i++;
}
st[i]='\0';
}}
printf("\nAfter adding the sub-string: %s",st);
}
else
printf("\nSorry, it is not possible to insert a substring in that position.");
getch();
}

Write a C program that uses functions to perform the following...

2011-04-23T07:06:00.000-07:00

i) Addition of Two Matrices

ii) Multiplication of Two Matrices

#include<stdio.h>

void main()
{
int ch,i,j,m,n,p,q,k,r1,c1,a[10][10],b[10][10],c[10][10];
clrscr();
printf("************************************");
printf("\n\t\tMENU");
printf("\n**********************************");
printf("\n[1]ADDITION OF TWO MATRICES");
printf("\n[2]MULTIPLICATION OF TWO MATRICES");
printf("\n[0]EXIT");
printf("\n**********************************");
printf("\n\tEnter your choice:\n");
scanf("%d",&ch);

switch(ch)
{
default:
printf("Invalide choice\n");
exit(1);

case 1:
printf("Input rows and columns of A & B Matrix:");
scanf("%d%d",&r1,&c1);
printf("Enter elements of matrix A:\n");
read_matrix(a,r1,c1);
printf("Enter elements of matrix B:\n");
read_matrix(b,r1,c1);
printf("\n =====Matrix Addition=====\n");
for(i=0;i<r1;i++)
{
for(j=0;j<c1;j++)
{
c[i][j]= a[i][j]+b[i][j];
}
printf("\n");
}
write_matrix(c,r1,c1);
break;

case 2:
printf("Input rows and columns of A matrix:");
scanf("%d%d",&m,&n);
printf("Input rows and columns of B matrix:");
scanf("%d%d",&p,&q);
if(n==p)
{
printf("resultant matrix is %d*%d\n",m,q);
printf("Input A matrix\n");
read_matrix(a,m,n);
printf("Input B matrix\n");
/*Function call to read the matrix*/
read_matrix(b,p,q);
/*Function for Multiplication of two matrices*/
printf("\n =====Matrix Multiplication=====\n");
for(i=0;i<m;++i)
for(j=0;j<q;++j)
{
c[i][j]=0;
for(k=0;k<n;++k)
c[i][j]=c[i][j]+a[i][k]*b[k][j];
}

printf("Resultant of two matrices:\n");
write_matrix(c,m,q);
}
/*end if*/
else
{
printf("Matrices cannot be multiplied.");
}
/*end else*/
break;

case 0:
printf("\n Choice Terminated");
exit();
break;

}
getch();
}

/*Function read matrix*/
int read_matrix(int a[10][10],int m,int n)
{
int i,j;
for(i=0;i<m;i++)
for(j=0;j<n;j++)
scanf("%d",&a[i][j]);
return 0;
}

/*Function to write the matrix*/
int write_matrix(int a[10][10],int m,int n)
{
int i,j;
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
printf("%5d",a[i][j]);
printf("\n");
}
return 0;
}
/*
Output:
************************************
MENU
**********************************
[1]ADDITION OF TWO MATRICES
[2]MULTIPLICATION OF TWO MATRICES
[0]EXIT
**********************************
Enter your choice:
1
Input rows and columns of A & B Matrix:2 2
Enter elements of matrix A:
3 4
2 3
Enter elements of matrix B:
2 1
3 21

=====Matrix Addition=====

5 5
5 24
*/

Write a C program to find both the larges and smallest number in a list of integers.

2011-04-23T07:04:00.001-07:00

main( )
{
int largest(float a[ ], int n);
int value[6] = {2,45,1,2,3,67};
printf(" The largest %d\n", largest(value,6));
printf(" smallest integer : %d\n",smallest(value,6));
}
int largest(int a[], int n)
{
int i;
int max;
max = a[0];
for(i = 1; i < n; i++)
if(max < a[i])
max = a[i];
return(max);
}
int smallest(int b[],int n)
{
int i;
int min;
min=a[0];
for(i = 1; i < n; i++)
if(min > a[i])
min=a[i];
return(min);

}

/*
The largest 67
smallest integer : 1
*/

Write a C program, which takes two integer operands and one operator form the user.

2011-04-23T07:03:00.000-07:00

Write a C program, which takes two integer operands and one operator form the user, performs the operation and then prints the result. (Consider the operators +,-,*, /, % and use Switch Statement)

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

void main()
{
int a,b,res,ch;
clrscr();
printf("\t *********************");
printf("\n\tMENU\n");
printf("\t********************");
printf("\n\t(1)ADDITION");
printf("\n\t(2)SUBTRACTION");
printf("\n\t(3)MULTIPLICATION");
printf("\n\t(4)DIVISION");
printf("\n\t(5)REMAINDER");
printf("\n\t(0)EXIT");
printf("\n\t********************");
printf("\n\n\tEnter your choice:");
scanf("%d",&ch);

if(ch<=5 & ch>0)
{
printf("Enter two numbers:\n");
scanf("%d%d",&a,&b);
}

switch(ch)
{

case 1:
res=a+b;
printf("\n Addition:%d",res);
break;
case 2:
res=a-b;
printf("\n Subtraction:%d",res);
break;
case 3:
res=a*b;
printf("\n Multiplication:%d",res);
break;
case 4:
res=a/b;
printf("\n Division:%d",res);
break;
case 5:
res=a%b;
printf("\n Remainder:%d",res);
break;
case 0:
printf("\n Choice Terminated");
exit();
break;
default:
printf("\n Invalid Choice");

}

getch();
}

*********************
MENU
********************
(1)ADDITION
(2)SUBTRACTION
(3)MULTIPLICATION
(4)DIVISION
(5)REMAINDER
(0)EXIT
********************

Enter your choice:1
Enter two numbers:
2 3

Addition:5

Write C program to find the distance travelled at regular intervals of time

2011-04-23T07:01:00.000-07:00

The total distance travelled by vehicle in ‘t’ seconds is given by distance = ut+1/2at2 where ‘u’ and ‘a’ are the initial velocity (m/sec.) and acceleration (m/sec2). Write C program to find the distance travelled at regular intervals of time given the values of ‘u’ and ‘a’. The program should provide the flexibility to the user to select his own time intervals and repeat the calculations for different values of ‘u’ and ‘a’.

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

void main()
{
int tim_intrval, counter,time;
float accl, distance=0, velos;
clrscr();
printf("PROGRAM FOR CALC TOTAL DISTANCE TRAVELED BY A VECHIAL");
printf("\nNO OF TIME INTERVALS : ");
scanf("%d",&tim_intrval);

for(counter = 1; counter <= tim_intrval; counter++)
{
printf("\nAT T%d TIME(sec) : ",counter);
scanf("%d",&time);
printf("\tVELOCITY AT %d sec (m/sec) : ",time);
scanf("%f",&velos);
printf("\tACCLERATION AT %d sec (m/sec^2): ",time);
scanf("%f",&accl);
distance += (velos*time + (accl*pow(time,2))/2);
}

printf("\nTOTAL DISTANCE TRAVELLED BY VEHICLE IN %d INTERVALS OF TIME : %f",tim_intrval,distance);
getch();
}

/*
Output:
PROGRAM FOR CALC TOTAL DISTANCE TRAVELED BY A VECHIAL
NO OF TIME INTERVALS : 4

AT T1 TIME(sec) : 1
VELOCITY AT 1 sec (m/sec) : 2
ACCLERATION AT 1 sec (m/sec^2): 3

AT T2 TIME(sec) : 4
VELOCITY AT 4 sec (m/sec) : 5
ACCLERATION AT 4 sec (m/sec^2): 6

AT T3 TIME(sec) : 7
VELOCITY AT 7 sec (m/sec) : 8
ACCLERATION AT 7 sec (m/sec^2): 8

AT T4 TIME(sec) : 9
VELOCITY AT 9 sec (m/sec) : 9
ACCLERATION AT 9 sec (m/sec^2): 0

TOTAL DISTANCE TRAVELLED BY VEHICLE IN 4 INTERVALS OF TIME : 404.500000
*/

Write C programs that use both recursive and non-recursive functions To solve Towers of Hanoi problem

2011-04-23T07:00:00.000-07:00

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

/* Non-Recursive Function*/
void hanoiNonRecursion(int num,char sndl,char indl,char dndl)
{
char stkn[100],stksndl[100],stkindl[100],stkdndl[100],stkadd[100],temp;
int top,add;
top=NULL;

one:
if(num==1)
{
printf("\nMove top disk from needle %c to needle %c ",sndl,dndl);
goto four;
}
two:
top=top+1;
stkn[top]=num;
stksndl[top]=sndl;
stkindl[top]=indl;
stkdndl[top]=dndl;
stkadd[top]=3;
num=num-1;
sndl=sndl;
temp=indl;
indl=dndl;
dndl=temp;

goto one;

three:
printf("\nMove top disk from needle %c to needle %c ",sndl,dndl);
top=top+1;
stkn[top]=num;
stksndl[top]=sndl;
stkindl[top]=indl;
stkdndl[top]=dndl;
stkadd[top]=5;
num=num-1;
temp=sndl;
sndl=indl;
indl=temp;
dndl=dndl;

goto one;

four:
if(top==NULL)
return;
num=stkn[top];
sndl=stksndl[top];
indl=stkindl[top];
dndl=stkdndl[top];
add=stkadd[top];
top=top-1;
if(add==3)
goto three;
else if(add==5)
goto four;
}

/* Recursive Function*/
void hanoiRecursion( int num,char ndl1, char ndl2, char ndl3)
{
if ( num == 1 ) {
printf( "Move top disk from needle %c to needle %c.", ndl1, ndl2 );
return;
}

hanoiRecursion( num - 1,ndl1, ndl3, ndl2 );
printf( "Move top disk from needle %c to needle %c.", ndl1, ndl2 );
hanoiRecursion( num - 1,ndl3, ndl2, ndl1 );
}

void main()
{
int no;
clrscr();
printf("Enter the no. of disks to be transferred: ");
scanf("%d",&no);

if(no<1)
printf("\nThere's nothing to move.");
else
printf("Non-Recursive");
hanoiNonRecursion(no,'A','B','C');
printf("\nRecursive\n");
hanoiRecursion(no,'A','B','C');

getch();

}
/*
Output:

Enter the no. of disks to be transferred: 3
Non-Recursive
Move top disk from needle A to needle C
Move top disk from needle A to needle B
Move top disk from needle C to needle B
Move top disk from needle A to needle C
Move top disk from needle B to needle A
Move top disk from needle B to needle C
Move top disk from needle A to needle C
Recursive
Move top disk from needle A to needle B.Move top disk from needle A to needle C.
Move top disk from needle B to needle C.Move top disk from needle A to needle B.
Move top disk from needle C to needle A.Move top disk from needle C to needle B.
Move top disk from needle A to needle B.
*/

Write C programs that use both recursive and non-recursive functions To find the GCD (greatest common divisor) of two given integers.

2011-04-23T06:58:00.001-07:00

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

unsigned int GcdRecursive(unsigned m, unsigned n);
unsigned int GcdNonRecursive(unsigned p,unsigned q);

int main(void)
{
int a,b,iGcd;
clrscr();

printf("Enter the two numbers whose GCD is to be found: ");
scanf("%d%d",&a,&b);

printf("GCD of %d and %d Using Recursive Function is %d\n",a,b,GcdRecursive(a,b));
printf("GCD of %d and %d Using Non-Recursive Function is %d\n",a,b,GcdNonRecursive(a,b));

getch();
}

/* Recursive Function*/
unsigned int GcdRecursive(unsigned m, unsigned n)
{
if(n>m)
return GcdRecursive(n,m);
if(n==0)
return m;
else
return GcdRecursive(n,m%n);
}

/* Non-Recursive Function*/
unsigned int GcdNonRecursive(unsigned p,unsigned q)
{
unsigned remainder;
int temp;
while(1)
{
if(p == 0)
{
return q;
}
else if(q == 0)
{
return p;
}
else if(q<p)
{
temp=p%q;
p=temp;

}
else if(p<q)
{
temp=q%p;
q=temp;
}

}
}

Write C programs that use both recursive and non-recursive functions To find the factorial of a given integer

2011-04-23T06:57:00.000-07:00

#include<stdio.h>
#include<conio.h>
unsigned int recr_factorial(int n);
unsigned int iter_factorial(int n);
void main()
{
int n,i;
long fact;
clrscr();
printf("Enter the number: ");
scanf("%d",&n);
if(n==0)
printf("Factorial of 0 is 1\n");
else
{
printf("Factorial of %d Using Recursive Function is %d\n",n,recr_factorial(n));
printf("Factorial of %d Using Non-Recursive Function is %d\n",n,iter_factorial(n));
}
getch();
}
/* Recursive Function*/
unsigned int recr_factorial(int n) {
return n>=1 ? n * recr_factorial(n-1) : 1;
}
/* Non-Recursive Function*/
unsigned int iter_factorial(int n) {
int accu = 1;
int i;
for(i = 1; i <= n; i++) {
accu *= i;
}
return accu;
}

Out put :

Enter the number: 5
Factorial of 5 Using Recursive Function is 120
Factorial of 5 Using Non-Recursive Function is 120

Write a C program to find the roots of a quadratic equation.

2011-04-23T06:47:00.000-07:00

#include<stdio.h>
#include<conio.h>
#include<math.h>
main()
{
float a,b,c,root1,root2;
clrscr();
printf("\n Enter values of a,b,c for finding roots of a quadratic (ax2+bx+c)eq:\n");
scanf("%f%f%f",&a,&b,&c);

/*checking condition*/
if(b*b>4*a*c)
{
root1=(-b+sqrt(b*b-4*a*c))/(2*a);
root2=(-b-sqrt(b*b-4*a*c))/(2*a);
printf("\nROOTS ARE\n");
printf("\n root1=%f\n root2=%f",root1,root2);
}
else
printf("\n Imaginary Roots.");
getch();
return 0;
}

OutPut:

Enter values of a,b,c for finding roots of a quadratic (ax2+bx+c)eq:
2 -7 5

ROOTS ARE

root1=2.500000
root2=1.000000

Write a C program to calculate the following Sum: Sum=1-x2/2! +x4/4!-x6/6!+x8/8!-x10/10!

2011-04-23T06:41:00.000-07:00

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

void main()
{
int counter,f_coun;
float sum=0,x,power,fact;
clrscr();

printf("PROGRAM FOR SUM OF EQ. SERIES");
printf("\n\n\tEQUATION SERIES : 1- X^2/2! + X^4/4! - X^6/6! + X^8/8! - X^10/10!");

printf("\n\tENTER VALUE OF X : ");
scanf("%f",&x);

for(counter=0, power=0; power<=10; counter++,power=power+2)
{
fact=1;
//CALC FACTORIAL OF POWER VALUE
for(f_coun=power; f_coun>=1; f_coun--)
fact *= f_coun;
//EQ. FOR SUM SERIES
sum=sum+(pow(-1,counter)*(pow(x,power)/fact));
}

printf("SUM : %f",sum);
getch();

}

Output:

PROGRAM FOR SUM OF EQ. SERIES

EQUATION SERIES : 1- X^2/2! + X^4/4! - X^6/6! + X^8/8! - X^10/10!

ENTER VALUE OF X : 4

SUM : -0.685785

Write a C program to generate all the prime numbers between 1 and n.

2011-04-23T06:33:00.000-07:00

#include <stdio.h>

void main()
{
int no,counter,counter1,check;
clrscr();
printf("PRIME NO. SERIES");
printf("\nINPUT THE VALUE OF N: ");
scanf("%d",&no);
printf("\nTHE PRIME NO. SERIES B/W 1 TO %d : \n\n",no);

for(counter = 1; counter <= no; counter++)
{
check = 0;
//THIS LOOP WILL CHECK A NO TO BE PRIME NO. OR NOT.

for(counter1 = counter-1; counter1 > 1 ; counter1--)
if(counter%counter1 == 0)
{
check++; // INCREMENT CHECK IF NO. IS NOT A PRIME NO.
break;
}
if(check == 0)
printf("%d\t",counter);
}
getch();
}

PRIME NO. SERIES
INPUT THE VALUE OF N: 25

THE PRIME NO. SERIES B/W 1 TO 25 :

1 2 3 5 7 11 13 17 19 23

Write a C program to Fibonacci Sequence..

2011-04-23T06:26:00.000-07:00

A Fibonacci Sequence is defined as follows: the first and second terms in the sequence are 0 and 1. Subsequent terms are found by adding the preceding two terms in the sequence. Write a C program to generate the first n terms of the sequence.

#include <stdio.h>

void main()
{
int num1=0, num2=1,no,counter,fab;
clrscr();

printf("PROGRAM TO FIND THE FIBONACCI SERIES UP TO N NO. IN SERIES");
printf("\nENTER LENGTH OF SERIES (N) : ");
scanf("%d",&no);

printf("\nFIBONACCI SERIES");
printf("\t%d %d",num1,num2);

//LOOP WILL RUN FOR 2 TIME LESS IN SERIES AS THESE WAS PRINTED IN ADVANCE
for(counter = 1; counter <= no-2; counter++)
{
fab=num1 + num2;
printf(" %d",fab);
num1=num2;
num2=fab;
}
getch();
}

Output:

PROGRAM TO FIND THE FIBONACCI SERIES UP TO N NO. IN SERIES

ENTER LENGTH OF SERIES (N) : 5

FIBONACCI SERIES 0 1 1 2 3

Write a C program to find the sum of individual digits of a positive integer.

2011-04-23T06:08:00.000-07:00

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

void main()
{
int num, k=1, sum=0;
clrscr();
printf("Enter the number whose digits are to be added:");
scanf("%d",&num);
while(num!=0)
{
k=num%10;
sum=sum+k;
k=num/10;
num=k;
}
printf("Sum of the digits:%d",sum);
getch();
}

Output:

Enter the number whose digits are to be added:567

Sum of the digits:18