Era Of Skills

Vogel approximation method (VAM) in transportation problem

2011-10-02T11:09:00.000+05:30

//Vogel approximation method (VAM) in transportation problem
#include<stdio.h>
main()
{
int res,des,*s,*d,**cell,**cost,i,j,r1,c1,r2,c2,p,q,a1,a2,max1,max2,min1,min2,sumreq=0,count=0,sumdes=0,total=0,*rowpanl,*colpanl;
printf("Enter number of resources: ");
scanf("%d",&res);
printf("Enter the number of destinations: ");
scanf("%d",&des);

//memory allocation
s=(int *)malloc(res*sizeof(int));
rowpanl=(int *)malloc(res*sizeof(int));
d=(int *)malloc(des*sizeof(int));
colpanl=(int *)malloc(des*sizeof(int));
cell=(int **)malloc(res*sizeof(int *));
for(i=0;i<res;i++)
cell[i]=(int *)malloc(des*sizeof(int));
cost=(int **)malloc(res*sizeof(int *));
for(i=0;i<res;i++)
cost[i]=(int *)malloc(des*sizeof(int));

for(i=0;i<res;i++)
for(j=0;j<des;j++)
cell[i][j]=-1;
//memory allocated

//data entering
for(i=0;i<res;i++)
{
printf("Enter the %dth resource availability: ",i+1);
scanf("%d",&s[i]);
sumreq+=s[i];
}

for(i=0;i<des;i++)
{
printf("Enter the %dth destination requirement: ",i+1);
scanf("%d",&d[i]);
sumdes+=d[i];
}

for(i=0;i<res;i++)
for(j=0;j<des;j++)
{
printf("Enter the cost %d %d :",i,j );
scanf("%d",&cost[i][j]);
}
//data entry complete

//vam method starts
if(sumreq==sumdes)
{

while(count<res+des-1&&sumdes!=0)
{
//Finding row panalties
for(i=0;i<res;i++)
{
if(s[i]==0)
{
rowpanl[i]=-2;
continue;
}
min1=min2=10000;
for(j=0;j<des;j++)
{
if(d[j]==0)
continue;
if(min1>=cost[i][j])
{
min1=cost[i][j];
p=j;
}
}
for(j=0;j<des;j++)
{
if(d[j]==0||p==j)
continue;
if(min2>=cost[i][j])
{
min2=cost[i][j];
}
}
if(min2!=10000)
rowpanl[i]=min2-min1;
else
rowpanl[i]=min1;
}
//row panalties founded\

//Finding column panalties
for(j=0;j<des;j++)
{
if(d[j]==0)
{
colpanl[j]=-2;
continue;
}
min1=min2=10000;
for(i=0;i<res;i++)
{
if(s[i]==0)
continue;
if(min1>=cost[i][j])
{
min1=cost[i][j];
p=i;
}
}
for(i=0;i<res;i++)
{
if(s[i]==0||p==i)
continue;
if(min2>=cost[i][j])
{
min2=cost[i][j];
}
}
if(min2!=10000)
colpanl[j]=min2-min1;
else
colpanl[j]=min1;
}
//column panalties founded
//maximum Row Panality
max1=p=-1;
for(i=0;i<res;i++)
{
if(max1<rowpanl[i])
{
max1=rowpanl[i];
p=i;
}
else if(max1==rowpanl[i])//if tie in maximum panalty
{
min1=min2=10000;
for(j=0;j<des;j++)
{
if(d[j]==0)
continue;
if(min1>cost[i][j])
{
min1=cost[i][j];
r1=i;
c1=j;
}
if(min2>cost[p][j])
{
min2=cost[p][j];
r2=p;
c2=j;
}
}
//Comparing minimum cost
if(min2>min1)
{
max1=rowpanl[i];
p=i;
}
else if(min1==min2)// Tie in minimum costs
{
a1=s[r1]<d[c1]?s[r1]:d[c1];
a2=s[r2]<d[c2]?s[r2]:d[c2];
if(a2<a1) // choosing maximum allocation
{
max1=rowpanl[i];
p=i;
}
else if(a2==a1)//tie in allocation
{
if(r1+c1<r2+c2) //breaking tie
{
max1=rowpanl[i];
p=i;
}
}
}
}
}
//max row panality founded
//maximum Column Panality
max2=q=-1;
for(i=0;i<des;i++)
{
if(max2<colpanl[i])
{
max2=colpanl[i];
q=i;
}
else if(max2==colpanl[i])//if tie in maximum panalty
{
min1=min2=10000;
for(j=0;j<res;j++)
{
if(s[j]==0)
continue;
if(min1>cost[j][i])
{
min1=cost[j][i];
r1=j;
c1=i;
}
if(min2>cost[j][q])
{
min2=cost[j][q];
r2=j;
c2=q;
}
}
//Comparing minimum cost
if(min2>min1)
{
max2=colpanl[i];
q=i;
}
else if(min1==min2)// Tie in minimum costs
{
a1=s[r1]<d[c1]?s[r1]:d[c1];
a2=s[r2]<d[c2]?s[r2]:d[c2];
if(a2<a1) // choosing maximum allocation
{
max2=colpanl[i];
q=i;
}
else if(a2==a1)//tie in allocation
{
if(r1+c1<r2+c2) //breaking tie
{
max2=colpanl[i];
q=i;
}
}
}
}
}
//max column panality founded
//comparing row and column panalties to find maximum panalty
if(max1>max2)
{
min1=10000;
q=0;
for(j=0;j<des;j++)
{
if(d[j]==0)
continue;
if(min1>cost[p][j])
{
min1=cost[p][j];
q=j;
}
}
}
else if(max1==max2)
{
min1=min2=10000;
r1=p;
c2=q;
for(i=0;i<des;i++)
{
if(d[i]==0)
continue;
if(min1>cost[p][j])
{
min1=cost[p][j];
c1=j;
}
}
for(j=0;j<res;j++)
{
if(s[j]==0)
continue;
if(min2>cost[j][q])
{
min2=cost[j][q];
r2=j;
}
}
if(min1<min2)
{
p=r1;
q=c1;
}
else if(min2<min1)
{
p=r2;
q=c2;
}
else //tie condition
{
a1=s[r1]<d[c1]?s[r1]:d[c1];
a2=s[r2]<d[c2]?s[r2]:d[c2];
if(a1>a2) // choosing maximum allocation
{
p=r1;
q=c1;
}
else if(a2>a1)
{
p=r2;
q=c2;
}
else if(a2==a1)//tie in allocation
{
if(r1+c1<r2+c2) //breaking tie
{
p=r1;
q=c1;
}
else
{
p=r2;
q=c2;
}
}
}

}
else // when max1<max2
{
min1=10000;
p=0;
for(j=0;j<res;j++)
{
if(s[j]==0)
continue;
if(min1>cost[j][q])
{
min1=cost[j][q];
p=j;
}
}
}
// comparing Complete
if(s[p]<d[q])
{
cell[p][q]=s[p];
d[q]=d[q]-s[p];
sumdes=sumdes-s[p];
s[p]=0;
}
else
{
cell[p][q]=d[q];
s[p]=s[p]-d[q];
sumdes=sumdes-d[q];
d[q]=0;
}
count++;
}

//method completed
//output
for(i=0;i<res;i++)
for(j=0;j<des;j++)
{
if(cell[i][j]!=-1)
{
printf("x[%d][%d]=%d ",i,j,cell[i][j]);
total+=cell[i][j]*cost[i][j];
}
}
printf("\nTotal transportation cost is %d",total);

}
else
printf("Not a balanced problem");
getch();
}

