Trend Posts
Author
View LUQMAN's profile
Showing posts with label for loop. Show all posts
Showing posts with label for loop. Show all posts
Monday, September 2, 2013
#include<stdio.h>
#include<conio.h>
void main()
{
int i,a[i],m;
clrscr();
printf("enter the limit of array\n");
scanf("%d",&m);
printf("enter your array elements\n");
for(i=0;i<m;i++)
{
scanf("%d",&a[i]);
}
printf("your array elements...\n");
for(i=0;i<m;i++)
{
printf("%d\n",a[i]);
}
getch();
}
#include<conio.h>
void main()
{
int i,a[i],m;
clrscr();
printf("enter the limit of array\n");
scanf("%d",&m);
printf("enter your array elements\n");
for(i=0;i<m;i++)
{
scanf("%d",&a[i]);
}
printf("your array elements...\n");
for(i=0;i<m;i++)
{
printf("%d\n",a[i]);
}
getch();
}
Thursday, August 29, 2013
Design, develop and execute a program in C to evaluate the given polynomial f(x)=a4x4+a3x3+a2x2+a1x+a0
Program No:4
=============
#include<stdio.h>
#include<conio.h>
void main() // Calling Main Function
{
float a[100],x,sum=0;
int i,n;
clrscr();
printf("Enter the power of polinomial equation");
scanf("%d",&n);
printf("Enter the values of X \n");
sanf("%f",&x);
printf("enter the values for co-efficients \n");
for(i=n;i>0;i--)
{
scanf("%f",&a[i]);
}
for(i=n;i>0;i--)
{
sum=(sum+a[i])*x;
}
sum=sum+a[0];
printf("\n the values of f(%.2f) sum=%.2f",x,sum);
getch();
}
===========
Program Ends
CLICKHERE! TO DOWNLOAD THIS PROGRAM
To more reference Wikipedia link
Screenshots:
for given value of x and the coefficients using Horner's method
Program No:4
=============
#include<stdio.h>
#include<conio.h>
void main() // Calling Main Function
{
float a[100],x,sum=0;
int i,n;
clrscr();
printf("Enter the power of polinomial equation");
scanf("%d",&n);
printf("Enter the values of X \n");
sanf("%f",&x);
printf("enter the values for co-efficients \n");
for(i=n;i>0;i--)
{
scanf("%f",&a[i]);
}
for(i=n;i>0;i--)
{
sum=(sum+a[i])*x;
}
sum=sum+a[0];
printf("\n the values of f(%.2f) sum=%.2f",x,sum);
getch();
}
===========
Program Ends
CLICKHERE! TO DOWNLOAD THIS PROGRAM
To more reference Wikipedia link
Screenshots:
Tuesday, August 27, 2013
Design,Develop,and execute a program in C to Read a sparse matrix of integer values and to search the sparse matrix for an element specified by the user. Print the result of the result of the search appropriately Use the triple <row,column,value> to represent an element in the sparse matrix
TO DOWNLOAD PROGRAM FILE CLICK HERE!
Program No:2
=============
Program ends
Screen-shots:
TO DOWNLOAD PROGRAM FILE CLICK HERE!to more reference:wikipedia link
TO DOWNLOAD PROGRAM FILE CLICK HERE!
Program No:2
=============
#include<stdio.h>
#include<conio.h>
#define MAX 50
struct term
{
int row;
int col;
int val;
};
struct term sparse[MAX];
void main()
{
int a[MAX][MAX],i,j,m,n,count=0,key,flag=0;
clrscr();
printf("enter the limit of the matrix \n");
scanf("%d%d",&m,&n);
printf("enter the elements of matrix \n ");
for(i=0;i<m;i++)
for(j=0;j<n;j++)
{
scanf("%d",&a[i][j]);
}
printf("your matrix elements...\n");
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
printf("%d",a[i][j]);
}
printf("\n");
}
printf("the matrix in alternative form...\n");
for(i=0;i<m;i++)
for(j=0;j<n;j++)
{
if(a[i][j]!=0)
{
++count;
sparse[count].row=i;
sparse[count].col=j;
sparse[count].val=a[i][j];
}
}
printf("<row\tcoloumn\tvalue\t>\n");
printf("%d\t%d\t%d\t\n",m,n,count);
sparse[0].row=m;
sparse[0].col=n;
sparse[0].val=count;
for(i=1;i<=count;i++)
{
printf("<%d\t%d\t%d\t>\n",sparse[i].row,sparse[i].col,sparse[i].val);
}
printf("enter the value for key\n");
scanf("%d",&key);
printf("searching key in sparse matrix \n");
for(i=1;i<=count;i++)
if(sparse[i].val==key)
{
flag=1;
printf("Key:%d is found at <%d\t%d\t>",key,sparse[i].row,sparse[i].col);
}
if(flag==0)
{
printf("the key is not found\n");
}
getch();
}
=======#include<conio.h>
#define MAX 50
struct term
{
int row;
int col;
int val;
};
struct term sparse[MAX];
void main()
{
int a[MAX][MAX],i,j,m,n,count=0,key,flag=0;
clrscr();
printf("enter the limit of the matrix \n");
scanf("%d%d",&m,&n);
printf("enter the elements of matrix \n ");
for(i=0;i<m;i++)
for(j=0;j<n;j++)
{
scanf("%d",&a[i][j]);
}
printf("your matrix elements...\n");
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
printf("%d",a[i][j]);
}
printf("\n");
}
printf("the matrix in alternative form...\n");
for(i=0;i<m;i++)
for(j=0;j<n;j++)
{
if(a[i][j]!=0)
{
++count;
sparse[count].row=i;
sparse[count].col=j;
sparse[count].val=a[i][j];
}
}
printf("<row\tcoloumn\tvalue\t>\n");
printf("%d\t%d\t%d\t\n",m,n,count);
sparse[0].row=m;
sparse[0].col=n;
sparse[0].val=count;
for(i=1;i<=count;i++)
{
printf("<%d\t%d\t%d\t>\n",sparse[i].row,sparse[i].col,sparse[i].val);
}
printf("enter the value for key\n");
scanf("%d",&key);
printf("searching key in sparse matrix \n");
for(i=1;i<=count;i++)
if(sparse[i].val==key)
{
flag=1;
printf("Key:%d is found at <%d\t%d\t>",key,sparse[i].row,sparse[i].col);
}
if(flag==0)
{
printf("the key is not found\n");
}
getch();
}
Program ends
Screen-shots:
TO DOWNLOAD PROGRAM FILE CLICK HERE!to more reference:wikipedia link
Subscribe to:
Posts (Atom)