List of Programs: Programs: 1. Polynomial addition

Size: px

Start display at page:

Download "List of Programs: Programs: 1. Polynomial addition"

Clarissa Mason
6 years ago
Views:

1 List of Programs: 1. Polynomial addition 2. Common operations on vectors in c 3. Matrix operation: multiplication, transpose 4. Basic Unit conversion 5. Number conversion: Decimal to binary 6. Number conversion: Binary to Octal 7. Number conversion: Octal to Hexadecimal 8. Square root of number 9. Implement SIMPSON'S 1/3 RULE 10. Implement Newton raphson method 11. Operations on polygon in c #include<math.h> Programs: 1. Polynomial addition /* This structure is used to store a polynomial term. An array of such terms represents a polynomial. The "coeff" element stores the coefficient of a term in the polynomial,while the "exp" element stores the exponent. */ struct poly float coeff; int exp; ; //declaration of polynomials struct poly a[50],b[50],c[50],d[50]; int main() int i; int deg1,deg2; int k=0,l=0,m=0; //stores degrees of the polynomial printf("enter the highest degree of poly1:"); scanf("%d",&deg1); //taking polynomial terms from the user for(i=0;i<=deg1;i++) //entering values in coefficient of the polynomial terms printf("\nenter the coeff of x^%d :",i);

2 scanf("%f",&a[i].coeff); //entering values in exponent of the polynomial terms a[k++].exp = i; //taking second polynomial from the user printf("\nenter the highest degree of poly2:"); scanf("%d",&deg2); for(i=0;i<=deg2;i++) printf("\nenter the coeff of x^%d :",i); scanf("%f",&b[i].coeff); b[l++].exp = i; //printing first polynomial printf("\nexpression 1 = %.1f",a[0].coeff); for(i=1;i<=deg1;i++) printf("+ %.1fx^%d",a[i].coeff,a[i].exp); //printing second polynomial printf("\nexpression 2 = %.1f",b[0].coeff); for(i=1;i<=deg2;i++) printf("+ %.1fx^%d",b[i].coeff,b[i].exp); //Adding the polynomials if(deg1>deg2) for(i=0;i<=deg2;i++) c[m].coeff = a[i].coeff + b[i].coeff; c[m].exp = a[i].exp; m++; else for(i=deg2+1;i<=deg1;i++) c[m].coeff = a[i].coeff; c[m].exp = a[i].exp; m++;

3 for(i=0;i<=deg1;i++) c[m].coeff = a[i].coeff + b[i].coeff; c[m].exp = a[i].exp; m++; for(i=deg1+1;i<=deg2;i++) c[m].coeff = b[i].coeff; c[m].exp = b[i].exp; m++; //printing the sum of the two polynomials printf("\nexpression after additon = %.1f",c[0].coeff); for(i=1;i<m;i++) printf("+ %.1fx^%d",c[i].coeff,c[i].exp); return 0; Output: Enter the highest degree of poly1:5 Enter the coeff of x^0 :1 Enter the coeff of x^1 :2 Enter the coeff of x^2 :3 Enter the coeff of x^3 :4 Enter the coeff of x^4 :5 Enter the coeff of x^5 :6 Enter the highest degree of poly2:4 Enter the coeff of x^0 :4 Enter the coeff of x^1 :3 Enter the coeff of x^2 :2 Enter the coeff of x^3 :1 Enter the coeff of x^4 :0 Expression 1 = x^1+ 3.0x^2+ 4.0x^3+ 5.0x^4+ 6.0x^5 Expression 2 = x^1+ 2.0x^2+ 1.0x^3+ 0.0x^4 Expression after additon = x^1+ 5.0x^2+ 5.0x^3+ 5.0x^4+ 6.0x^5 2. Common operations on vectors in c /* Vector addition */ int main() int a[10], b[10]; /* vectors to be added */

$Output int c[10]; /* result vector */ int n, i; clrscr(); /* read vectors a and b */ printf("enter vector size: "); scanf("%d", &n); printf("enter elements of vector a:\n"); for (i = 0; i < n; i++)$