North West Corner Method in transportation problem

2011-09-30T22:47:00.000+05:30

//North West Corner Method in transportation problem
#include<stdio.h>
main()
{
int res,des,*s,*d,**cell,**cost,i,j,sumreq=0,sumdes=0,c=0,total=0;
printf("Enter number of resources: ");
scanf("%d",&res);
printf("Enter the number of destinations: ");
scanf("%d",&des);

//memory allocation
s=(int *)malloc(res*sizeof(int));
d=(int *)malloc(des*sizeof(int));
cell=(int **)malloc(res*sizeof(int *));
for(i=0;i<res;i++)
cell[i]=(int *)malloc(des*sizeof(int));
cost=(int **)malloc(res*sizeof(int *));
for(i=0;i<res;i++)
cost[i]=(int *)malloc(des*sizeof(int));

for(i=0;i<res;i++)
for(j=0;j<des;j++)
cell[i][j]=-1;
//memory allocated

//data entering
for(i=0;i<res;i++)
{
printf("Enter the %dth resource availability: ",i+1);
scanf("%d",&s[i]);
sumreq+=s[i];
}

for(i=0;i<des;i++)
{
printf("Enter the %dth destination requirement: ",i+1);
scanf("%d",&d[i]);
sumdes+=d[i];
}

for(i=0;i<res;i++)
for(j=0;j<des;j++)
{
printf("Enter the cost %d %d :",i,j );
scanf("%d",&cost[i][j]);
}
//data entry complete

//nwc method starts
if(sumreq==sumdes)
{
i=0;
j=0;
while(i<res&&j<des)
{
if(s[i]<d[j])
{
cell[i][j]=s[i];
d[j]=d[j]-s[i];
s[i]=s[i]-s[i];
i++;
}
else
{
cell[i][j]=d[j];
s[i]=s[i]-d[j];
d[j]=d[j]-d[j];
j++;
}
}
for(i=0;i<res;i++)
for(j=0;j<des;j++)
{
if(cell[i][j]!=-1)
{
printf("x[%d][%d]=%d ",i,j,cell[i][j]);
total+=cell[i][j]*cost[i][j];
}
}
printf("\nTotal transportation cost is %d",total);
}
else
printf("Not a balanced problem");
getch();
}

Least Cost Entry Method in Transportation Problem

2011-09-30T22:33:00.001+05:30

//Least Cost Entry Method in Transportation Problem
#include<stdio.h>
main()
{
int res,des,*s,*d,**cell,**cost,i,j,p,q,t1,t2,min,sumreq=0,sumdes=0,count=0,total=0;
printf("Enter number of resources: ");
scanf("%d",&res);
printf("Enter the number of destinations: ");
scanf("%d",&des);

//memory allocation
s=(int *)malloc(res*sizeof(int));
d=(int *)malloc(des*sizeof(int));
cell=(int **)malloc(res*sizeof(int *));
for(i=0;i<res;i++)
cell[i]=(int *)malloc(des*sizeof(int));
cost=(int **)malloc(res*sizeof(int *));
for(i=0;i<res;i++)
cost[i]=(int *)malloc(des*sizeof(int));

for(i=0;i<res;i++)
for(j=0;j<des;j++)
cell[i][j]=-1;
//memory allocated

//data entering
for(i=0;i<res;i++)
{
printf("Enter the %dth resource availability: ",i+1);
scanf("%d",&s[i]);
sumreq+=s[i];
}

for(i=0;i<des;i++)
{
printf("Enter the %dth destination requirement: ",i+1);
scanf("%d",&d[i]);
sumdes+=d[i];
}

for(i=0;i<res;i++)
for(j=0;j<des;j++)
{
printf("Enter the cost %d %d :",i,j );
scanf("%d",&cost[i][j]);
}
//data entry complete

//lcem method starts
if(sumreq==sumdes)
{
i=j=0;
while(count<res+des-1)
{
min=10000;
for(p=0;p<res;p++)
{
if(s[p]==0)
continue;
for(q=0;q<des;q++)
{
if(d[q]==0)
continue;
if(min>cost[p][q])
{
min=cost[p][q];
i=p;
j=q;
}
else if(min==cost[p][q]) //handling Same cost
{
t1=s[i]<d[j]?s[i]:d[j];
t2=s[p]<d[q]?s[p]:d[q];

if(t2>t1)
{
min=cost[p][q];
i=p;
j=q;
}
}
}
}
if(s[i]<d[j])
{
if(s[i]!=-1)
{
cell[i][j]=s[i];
d[j]=d[j]-s[i];
s[i]=s[i]-s[i];
}
else //Degenrate Basic Variable
{
cell[i][j]=0;
s[i]=0;
}
}
else if(s[i]==d[j]) //Degenracy Problem Exit
{
cell[i][j]=s[i];
d[j]=d[j]-s[i];
s[i]=-1; //Handling Degenrate Problem
}
else
{
cell[i][j]=d[j];
s[i]=s[i]-d[j];
d[j]=d[j]-d[j];
}
count++;
}
//method completed

//output
for(i=0;i<res;i++)
for(j=0;j<des;j++)
{
if(cell[i][j]!=-1)
{
printf("x[%d][%d]=%d ",i,j,cell[i][j]);
total+=cell[i][j]*cost[i][j];
}
}
printf("\nTotal transportation cost is %d",total);

}
else
printf("Not a balanced problem");
getch();
}

