Trend Posts
Author
View LUQMAN's profile
Showing posts with label CCP Lab programing. Show all posts
Showing posts with label CCP Lab programing. Show all posts
Monday, July 21, 2014
#include<stdio.h>
#include<conio.h>
void main()
{
int m,n,p,q,i,j,k,mat1[10][10],mat2[10][10],result[10][10];
clrscr(); //to clear the screen
printf(“enter the number of rows and columns for marix1 respectively \n”);
scanf(“%d%d”,&m,&n);
printf(“enter the number of rows and columns for marix2 respectively \n”);
scanf(“%d%d”,&p,&q);
if(n==p) //if multiplication of mat1*mat2 then it’s mat1 number of columns must equal to mat2 number of rows
{
printf(“enter the elements value of matrix1 \n”);
for(i=0;i<m;i++)
for(j=0;j<n;j++)
scanf(“%d”,&mat1[i][j]);
printf(“enter the elements value of matrix2 \n”);
for(i=0;i<p;i++)
for(j=0;j<q;j++)
scanf(“%d”,&mat1[i][j]);
for(k=0;k<n;k++)
for(i=0;i<m;i++)
for(j=0;j<q;j++)
result[i][j]=mat1[i][k]*mat2[k][j];
printf(“resultant matrix is ….\n”);
for(i=0;i<m;i++)
{
for(j=0;j<q;j++)
{
printf(“%d\t”,result[i][j]);
}
printf(“\n”);
}
}
}
else
{
printf(“math error! \n”);
}
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 input N integer numbers into a single dimensional array,sort them in ascending order using dimensional array and perform a binary search for a given key integer number and report success or failure in the form of suitable message
CLICK HERE TO DOWNLOAD PROGRAM FILE!
Program No:3
=================
#include<stdio.h>
#include<conio.h>
#include<process.h>
void main()
{
int a[100],i,n,key,first,last,mid;
clrscr();
printf("enter the limit number of array elements\n");
scanf("%d",&n);
printf("enter the elements of array\n");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
printf("My array elements...\n");
for(i=0;i<n;i++)
{
printf("%d \n",a[i]);
}
printf("enter your searching word\n");
scanf("%d",&key);
first=0;
last=n-1;
while(first<=last)
{
mid=(first+last)/2;
if(key==a[mid])
{
printf("\n %d is found at location =%d\n",key,mid+1);
getch();
exit(0);
}
else
{
if(key>a[mid])
{
first=mid+1;
}
else
{
last=mid-1;
}
}
}
printf("The %d is not found in the list ",key);
getch();
}
===================
Program Ends
CLICK HERE TO DOWNLOAD PROGRAM FILE!
To referance wikipedia link
screenshots:
CLICK HERE TO DOWNLOAD PROGRAM FILE!
Program No:3
=================
#include<stdio.h>
#include<conio.h>
#include<process.h>
void main()
{
int a[100],i,n,key,first,last,mid;
clrscr();
printf("enter the limit number of array elements\n");
scanf("%d",&n);
printf("enter the elements of array\n");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
printf("My array elements...\n");
for(i=0;i<n;i++)
{
printf("%d \n",a[i]);
}
printf("enter your searching word\n");
scanf("%d",&key);
first=0;
last=n-1;
while(first<=last)
{
mid=(first+last)/2;
if(key==a[mid])
{
printf("\n %d is found at location =%d\n",key,mid+1);
getch();
exit(0);
}
else
{
if(key>a[mid])
{
first=mid+1;
}
else
{
last=mid-1;
}
}
}
printf("The %d is not found in the list ",key);
getch();
}
===================
Program Ends
CLICK HERE TO DOWNLOAD PROGRAM FILE!
To referance wikipedia link
screenshots:
Subscribe to:
Posts (Atom)