4 Output int c[10]; /* result vector */ int n, i; clrscr(); /* read vectors a and b */ printf("enter vector size: "); scanf("%d", &n); printf("enter elements of vector a:\n"); for (i = 0; i < n; i++) scanf("%d", &a[i]); printf("enter elements of vector b:\n"); for (i = 0; i < n; i++) scanf("%d", &b[i]); /* perform vector addition */ for (i = 0; i < n; i++) c[i] = a[i] + b[i]; /* print addition vector C */ printf("addition vector:\n"); for (i = 0; i < n; i++) printf("%d ", c[i]); getch(); #include <stdio.h> 3. Matrix operation: multiplication transpose Matrix multiplication int main() int m, n, p, q, c, d, k, sum = 0; int first[10][10], second[10][10], multiply[10][10]; printf("enter the number of rows and columns of first matrix\n"); scanf("%d%d", &m, &n); printf("enter the elements of first matrix\n"); for (c = 0; c < m; c++) for (d = 0; d < n; d++) scanf("%d", &first[c][d]); printf("enter the number of rows and columns of second matrix\n"); scanf("%d%d", &p, &q); if (n!= p) printf("matrices with entered orders can't be multiplied with each other.\n");

$else printf("enter the elements of second matrix\n"); for (c = 0; c < p; c++) for (d = 0; d < q; d++) scanf("%d", &second[c][d]); for (c = 0; c < m; c++) for (d = 0; d < q; d++) for (k = 0; k < p;$

5 else printf("enter the elements of second matrix\n"); for (c = 0; c < p; c++) for (d = 0; d < q; d++) scanf("%d", &second[c][d]); for (c = 0; c < m; c++) for (d = 0; d < q; d++) for (k = 0; k < p; k++) sum = sum + first[c][k]*second[k][d]; multiply[c][d] = sum; sum = 0; printf("product of entered matrices:-\n"); for (c = 0; c < m; c++) for (d = 0; d < q; d++) printf("%d\t", multiply[c][d]); printf("\n"); return 0; #include <stdio.h> Transpose int main()

6 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; Output: Enter rows and columns of matrix: 2 3 Enter element of matrix: Enter element a11: 2 Enter element a12: 3 Enter element a13: 4 Enter element a21: 5 Enter element a22: 6 Enter element a23: 4 Entered Matrix:

7 Transpose of Matrix: Basic Unit conversion C code to convert one unit to other unit: #include<math.h> int main() char fromunit,tounit; char *funit,*tunit; long double fromvalue,metervalue,tovalue; int power =0; printf("to convert the 12 Inch to Foot\n"); printf("enter the the unit in the format : dc12\n"); printf("ell: a\n"); printf("femi: b\n"); printf("foot: c\n"); printf("inch: d\n"); printf("light year: e\n"); printf("metre: f\n"); printf("mile: g\n"); printf("nano meter: h\n"); printf("pace: i\n"); printf("point: j\n"); printf("yard: k\n"); printf("mili meter: l\n"); printf("centi meter: m\n"); printf("deci meter: n\n"); printf("deca meter: o\n"); printf("hecto meter: p\n"); printf("kilo meter: q\n"); scanf("%c%c%lf",&fromunit,&tounit,&fromvalue); switch(fromunit) case 'a': metervalue = fromvalue * 1.143; funit="ell"; break; case 'b': metervalue = fromvalue ; power = -15; funit="fm"; break; case 'c': metervalue = fromvalue * ; funit="ft"; break; case 'd': metervalue = fromvalue * ; funit="in"; break; case 'e': metervalue = fromvalue * ; power =15; funit="ly"; break; case 'f': metervalue = fromvalue; funit="m"; break; case 'g': metervalue = fromvalue * ; funit="mi"; break;

8 case 'h': metervalue = fromvalue; funit="nm"; power = -9; break; case 'i': metervalue = fromvalue * ; funit="pace"; break; case 'j': metervalue = fromvalue * ; funit="pt"; break; case 'k': metervalue = fromvalue * ; funit="yd"; break; case 'l': metervalue = fromvalue * 0.001; funit="mm"; break; case 'm': metervalue = fromvalue * 0.01; funit="cm"; break; case 'n': metervalue = fromvalue * 0.1; funit="deci meter"; break; case 'o': metervalue = fromvalue * 10; funit="deca meter"; break; case 'p': metervalue = fromvalue * 100; funit="hm"; break; case 'q': metervalue = fromvalue * 1000; funit="km"; break; default: printf("invalid input"); exit(0); switch(tounit) case 'a': tovalue = metervalue/1.143; tunit="ell"; break; case 'b': tovalue = metervalue; tunit="fm"; break; case 'c': tovalue = metervalue/0.3048; tunit="ft"; break; case 'd': tovalue = metervalue/0.0254; tunit="in"; break; case 'e': tovalue = metervalue/ ; tunit="ly"; break; case 'f': tovalue = metervalue; tunit="m";break; case 'g': tovalue = metervalue/ ; tunit="mi"; break; case 'h': tovalue = metervalue; tunit="nm"; break; case 'i': tovalue = metervalue/0.762; tunit="pace"; break; case 'j': tovalue = metervalue/ ; tunit="pt"; break; case 'k': tovalue = metervalue/0.9144; tunit="yd"; break; case 'l': tovalue = metervalue/0.001; tunit="mm"; break; case 'm': tovalue = metervalue/0.01; tunit="cm"; break; case 'n': tovalue = metervalue/0.1; tunit="deci meter"; break; case 'o': tovalue = metervalue/10; tunit="deca meter"; break; case 'p': tovalue = metervalue/100; tunit="hm"; break; case 'q': tovalue = metervalue/1000; tunit="km"; break; default: printf("invalid input"); exit(0); if(power==0) printf("%.4lf %s = %.4Lf %s",fromvalue,funit,tovalue,tunit); else while(tovalue > 10 printf("%.4lf %s = %.4Lf*10^%d %s",fromvalue,funit,tovalue,power,tunit); return 0; 5. Number conversion: Decimal to binary int main() long int m,no=0,a=1; int n,rem; printf("enter any decimal number->"); scanf("%d",&n); m=n; while(n!=0) rem=n%2; no=no+rem*a;

9 n=n/2; a=a*10; printf("the value %ld in binary is->",m); printf("%ld",no); return 0; 6. Number conversion: Binary to Octal /* * C Program to Convert Binary to Octal */ #include <stdio.h> int main() long int binarynum, octalnum = 0, j = 1, remainder; printf("enter the value for binary number: "); scanf("%ld", &binarynum); while (binarynum!= 0) remainder = binarynum % 10; octalnum = octalnum + remainder * j; j = j * 2; binarynum = binarynum / 10; printf("equivalent octal value: %lo", octalnum); return 0; 7. Number conversion: Octal to Hexadecimal /* C Program - Octal to Hexadecimal Conversion */ #include<conio.h> #include<string.h> #include<math.h> void main() clrscr(); int a[20], b[20], c[20], rev[20], h, i, j, k, l, x, fra, flag, rem, num1, num3; float rem1, num2, num4, dno; char s[20]; x = fra = flag = rem = 0; rem1 = 0.0; printf("enter any Octal Number : "); scanf("%s",s); for(i=0,j=0,k=0; i<strlen(s); i++) if(s[i]=='.') flag=1;

10 else if(flag==0) a[j++]=s[i]-48; else if(flag==1) b[k++]=s[i]-48; x=j; fra=k; for(j=0,i=x-1; j<x; j++,i--) rem = rem +(a[j] * pow(8,i)); for(k=0,i=1;k<fra;k++,i++) rem1 = rem1 +(b[k] / pow(8,i)); rem1 = rem + rem1; dno = rem1; num1 = (int)dno; num2 = dno - num1; i=0; while(num1!=0) rem = num1 % 16; rev[i] = rem; num1 = num1 /16; i++; j=0; while(num2!=0.0) num2 = num2 * 16; num3 = (int)num2; num4 = num2 - num3; num2 = num4; a[j] = num3; j++; if(j==4) break; l=i; printf("\nequivalent Hexadecimal Value = "); for(i=l-1; i>=0; i--) if(rev[i]==10) printf("a"); else if(rev[i]==11) printf("b");

11 else if(rev[i]==12) printf("c"); else if(rev[i]==13) printf("d"); else if(rev[i]==14) printf("e"); else if(rev[i]==15) printf("f"); else printf("%d",rev[i]); h=j; printf("."); for(k=0; k<h; k++) if(a[k]==10) printf("a"); else if(a[k]==11) printf("b"); else if(a[k]==12) printf("c"); else if(a[k]==13) printf("d"); else if(a[k]==14) printf("e"); else if(a[k]==15) printf("f"); else printf("%d",a[k]); getch();

12 8. Square root of number void main() float m,n; float num; n=0.0001; // This is taken small so that we can calculate upto decimal places also printf("enter A NUMBER : "); scanf("%f",&num); for(m=0;m<num;m=m+n) if((m*m)>num) m=m-n; // This if() is used to calculate the final value as soon as the square of the number exceeds break; // the number then we deduct the value exceeded and stop the procedure using break; this is our final value which is stored in m; printf("%.2f",m); getch(); return 1; 9. Implement SIMPSON'S 1/3 RULE #include<conio.h> float f(float x) return(1/(1+x)); void main() int i,n; float x0,xn,h,y[20],so,se,ans,x[20]; printf("\n Enter values of x0,xn,h: "); scanf("%f%f%f",&x0,&xn,&h); n=(xn-x0)/h; if(n%2==1) n=n+1; h=(xn-x0)/n; printf("\n Refined value of n and h are:%d %f\n",n,h); printf("\n Y values: \n"); for(i=0; i<=n; i++)

$x[i]=x0+i*h; y[i]=f(x[i]); printf("\n %f\n",y[i]); so=0; se=0; for(i=1; i<n; i++) if(i%2==1) so=so+y[i]; else se=se+y[i]; ans=h/3*(y[0]+y[n]+4*so+2*se); printf("\n Final$

13 x[i]=x0+i*h; y[i]=f(x[i]); printf("\n %f\n",y[i]); so=0; se=0; for(i=1; i<n; i++) if(i%2==1) so=so+y[i]; else se=se+y[i]; ans=h/3*(y[0]+y[n]+4*so+2*se); printf("\n Final integration is %f",ans); getch(); Output #include<math.h> float f(float x) return x*log10(x) - 1.2; float df (float x) 10. Implement Newton raphson method

$43429; void main() int itr, maxmitr; float h, x0, x1, allerr; printf("\nenter x0, allowed error and maximum iterations\n"); scanf("%f %f %d", &x0, &allerr, &maxmitr); for (itr=1; itr<=maxmitr; itr++)$

14 return log10(x) ; void main() int itr, maxmitr; float h, x0, x1, allerr; printf("\nenter x0, allowed error and maximum iterations\n"); scanf("%f %f %d", &x0, &allerr, &maxmitr); for (itr=1; itr<=maxmitr; itr++) h=f(x0)/df(x0); x1=x0-h; printf(" At Iteration no. %3d, x = %9.6f\n", itr, x1); if (fabs(h) < allerr) printf("after %3d iterations, root = %8.6f\n", itr, x1); return 0; x0=x1; printf(" The required solution does not converge or iterations are insufficient\n"); return 1; Output 11. Operations on polygon in c

PROGRAMMING IN C LAB MANUAL FOR DIPLOMA IN ECE/EEE

PROGRAMMING IN C LAB MANUAL FOR DIPLOMA IN ECE/EEE 1. Write a C program to perform addition, subtraction, multiplication and division of two numbers. # include # include int a, b,sum,