To implement Simplex method in LPP

2011-09-14T17:40:00.000+05:30

//To implement Simplex method in LPP

#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
int main()
{
int m,n,i,j,k;
float **a,**B,*cj,*b,*zj,**t,*cb,*x,z=0,*sol;
int *basic,check=0;
void inverse(float **t,float **B,float *b,float *x,float **a,int *basic,int m,int n);
void findzj(float *zj,float **t,float *cb,float *cj,int m ,int n);
void print(float **t,float *zj,float *cj,float *cb, float *b,int *basic,int m,int n);
int checkoptmlty(float *zj,int *basic,float **t,int m,int n);
void gettingoptmlty(float **t,float *zj,float *b,float *cb,float *cj,int *basic,int m,int n);
int alternate(float **t,float *zj,float *b,float *cb,float *cj,int *basic,int m,int n);
printf("\nEnter the number of variable and number of constraints:");
scanf("%d%d",&n,&m);

/* allocating memory*/
a=(float**)malloc(m*sizeof(int *));
for(i=0;i<m;i++)
a[i]=(float *)malloc(n*sizeof(float));

t=(float**)malloc(m*sizeof(int *));
for(i=0;i<m;i++)
t[i]=(float *)malloc(n*sizeof(float));

cj=(float*)malloc(n*sizeof(float));
zj=(float*)malloc(n*sizeof(float));

B=(float**)malloc(m*sizeof(int *));
for(i=0;i<m;i++)
B[i]=(float *)malloc(m*sizeof(float));

b=(float*)malloc(m*sizeof(float));
x=(float*)malloc(m*sizeof(float));
cb=(float*)malloc(m*sizeof(float));
basic=(int*)malloc(m*sizeof(int));
sol=(float*)malloc(n*sizeof(float));
/*memory allocated*/

printf("\nEnter the coefficients of variables in objective function\n");
for(i=0;i<n;i++)
scanf("%f",&cj[i]);

for(i=0;i<m;i++)
{
printf("\nEnter the coefficients of variables in constraints\n");
for(j=0;j<n;j++)
scanf("%f",&a[i][j]);
printf("\nEnter the RHS variables \n");
scanf("%f",&x[i]);
}

printf("\nPlease enter %d the basic variables: you can enter only from ",m);
for(i=0;i<n;i++)
printf(" %d ",i+1);
printf("\n");
for(i=0;i<m;i++)
{
scanf("%d",&basic[i]);
basic[i]=basic[i]-1;
}

for(i=0;i<m;i++)
cb[i]=cj[basic[i]];

for(i=0;i<n;i++)
sol[i]=0;

inverse(t,B,b,x,a,basic,m,n);
findzj(zj,t,cb,cj,m,n);
print(t,zj,cj,cb,b,basic,m,n);

while(check==0)
{
check=checkoptmlty(zj,basic,t,m,n);
if(check==0)
{
printf("\nOptimility is not achieved.\n");
gettingoptmlty(t,zj,b,cb,cj,basic,m,n);
inverse(t,B,b,x,a,basic,m,n);
findzj(zj,t,cb,cj,m,n);
print(t,zj,cj,cb,b,basic,m,n);
}
}
printf("\noptimal solution acheived is at :");
for(i=0;i<m;i++)
sol[basic[i]]=b[i];
for(i=0;i<n;i++)
{
printf(" %.2f",sol[i]);
z+=cj[i]*sol[i];
}
printf("\n and solution is :%f",z);
//checking alternate solution
if(alternate(t,zj,b,cb,cj,basic,m,n)==1)
{
inverse(t,B,b,x,a,basic,m,n);
findzj(zj,t,cb,cj,m,n);
print(t,zj,cj,cb,b,basic,m,n);
z=0;
for(i=0;i<n;i++)
sol[i]=0;
printf("\noptimal solution acheived is at :");
for(i=0;i<m;i++)
sol[basic[i]]=b[i];
for(i=0;i<n;i++)
{
printf(" %.2f",sol[i]);
z+=cj[i]*sol[i];
}
printf("\n and solution is :%f",z);
}
/* freeing allocated memory*/
free(a);
free(b);
free(B);
free(basic);
free(cj);
free(zj);
free(t);

getch();
}

void inverse(float **t,float **B,float *b,float *x,float **a,int *basic,int m,int n)
{
float *temp,temp1;
int i,j,k;
temp=(float*)malloc(m*sizeof(float));

for(i=0;i<m;i++)
{
for(k=0;k<m;k++)
{
B[i][k]=a[i][basic[k]];
}
}

for(i=0;i<m;i++)
{
b[i]=x[i];
}

for(i=0;i<m;i++)
for(j=0;j<n;j++)
t[i][j]=a[i][j];

for(i=0;i<m;i++)
{
for(k=0;k<m;k++)
{
if(k!=i)
{
for(j=0;j<m;j++)
{
if(B[i][j]==B[k][j])
continue;
else
break;
}
if(j==m)
{
printf("\nDuplicate row\n");
getch();
exit(0);
}
}
}

if(B[i][i]==0)
{
for(k=i+1;k<m;k++)
{
if(B[k][i]!=0)
{
for(j=0;j<m;j++)
{
temp1=B[i][j];
B[i][j]=B[k][j];
B[k][j]=temp1;
}
temp1=b[i];
b[i]=b[k];
b[k]=temp1;
for(j=0;j<n;j++)
{
temp1=t[i][j];
t[i][j]=t[k][j];
t[k][j]=temp1;
}
break;
}
}
if(k==n)
{
printf("\nInvalid entry\n");
getch();
exit(0);
}
}

temp1=B[i][i];
b[i]=(float)b[i]/temp1;
for(j=0;j<n;j++)
{
if(j<m)
{
B[i][j]=(float)B[i][j]/temp1;
}
t[i][j]=(float)t[i][j]/temp1;
}

for(j=0;j<m;j++)
{
if(j!=i)
{
temp[j]=B[j][i];
}
}

for(k=0;k<m;k++)
{
for(j=0;j<n;j++)
{
if(k!=i)
{
if(j<m)
{ B[k][j]=B[k][j]-(temp[k]*B[i][j]); }
t[k][j]=t[k][j]-(temp[k]*t[i][j]);
}
}
if(k!=i)
b[k]=b[k]-(temp[k]*b[i]);
}
}
free(temp);
}

void findzj(float *zj,float **t,float *cb,float *cj,int m ,int n)
{
int i,j ;
for(i=0;i<n;i++)
{
zj[i]=0;
for(j=0;j<m;j++)
zj[i]+=cb[j]*t[j][i];
zj[i]=zj[i]-cj[i];
}
}

void print(float **t,float *zj,float *cj,float *cb, float *b,int *basic,int m,int n)
{
int i,j;
printf("\n \t\t object func");
for(i=0;i<n;i++)
printf("\t%.2f",cj[i]);
printf("\n");

printf("\n \tCb\tbasis\txb");
for(i=0;i<n;i++)
printf("\tx%d",i+1);
printf("\n");

for(i=0;i<m;i++)
{
printf("\t%.2f\tx%d",cb[i],basic[i]+1);
printf("\t%.2f",b[i]);
for(j=0;j<n;j++)
printf("\t%.2f",t[i][j]);
printf("\n");
}
printf("\t\tzj-cj\t");
for(i=0;i<n;i++)
printf("\t%.2f",zj[i]);
}

int checkoptmlty(float *zj,int *basic,float **t,int m,int n)
{
int i,j,check;
// checking unboundedness
for(i=0;i<n;i++)
{
check=0;
for(j=0;j<m;j++)
{
if(i==basic[j])
{
check=1;
break;
}
}
if(check==1)
continue;
for(j=0;j<m;j++)
{
if(t[j][i]>0)
break;
}
if(j==m && zj[i]!=0)
{
printf("\n Feasible region is unbounded");
if(zj[i]<0)
{
printf("\n solution is unbounded");
}
getch();
exit(0);
}
}
for(i=0;i<n;i++)
{
if(zj[i]<0)
return 0;
}
//checking complete
return 1;
}

void gettingoptmlty(float **t,float *zj,float *b,float *cb,float *cj,int *basic,int m,int n)
{
float temp,*p,min,check=0;
int i,j,loc,ploc=0;

p=(float*)malloc(m*sizeof(float));

min=0;
loc=0;
for(i=0;i<n;i++)
{
if(zj[i]==0)
continue;
else if(zj[i]<min)
{
min=zj[i];
loc=i;
}
}
for(i=0;i<m;i++)
{
if(t[i][loc]<=0)
p[i]=0;
else
p[i]=b[i]/t[i][loc];
}
min=1000;
for(i=0;i<m;i++)
{
if(p[i]==0)
continue;
else
{
min=p[i];
ploc=i;
check=1;
break;
}
}
if(check==0)
{
printf("\n Feasible region is unbounded");
getch();
exit(0);
}
for(i=0;i<m;i++)
{
if(p[i]<min && p[i]!=0)
{
min=p[i];
ploc=i;
}
}

printf("\n %.1f is selected as pivot element\n",t[ploc][loc]);
basic[ploc]=loc;
cb[ploc]=cj[loc];
}

int alternate(float **t,float *zj,float *b,float *cb,float *cj,int *basic,int m,int n)
{
float temp,*p,min;
int i,j,loc,ploc=0,check;

p=(float*)malloc(m*sizeof(float));

// checking alternate solution
for(i=0;i<n;i++)
{
check=0;
for(j=0;j<m;j++)
{
if(i==basic[j])
{
check=1;
break;
}
}
if(check==1)
continue;

if(zj[i]==0)
{
for(j=0;j<m;j++)
{
if(t[j][i]>0)
break;
}
if(j!=m)
{
printf("\nalternate solution exits;");
loc=i;

for(i=0;i<m;i++)
{
if(t[i][loc]<=0)
p[i]=0;
else
p[i]=b[i]/t[i][loc];
}

min=0;
for(i=0;i<m;i++)
{
if(p[i]==0)
continue;
else
{
min=p[i];
ploc=i;
break;
}
}
for(i=0;i<m;i++)
{
if(p[i]<min && p[i]!=0)
{
min=p[i];
ploc=i;
}
}
printf("\n %.1f is selected as pivot element\n",t[ploc][loc]);
basic[ploc]=loc;
cb[ploc]=cj[loc];
return 1;
}
}

}
return 0;
}

Find the inverse of given matrix using malloc function

2011-09-11T22:21:00.000+05:30

#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
int main()
{
float **a,*temp,temp1;
int i,j,k,n;
float **b;
printf("enter the order of matrix:");
scanf("%d",&n);

a=(float**)malloc(n*sizeof(float *));
for(i=0;i<n;i++)
a[i]=(float *)malloc(n*sizeof(float));
b=(float**)malloc(n*sizeof(float *));
for(i=0;i<n;i++)
b[i]=(float *)malloc(n*sizeof(float));
temp=(float *)malloc(n*sizeof(float));
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(j==i)
b[i][i]=1;
else
b[i][j]=0;
}
}

printf("\n Enter the matrix\n");
for(i=0;i<n;i++)
{
printf("\nEnter the %dth row \n",i);
for(j=0;j<n;j++)
{
scanf("%f",&a[i][j]);
}
}

printf("\nEntered a matrix:\n");
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
printf(" %.2f",a[i][j]);
}
printf("\n");
}

for(i=0;i<n;i++)
{
for(k=0;k<n;k++)
{
if(k!=i)
{
for(j=0;j<n;j++)
{
if(a[i][j]==a[k][j])
continue;
else
break;
}
if(j==n)
{
printf("\nDuplicate row\n");
getch();
exit(0);
}
}
}

if(a[i][i]==0)
{
for(k=i+1;k<n;k++)
{
if(a[k][i]!=0)
{
for(j=0;j<n;j++)
{
temp1=a[i][j];
a[i][j]=a[k][j];
a[k][j]=temp1;
temp1=b[i][j];
b[i][j]=b[k][j];
b[k][j]=temp1;
}

break;
}
}
if(k==n)
{
printf("\nInvalid entry\n");
getch();
exit(0);
}
}

temp1=a[i][i];
for(j=0;j<n;j++)
{
a[i][j]=a[i][j]/temp1;
b[i][j]=b[i][j]/temp1;
}

for(j=0;j<n;j++)
{
if(j!=i)
{
temp[j]=a[j][i];
}
}

for(k=0;k<n;k++)
{
for(j=0;j<n;j++)
{
if(k!=i)
{
a[k][j]=a[k][j]-(temp[k]*a[i][j]);
b[k][j]=b[k][j]-(temp[k]*b[i][j]);
}
}
}

}

printf("\n Inverse matrix:\n");
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
printf(" %.2f",b[i][j]);
}
printf("\n");
}
printf("\n matrix A after calculation:\n");
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
printf(" %.2f",a[i][j]);
}
printf("\n");
}

getch();
}

Write a code to solve josephus problem in linked list.

2011-08-31T18:09:00.000+05:30

//Write a code to solve josephus problem in linked list.
#include<stdio.h>
#include<stdlib.h>
#include<conio.h>
struct node
{
int data;
struct node *next;
};
main()
{
struct node *start=NULL;
int n;
void create(struct node **, int);
void josephus(struct node *);
printf("Enter the number of elements you want in your linked list :");
scanf("%d",&n);
create(&start,n);
josephus(start);
getch();
}

void create(struct node **start,int n)
{
int i;
struct node *lst;
struct node *p;
lst=NULL;
for(i=1;i<=n;i++)
{
p=(struct node *)malloc(sizeof(struct node));
printf("Enter the %d element :",i);
scanf("%d",&(p->data));
if(*start==NULL)
*start=p;
else
lst->next=p;
lst=p;
p->next=*start;
}
}

void josephus(struct node *start)
{
struct node *temp,*p;
int n,count;
printf("\nwhich element you want to delete in josephus problem");
scanf("%d",&n);
while(start->next!=start)
{
count=1;
p=start;
while(count<=n-2)
{
p=p->next;
count++;
}
temp=p->next;
p->next=temp->next;
free(temp);
start=p->next;
}
printf("the last item in josephus problem is %d",start->data);

}

Write a code to create Double Linked List.

2011-08-31T18:06:00.000+05:30

//Write a code to create Double Linked List.
#include<stdio.h>
#include<stdlib.h>
struct node
{
int data;
struct node *prev;
struct node *next;
};
main()
{
struct node *start=NULL,*end=NULL;
int n;
void create(struct node **,struct node **,int);
void show(struct node *,struct node *);
void insert_before(struct node **start);
struct node* search_bitem(struct node *start,int item);
printf("Enter the number of elements you want in your linked list :");
scanf("%d",&n);
create(&start,&end,n);
show(start,end);
insert_before(&start);
show(start,end);
getch();
}

void create(struct node **start,struct node **end,int n)
{
int i;
struct node *lst;
struct node *p;
lst=NULL;
for(i=1;i<=n;i++)
{
p=(struct node *)malloc(sizeof(struct node));
printf("Enter the %d element :",i);
scanf("%d",&(p->data));
p->next=NULL;
p->prev=NULL;
if(*start==NULL)
*start=p;
else
{
lst->next=p;
p->prev=lst;
}
lst=p;
}
*end=lst;
}

void show(struct node *start,struct node *end)
{
struct node *t;
t=start;
printf("Forwared traversing :\n");
while(t!=NULL)
{
printf(" %d\n",t->data);
t=t->next;
}

t=end;
printf("\nBackward traversing :\n");
while(t!=NULL)
{
printf(" %d\n",t->data);
t=t->prev;
}
}

void insert_before(struct node **q)
{
struct node *p,*loc;
int item;
printf("Enter the item before which new element is to be inserted ");
scanf("%d",&item);
if(*q==NULL)
{
printf("\nItem before which element is to be inserted is not in the list");
return;
}

p=(struct node *)malloc(sizeof(struct node));
printf("Enter the element to be inserted ");
scanf("%d",&(p->data));
p->next=NULL;
p->prev=NULL;

if(item==(*q)->data)
{
(*q)->prev=p;
p->next=*q;
*q=p;
}
else
{
loc=(struct node *)search_bitem(*q,item);
if(loc==NULL)
printf("\nItem before which element is to be inserted is not in the list");
else
{
p->next=loc->next;
p->prev=loc;
(loc->next)->prev=p;
loc->next=p;
}
}
}

struct node* search_bitem(struct node *start,int item)
{
struct node *prev,*ptr;
ptr=start;
prev=ptr;
ptr=ptr->next;
while(ptr!=NULL)
{
if(item==(ptr->data))
return prev;
prev=ptr;
ptr=ptr->next;
}
return NULL;
}

Create a circular linked list.

2011-08-31T18:05:00.000+05:30

//Create a circular linked list.
#include<stdio.h>
#include<stdlib.h>
#include<conio.h>
struct node
{
int data;
struct node *next;
};
main()
{
struct node *start=NULL;
int n;
void create(struct node **, int);
void show(struct node *);
printf("Enter the number of elements you want in your linked list :");
scanf("%d",&n);
create(&start,n);
show(start);
getch();
}

void create(struct node **start,int n)
{
int i;
struct node *lst;
struct node *p,*head;
head=(struct node *)malloc(sizeof(struct node));
*start=head;
head->next=head;
lst=NULL;
for(i=1;i<=n;i++)
{
p=(struct node *)malloc(sizeof(struct node));
printf("Enter the %d element :",i);
scanf("%d",&(p->data));
p->next=*start;
if((*start)->next==*start)
(*start)->next=p;
else
lst->next=p;
lst=p;
}
}

void show(struct node *start)
{
struct node *temp;
printf("Entered linked list is :\n");
temp=start->next;
while(temp!=start)
{
printf(" %d\n",temp->data);
temp=temp->next;
}
}

How to find majority element in array without using backtracking method.

2011-08-31T18:01:00.000+05:30

//How to find majority element in array without using backtracking method.
#include<stdio.h>
main()
{
int *p,*q,n,i,j,c=0,f,fl=0;
printf("Enter the number of elments you want in your array list: ");
scanf("%d",&n);
p=(int *)malloc(n*sizeof(int));
q=(int *)malloc(n*sizeof(int));
printf("\n Enter the value of array elements \n");
for(i=0;i<n;i++)
{
scanf("%d",&p[i]);
q[i]=p[i];
}

for(i=0;i<=n/2;i++)
{
c=1;
if(p[i]==-1000)
continue;
for(j=i+1;j<n;j++)
{
if(p[i]==p[j])
{
c=c+1;
p[j]=-1000;
}
}
if(c>(n/2))
{
fl=1;
printf("%d is majority element",p[i]);
break;
}
}
if(fl==0)
printf("no majority element is found");
}

How to find majority element in array using backtracking method.

2011-08-31T18:00:00.000+05:30

//How to find majority element in array using backtracking method.
#include<stdio.h>
main()
{
int *p,n,i,j,c=0,f,fl=0;
printf("Enter the number of elments you want in your array list: ");
scanf("%d",&n);
p=(int *)malloc(n*sizeof(int));
printf("\n Enter the value of array elements \n");
for(i=0;i<n;i++)
scanf("%d",&p[i]);

for(i=0;i<=n/2;i++)
{
f=0;
c=0;
for(j=0;j<i;j++)
{
if(p[i]==p[j])
{
f=1;
break;
}
}
if(f==1)
continue;
c=1;
for(j=i+1;j<n;j++)
{
if(p[i]==p[j])
{
c=c+1;
}
}
if(c>(n/2))
{
fl=1;
printf("%d is majority element",p[i]);
break;
}
}
if(fl==0)
printf("no majority element is found");
}

How to create linked list(self referential structure) and perform insert operaton on it.

2011-08-31T17:54:00.002+05:30

//How to create linked list(self referential structure) and perform insert operaton on it.
#include<stdio.h>
#include<stdlib.h>
struct node
{
int data;
struct node *next;
};
main()
{
struct node *p;
char c;
int n;
void create(struct node **, int);
void show(struct node *);
void insert(struct node **);
p=NULL;
printf("Enter the elements you want in your linked list :");
scanf("%d",&n);
create(&p,n);
show(p);
fflush(stdin);
printf("\nWould you like to insert element in the begining of linked list Y/N:");
scanf(" %c",&c);
if(c=='y'||c=='Y')
{
insert(&p);
show(p);
}
}
void create(struct node **q,int n)
{
int i;
struct node *lst;
struct node *p;
lst=NULL;
for(i=1;i<=n;i++)
{
p=(struct node *)malloc(sizeof(struct node));
printf("Enter the %d element :",i);
scanf("%d",&(p->data));
p->next=NULL;
if(*q==NULL)
*q=p;
else
lst->next=p;
lst=p;
}
}
void show(struct node *start)
{
printf("Entered linked list is :\n");
while(start!=NULL)
{
printf(" %d\n",start->data);
start=start->next;
}
}
void insert(struct node **q)
{
struct node *p;
struct node *start;
start=*q;
p=(struct node *)malloc(sizeof(struct node));
printf("Enter the element to be inserted ");
scanf("%d",&(p->data));
p->next=start;
*q=p;
}

How to traverse the array using C++.

2011-08-31T17:52:00.000+05:30

//How to traverse the array using C++.
#include<iostream.h>
#include<conio.h>
void main()
{
int i, k, data[50], n, lb, ub;
clrscr();
cout<<endl<<"Enter the number of elements in the array:";
cin>>n;
cout<<endl<<"Enter the value of "<<n<<" elements:";
for(i=0; i<n; i++)
{
cin>>data[i];
}
lb=0;
ub=n-1;
for(k=lb; k<=ub; k++)
{
cout<<endl<<k<<" element is "<<data[k];
}
getch();
}

How to calculate Sum of two matrix using C++.

2011-08-27T18:06:00.000+05:30

//How to calculate Sum of two matrix using C++.
#include<iostream.h>
#include<conio.h>
void main()
{
int a[10][10], b[10][10] , c[10][10];
int i, j, m, n;
clrscr();
cout<<endl<<"enter the order of matrix a and b: ";
cin>>m>>n;
cout<<endl<<"Elements of a matrix:";
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
cin>>a[i][j];
}
}
cout<<endl<<"Elements of b matrix:";
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
cin>>b[i][j];
}
}
cout<<endl<<" a matrix is :"<<endl;
for(i=0;i<m;i++)
{
cout<<endl;
for(j=0;j<n;j++)
{
cout<<" "<<a[i][j];
}
}
cout<<endl<<" b matrix is :"<<endl;
for(i=0;i<m;i++)
{
cout<<endl;
for(j=0;j<n;j++)
{
cout<<" "<<b[i][j];
}
}
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
c[i][j]=a[i][j] + b[i][j];
}
}
cout<<endl<<"Sum of two matrix is:"<<endl;
for(i=0;i<m;i++)
{
cout<<endl;
for(j=0;j<n;j++)
{
cout<<" "<<c[i][j];
}
}
getch();
}

How to sort an array using selection sort in C++.

2011-08-27T18:05:00.001+05:30

//Program to sort an array using selection sort in C++.
#include<iostream.h>
#include<conio.h>
void main()
{
int a[50], n, temp, k , loc, i;
int min, j;
clrscr();
cout<<endl<<"Enter the number of elements in array: ";
cin>>n;
cout<<endl<<"The array :";
for (i=0;i<n;i++)
{
cin>>a[i];
}
for (k=0; k<n-1; k++)
{
min=a[k];
loc=k;
for (j=k+1; j<n; j++)
{
if(min>a[j])
{
min=a[j];
loc=j;
}
}
temp=a[k];
a[k]=a[loc];
a[loc]=temp;
}
cout<<endl<<"The sorted array is: ";
for (i=0; i<n; i++)
{
cout<<a[i]<<endl;
}
getch();
}

Program to sort an array using Radix sort in C++.

2011-08-27T18:04:00.001+05:30

//Program to sort an array using Radix sort in C++.
#include<iostream.h>
#include<conio.h>
void main()
{
int a[50],i,n;
void radixsort(int[],int);
clrscr();
cout<<endl<<" Enter the number of elements in array: ";
cin>>n;
cout<<endl<<"enter the elements of array: ";
for(i=0;i<n;i++)
{
cin>>a[i];
}
radixsort(a,n);
cout<<endl<<"The sorted array is as follow:"<<endl;
for(i=0;i<n;i++)
{
cout<<a[i]<<" ";
}
getch();
}
void radixsort(int a[],int n)
{
int bucket[10][20],bucketcount[10];
int i,j,k,r,digitcount=0,divisor=1,largest,passno;
largest=a[0];
for(i=0;i<n;i++)
{
if(a[i]>largest)
{
largest=a[i];
}
}
while(largest>0)
{
digitcount++;
largest=largest/10;
}
for(passno=0;passno<digitcount;passno++)
{
for(k=0;k<10;k++)
{
bucketcount[k]=0;
}
for(i=0;i<n;i++)
{
r=(a[i]/divisor)%10;
bucket[r][bucketcount[r]++]=a[i];
}
i=0;
for(k=0;k<10;k++)
{
for(j=0;j<bucketcount[k];j++)
{
a[i]=bucket[k][j];
i++;
}
}
divisor=divisor*10;
}
}

Program to calculate multiplication of two matrix using C++.

2011-08-27T18:02:00.000+05:30

//Program to calculate multiplication of two matrix using C++.
#include<iostream.h>
#include<conio.h>
void main()
{
int a[10][10],b[10][10],c[10][10],i,j,k;
int m, n, p, q;
clrscr();
cout<<endl<<"Enter the number of rows in A matrix: ";
cin>>m;
cout<<endl<<"Enter the number of columns in A matrix: ";
cin>>n;
cout<<endl<<"Enter the number of rows in B matrix: ";
cin>>p;
cout<<endl<<"Enter the number of rows in B matrix: ";
cin>>q;
if(n==p)
{
cout<<endl<<"Elements of a matrix:";
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
cin>>a[i][j];
}
}
cout<<endl<<"Elements of b matrix:";
for(i=0;i<p;i++)
{
for(j=0;j<q;j++)
{
cin>>b[i][j];
}
}
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]+=a[i][k]*b[k][j];
}
}
}
cout<<endl<<" a matrix: "<<endl;
for(i=0;i<m;i++)
{
cout<<endl;
for(j=0;j<n;j++)
{
cout<<" "<<a[i][j];
}
}
cout<<endl<<" b matrix:"<<endl;
for(i=0;i<p;i++)
{
cout<<endl;
for(j=0;j<q;j++)
{
cout<<" "<<b[i][j];
}
}
cout<<endl<<" mul of two matrix"<<endl;
for(i=0;i<m;i++)
{
cout<<endl;
for(j=0;j<q;j++)
{
cout<<" "<<c[i][j];
}
}
}
else
{
cout<<endl<<"Multiplication is not possible ";
}
getch();
}

Program to find sum of each row and column and total of matrix.

2011-08-27T18:00:00.000+05:30

//Program to find sum of each row and column and total of matrix.
#include<iostream.h>
#include<iomanip.h>
#include<conio.h>
void main()
{
int a[10][10],i,j, m, n;
clrscr();
cout<<endl<<" Enter the rows of matrix: ";
cin>>m;
cout<<endl<<"Enter the column of matrix: ";
cin>>n;
cout<<endl<<"Elements of a matrix:";
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
cin>>a[i][j];
}
}
for(i=0; i<m; i++)
{
a[i][n]=0;
for(j=0; j<n; j++)
{
a[i][n]+=a[i][j];
}
}
for(j=0; j<n; j++)
{
a[m][j]=0;
for (i=0; i<m; i++)
{
a[m][j]+=a[i][j];
}
}
a[m][n]=0;
for(i=0; i<m ; i++)
{
a[m][n]+=a[i][n];
}
cout<<endl<<" a matrix is :"<<endl;
for(i=0;i<m+1;i++)
{
cout<<endl;
for(j=0;j<n+1;j++)
{
cout<<setw(5)<<" "<<a[i][j];
}
}
getch();
}

How to linearly search an element in array using C++.

2011-08-27T17:57:00.000+05:30

//Program to linearly search an element in array using C++.
#include<iostream.h>
#include<conio.h>
void main()
{
int i, k, loc, item, data[50], n;
clrscr();
cout<<"Enter the number of elements in the array:";
cin>>n;
cout<<"Enter the value of "<<n<<" elements:";
for(i=0; i<n; i++)
{
cin>>data[i];
}
loc=-1;
cout<<endl<<"Enter the given element";
cin>>item;
for(k=0; k<n; k++)
{
if(data[k]==item)
{
loc=k;
}
}
if(loc==-1)
{
cout<<endl<<"Given element is not present";
}
else
{
cout<<endl<<"Given element is present at location="<<loc;
}
getch();
}

How to find the Largest element in array using C++.

2011-08-27T17:52:00.000+05:30

//Program to find the Largest element in array using C++.
#include<iostream.h>
#include<conio.h>
void main()
{
int i, k, loc, max, data[50], n;
clrscr();
cout<<endl<<"Enter the number of elements in the array:";
cin>>n;
cout<<endl<<"Enter the value of "<<n<<" elements:";
for(i=0; i<n; i++)
{
cin>>data[i];
}
loc=0;
max=data[0];
for(k=0; k<n; k++)
{
if(max<data[k])
{
loc=k;
max=data[k];
}
}
cout<<endl<<"Largest element is "<<max<<" and its location is "<<loc;
getch();
}

How to insert a new element in array using C++.

2011-08-27T17:51:00.000+05:30

//Program to insert a new element in array using C++.
#include<iostream.h>
#include<conio.h>
void main()
{
int i, k, j, item, data[50], n;
clrscr();
cout<<endl<<"Enter the number of elements in the array:";
cin>>n;
cout<<endl<<"Enter the value of "<<n<<" elements:";
for(i=0; i<n; i++)
{
cin>>data[i];
}
cout<<endl<<" Enter the location of item:";
cin>>k;
cout<<endl<<"Enter the value of item:";
cin>>item;
for(j=n-1; j>=k; j--)
{
data[j+1]=data[j];
}
data[k]=item;
n=n+1;
for(i=0;i<n;i++)
{
cout<<endl<<i<<" element is:"<<data[i];
}
getch();
}

Program to create lower triangular matrix.

2011-08-21T17:04:00.000+05:30

//Program to create lower triangular matrix.
#include<stdio.h>
#include<conio.h>
void create(int **t,int n,int r);
void print(int *t,int n);
main()
{
int *a,ele,r;
printf("how many rows you want in lower triangular matrix :");
scanf("%d",&r);
ele=(r*(r+1))/2;
create(&a,ele,r);
print(a,r);
getch();
}
void create(int **t,int n,int r)
{
int p,q,i,j,k,*a,*b,m=0,f,c=0;
printf("\nEnter the element of lower triangular matrix");
a=(int*)malloc(n*sizeof(int));
b=(int*)malloc(n*sizeof(int));
for(p=0;p<n;p++)
{
f=0;
printf("\nEnter the postion row and column of element:");
scanf("%d%d",&i,&j);
if(j>i||i>=r)
{
printf("\nYou have entered the wrong poition of element.Try again");
p=p-1;
continue;
}
k=(i*(i+1))/2+j;
for(q=0;q<m;q++)
{
if(b[q]==k)
{
f=1;
break;
}
}
if(f==1)
{
printf("\nAt the given postion you already entered the data. Do you want to override it? if YES press 1 if NO press 0");
scanf("%d",&c);
p=p-1;
if(c==1)
{
printf("\nEnter the value: ");
scanf("%d",&a[k]);
continue;
}
else
continue;
}
b[m]=k;
m++;
printf("\nEnter the value: ");
scanf("%d",&a[k]);
}
*t=a;
}
void print(int *t,int n)
{
int i,j,k;
for(i=0;i<n;i++)
{
printf("\n");
for(j=0;j<=i;j++)
{
k=(i*(i+1))/2+j;
printf("%d ",t[k]);
}
}
}

BitwiseOperator in java

2011-08-21T17:02:00.000+05:30

//BitwiseOperator in java
class BitwiseOperator

{

public static void main(String arg[])

{

int a=3,b=5,c=-8,d=-2;

System.out.println("a&b= "+(a&b));

System.out.println("a|b= "+(a|b));

System.out.println("a^b= "+(a^b));

System.out.println("~a= "+~a);

System.out.println("a<<1= "+(a<<1));

System.out.println("d<<2= "+(d<<2));

System.out.println("c>>2= "+(c>>2));

System.out.println("c>>>2= "+(c>>>2));

}

How to remove an element in array using C++.

2011-08-21T17:00:00.001+05:30

//How to remove an element in array using C++.
#include<iostream.h>
#include<conio.h>
void main()
{
int i, k, j, item, data[50], n;
clrscr();
cout<<"Enter the number of elements in the array:";
cin>>n;
cout<<endl<<"Enter the value of "<<n<<" elements:";
for(i=0; i<n; i++)
{
cin>>data[i];
}
cout<<endl<<" Enter the location of item to be deleted:";
cin>>k;
for(j=k;j<n-1; j++)
{
data[j]=data[j+1];
}
n=n-1;
for(i=0;i<n;i++)
{
cout<<endl<<i<<" element is:"<<data[i];
}
getch();
}

Program to search an element in array using Binary search in C++.

2011-08-21T16:58:00.002+05:30

//Program to search an element in array using Binary search in C++.
#include<iostream.h>

#include<conio.h>

void main()

{

int i, beg, end, loc, mid, item, data[50], n;

clrscr();

cout<<"Enter the number of elements in the array:";

cin>>n;

cout<<endl<<" Enter the value of "<<n<<" elements:";

for(i=0; i<n; i++)

{

cin>>data[i];

}

beg=0;

end=n-1;

mid=int((beg+end)/2);

cout<<endl<<" Enter the given element";

cin>>item;

while(beg<=end && data[mid]!=item)

{

if(item<data[mid])

{

end=mid-1;

}

else

{

beg=mid+1;

}

mid=int((beg+end)/2);

}

if(data[mid]==item)

{

loc=mid;

cout<<endl<<"Element found at location:"<<loc;

}

else

{

cout<<endl<<"Element is not found";

}

getch();

}

How to Sort array in c++ using Bubble sort.

2011-08-21T16:53:00.002+05:30

//How to Sort array in c++ using Bubble sort.
#include<iostream.h>

#include<conio.h>

void main()

{

int a[40],n,i,t,k;

clrscr();

cout<<endl<<"Enter the no. of element in the array: ";

cin>>n;

cout<<endl<<"Enter the values of "<<n<<" elements: ";

for(i=0;i<n;i++)

{

cin>>a[i];

}

for(k=0;k<n-1;k++)

{

for(i=0;i<n-1-k;i++)

{

if(a[i]>a[i+1])

{

t=a[i];

a[i]=a[i+1];

a[i+1]=t;

}

cout<<endl<<"The sorted array is:";

for(i=0;i<n;i++)

{

cout<<endl<<a[i];

}

getch();

}