Modelling Simuation & Operation Research

CHAROTAR UNIVERSITY OF SCIENCE AND TECHNOLOGY
(CHARUSAT)
Dept. of Information and Technology
IT 304: Modeling Simulation and Operation Research
INDEX
Practical ID
Name
Date of
Assignment
MSOR01
Row
Minima/Maxima
28/07/2012
MSOR02
LCM TP
28/07/2012
MSOR03
NWCM TP
28/07/2012
MSOR04
Dijkstras
Algorithm
28/07/2012
MSOR05
Floyds
Algorithm
28/07/2012
MSOR06
Rank
25/09/2012
MSOR07
Std. Form
25/09/2012
MSOR08
Simplex method
25/09/2012
MSOR09
Random
Number
25/09/2012
Date of
Submission
1/08/2012
to
4/08/2012
1/08/2012
to
4/08/2012
1/08/2012
to
4/08/2012
1/08/2012
to
4/08/2012
1/08/2012
to
4/08/2012
1/10/2012
to
4/10/2012
1/10/2012
to
4/10/2012
1/10/2012
to
4/10/2012
1/10/2012
to
4/10/2012
Remark
Name: AnisAnwarahmedShaikh
Student ID: 10IT102
Semester(Division): 5 (2)
MSOR01
#include<stdio.h>
#include<conio.h>
void main()
{
int a[10][10],i,j,minr=0,maxc,maxr,minc=0,row,col;
clrscr();
printf("\nEnter Matrix row size...");
scanf("%d",&row);
printf("\nEnter Matrix column size...");
scanf("%d",&col);
printf("\nEnter %d*%d Matrix....\n",row,col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
printf("\nEnter element a[%d][%d] : ",i,j);
scanf("%d",&a[i][j]);
}
}
printf("\nYouhaave Entered Matrix is : \n\n");
for(i=0;i<col;i++)
printf("\t");
printf(" RowMin\tRowMax\n\n");
for(i=0;i<row;i++)
{
minr=a[i][0];
maxr=0;
for(j=0;j<col;j++)
{
printf("\t%d",a[i][j]);
if(minr>a[i][j])
minr=a[i][j];
if(maxr< a[i][j])
maxr=a[i][j];
}
printf("\t%d",minr);
printf("\t%d",maxr);
printf("\n");
IT 304: MSOR Practical Assignment
Page 2 of 28
Student ID: 10IT102
}
printf("\nColMin:\t");
for(i=0;i<col;i++)
{
minc=a[0][i];
for(j=0;j<row;j++)
{
if(minc> a[j][i])
minc=a[j][i];
}
printf("%d\t",minc);
}
printf("\n\nColMax:\t");
for(i=0;i<col;i++)
{
maxc=0;
for(j=0;j<row;j++)
{
if(maxc< a[j][i])
maxc=a[j][i];
}
printf("%d\t",maxc);
}
getch();
}
MSOR02
#include<stdio.h>
#include<conio.h>
void main()
{
int
min=0,sum=0,c[20][20],s,d,sp[20],dd[20],i,j,dm[20],r1[20],c1[20],y=0,z=0,x=0,q=0,k
,v;
clrscr();
printf("\nEnter then number of suppliers:\n");
Page 3 of 28
Student ID: 10IT102
scanf("%d",&s);
printf("\nEnter the value of demands:\n");
scanf("%d",&d);
printf("Enter the value of cost of supply per unit:\n");
for(i=0;i<s;i++)
{
for(j=0;j<d;j++)
{
printf("\nEnter the value of cost c[%d][%d]:\n",i+1,j+1);
scanf("%d",&c[i][j]);
}
}
for(i=0;i<s;i++)
{
printf("\nEnter the value of supplier sp[%d] can supply:\n",i+1);
scanf("%d",&sp[i]);
}
for(j=0;j<d;j++)
{
printf("\nEnter the value of supplier dd[%d] can supply:\n",j+1);
scanf("%d",&dd[j]);
}
clrscr();
for(i=0;i<d;i++)
{
if(i==0)
{
printf("\t");
}
printf("d[%d]\t",i+1);
}
printf("\n");
for(i=0;i<s;i++)
{
printf("s[%d]\t",i+1);
for(j=0;j<d;j++)
{
printf("%d\t",c[i][j]);
if(j==(d-1))
Page 4 of 28
Student ID: 10IT102
{
printf("%d\t",sp[i]);
}
}
printf("\n");
}
printf("\t");
for(i=0;i<d;i++)
{
printf("%d\t",dd[i]);
}
i=0;
j=0;
for(i=0;i<s;i++)
{
for(k=0;k<=x;k++)
{
if(r1[k]!=i)
{
for(j=0;j<d;j++)
{
for(v=0;v<=q;v++)
{
if(c1[v]!=j)
{
if(min>c[i][j])
min=c[i][j];
}
}
}
}
}
}
printf("min=%d",min);
if(sp[i]<dd[j])
{
sum=sum+c[i][j]*sp[i];
r1[z]=i;
z++;
Page 5 of 28
Student ID: 10IT102
x=z;
}
else if(dd[i]<sp[j])
{
sum=sum+c[i][j]*dd[j];
c1[y]=j;
y++;
q=y;
}
else
{
sum=sum+c[i][j]*dd[j];
r1[z]=i;
c1[y]=j;
z++;
y++;
x=z;
q=y;
}
printf("\nZ=%d",sum);
getch();
}
MSOR03
/* NWCM - TP */
/* Transportaion Using Balanceing...*/
#include<stdio.h>
#include<conio.h>
void main()
{
int c[20][20],d[20],s[20],row,col,i,j,sum=0,sums=0,sumd=0;
clrscr();
printf("Enter No of Supliers...");
scanf("%d",&row);
printf("Enter No of Demands...");
scanf("%d",&col);
printf("\n Enter Cost matrix of %d * %d...",row,col);
for(i=0;i<row;i++)
Page 6 of 28
Student ID: 10IT102
{
for(j=0;j<col;j++)
{
scanf("%d",&c[i][j]);
}
}
printf("Enter suppliers value...");
for(i=0;i<row;i++)
{
scanf("%d",&s[i]);
sums=sums+s[i];
}
printf("Enter Demands value..");
for(i=0;i<col;i++)
{
scanf("%d",&d[i]);
sumd=sumd+d[i];
}
if(sums <sumd)
{
row++;
s[row-1]=sumd-sums;
for(i=0;i<col;i++)
c[row][i]=0;
}
else if(sums >sumd)
{
col++;
s[col-1]=sums-sumd;
for(i=0;i<row;i++)
c[i][col]=0;
}
printf("Cost Matrix : \n");
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
printf("\t%d",c[i][j]);
}
Page 7 of 28
Student ID: 10IT102
printf("\t%d",s[i]);
printf("\n");
}
for(i=0;i<col;i++)
{
printf("\t%d",d[i]);
}
for(i=0,j=0;i<row,j<col;)
{
if(s[i]>d[j])
{
sum=sum+c[i][j]*d[j];
s[i]=s[i]-d[j];
j++;
}
else if(s[i]<d[j])
{
sum=sum+c[i][j]*s[i];
d[j]=d[j]-s[i];
i++;
}
else
{
sum=sum+c[i][j]*d[i];
i++;
j++;
}
}
printf("\nCost of Transportation = %d",sum);
getch();
}
MSOR04
/* Dijkstras Algorithm */
#include<stdio.h>
#include<conio.h>
void main()
{
Page 8 of 28
Student ID: 10IT102
inti,j,n,min,k=0,m=1000,d[10][10],link[10][10],label[10];
int U[10],u[10];
clrscr();
printf("Enter no. of nodes : ");
scanf("%d",&n);
printf("Enter distances : \n");
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
d[i][j]=0;
printf("Enter d[%d][%d] : ",i+1,j+1);
scanf("%d",&d[i][j]);
link[i][j]=0;
}
U[i]=0;
u[i]=0;
}
label[0]=1;
for(i=0;i<n;i++)
{
min=m;
if(label[i]==1)
{
for(j=0;j<n;j++)
{
if(j!=1)
{
if(d[i][j]>0 && d[i][j]<m)
{
u[j]=U[i]+d[i][j];
}
if(u[j]>0 && u[j]<=min)
{
min=u[j];
k=j;
}
}
Page 9 of 28
Student ID: 10IT102
}
U[k]+=u[k];
label[k]=1;
link[i][k]=1;
for(j=0;j<n;j++)
u[j]=0;
j=0;
}
else
k=0;
}
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(link[i][j]==1 && d[i][j]<m)
printf("\n%d\t %d\t %d",i+1,j+1,U[j]);
}
printf("\n");
}
getch();
}
MSOR05
/*Flyods Algorithm*/
#include<stdio.h>
#include<conio.h>
int min(int,int);
void floyds(int p[10][10],int n)
{
inti,j,k;
for(k=1;k<=n;k++)
{
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
Page 10 of 28
Student ID: 10IT102
if(i==j)
p[i][j]=0;
else
p[i][j]=min(p[i][j],p[i][k]+p[k][j]);
}
}
}
}
int min(inta,int b)
{
if(a<b)
return(a);
else
return(b);
}
void main()
{
int p[10][10],w,var,e,u,v,i,j;;
clrscr();
printf("\n Enter the number of vertices:");
scanf("%d",&var);
printf("\n Enter the number of edges:\n");
scanf("%d",&e);
for(i=1;i<=var;i++)
{
for(j=1;j<=var;j++)
p[i][j]=1000;
}
for(i=1;i<=e;i++)
{
printf("\n Enter the end vertices of edge '%d' AND weight....",i);
scanf("%d%d%d",&u,&v,&w);
p[u][v]=w;
}
printf("\n Matrix of input..:\n");
for(i=1;i<=var;i++)
{
for(j=1;j<=var;j++)
printf("%d \t",p[i][j]);
Page 11 of 28
Student ID: 10IT102
printf("\n");
}
floyds(p,var);
printf("\nFinal Matrix...:\n");
for(i=1;i<=var;i++)
{
for(j=1;j<=var;j++)
printf("%d \t",p[i][j]);
printf("\n");
}
printf("\n The shortest paths are:\n");
for(i=1;i<=var;i++)
{
for(j=1;j<=var;j++)
{
if(i!=j)
printf("\n(%d,%d)=%d",i,j,p[i][j]);
}
}
getch();
}
MSOR06
/* Rank */
#include<stdio.h>
#include<conio.h>
#include<math.h>
void main()
{
float a[10][10],cnt=0;
inti,k,j,m,p,q,n;
float temp,max;
clrscr();
printf("Enter N for Matrix...");
scanf("%d",&n);
printf("\nEnter values For Matrix...");
for(i=0;i<n;i++)
{
Page 12 of 28
Student ID: 10IT102
for(j=0;j<n;j++)
{
scanf("%f",&a[i][j]);
}
}
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
printf("%f\t",a[i][j]);
}
printf("\n");
}
for(k=0;k<n;k++)
{
max=abs(a[k][k]);
p=k; cnt++;
for(m=k+1;m<n;m++)
{
if(abs(a[m][k])>max)
{
max=abs(a[m][k]);
p=m;
}
}
if(max > 0)
{
cnt=cnt+1;
if(p!=k)
{
for(q=k;q<n;q++)
{
temp=a[k][q];
a[k][q]=a[p][q];
a[p][q]=temp;
}
}
for(i=k+1;i<n;i++)
{
Page 13 of 28
Student ID: 10IT102
temp=a[i][k]/a[k][k];
for(j=k;j<n;j++)
{
a[i][j]-=(temp*(a[k][j]));
}
}
}
else
{
k++;
break;
}
}
printf("\nThe matrix is:\n");
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
printf("%f\t",a[i][j]);
}
printf("\n");
}
printf("\nRank of Matrix = %f",cnt);
getch() ;
}
MSOR07
#include<stdio.h>
#include<conio.h>
void main()
{
int z,mv,i1,x[10],cn,s[10],coc[10][10],j1,r1[10],non,nn,cnt=0;
clrscr();
printf("\nWhich Type of LPP you want to solve...");
printf("\n(Press...\n 1.For minimization \n2.For maximization...)");
scanf("%d",&z);
printf("__________________________________\n Enter......");
Page 14 of 28
Student ID: 10IT102
if(z==1)
printf(" Minimization");
else if(z==2)
printf(" Maximization");
printf(" Problem Variables....");
scanf("%d",&mv);
printf("\nEnter the Coefficient of Objective Function...\n");
for(i1=1;i1<=mv;i1++)
{
scanf("%d",&x[i1]);
}
printf("How many constraint you want to involved.....");
scanf("%d",&cn);
for(i1=1;i1<=cn;i1++)
{
printf("\nEnter......\n1. For <= type\n2. For >= type\n3. For = type\n");
scanf("%d",&s[i1]);
printf("\nEnter Coefficient for Constration : %d",i1);
for(j1=1;j1<=mv;j1++)
scanf("%d",&coc[i1][j1]);
}
printf("\nEnter Right Side of Constraiont.....");
for(i1=1;i1<=cn;i1++)
{
scanf("%d",&r1[i1]);
}
printf("Enter....\n1.All Variable are non negative...\n2.Some variable is
unristricted in sing..");
scanf("%d",&non);
if(non==2)
{
printf("Enter no variable which is unristricted in sign..");
scanf("%d",&nn);
}
if(z==1)
printf("\nMin Z = ");
else if(z==2)
printf("\nMax Z = ");
for(i1=1;i1<=mv;i1++)
Page 15 of 28
Student ID: 10IT102
{
if(x[i1]<0)
printf("(%d)X%d ",x[i1],i1);
else
printf("%dX%d ",x[i1],i1);
if(i1!=mv)
printf("+");
}
printf("\nConstraint : \n");
for(i1=1;i1<=cn;i1++)
{
for(j1=1;j1<=mv;j1++)
{
if(coc[i1]<0)
printf("(%d)X%d",coc[i1][j1],j1);
else
printf("%dX%d",coc[i1][j1],j1);
if(j1!=mv)
printf("+");
}
switch(s[i1])
{
case 1:printf(" <= ");cnt++; break;
case 2:printf(" >= ");cnt++; break;
case 3:printf(" = "); break;
}
printf("%d",r1[i1]);
printf("\n");
}
if(non==1)
{
for(i1=1;i1<=mv;i1++)
{
printf(" X%d ",i1);
if(i1!=mv)
printf(",");
}
printf(" > 0");
}
Page 16 of 28
Student ID: 10IT102
else if(non=2)
{
for(i1=1;i1<=mv;i1++)
{
if(i1 != nn)
{
printf("X%d ",i1);
if(i1!=mv)
printf(",");
}
}
printf(" > 0");
printf("And X%d is unristricted in sign",nn);
}
printf("\n........Objectiove Function in Standared Form........\n");
if(z==1)
printf("\nMin Z = ");
else if(z==2)
printf("\nMax Z = ");
for(i1=1;i1<=mv;i1++)
{
if(x[i1]<0)
printf("(%d)X%d ",x[i1],i1);
else
printf("%dX%d ",x[i1],i1);
if(i1!=mv)
printf("+");
}
for(i1=1;i1<=cnt;i1++)
{
printf("+0S%d ",i1);
}
printf("\nConstraint : \n");
for(i1=1;i1<=cn;i1++)
{
for(j1=1;j1<=mv;j1++)
{
if(coc[i1]<0)
printf(" (%d)X%d ",coc[i1][j1],j1);
Page 17 of 28
Student ID: 10IT102
else
printf(" %dX%d ",coc[i1][j1],j1);
if(j1!=mv)
printf("+");
}
switch(s[i1])
{
case 1:printf("+ 0S%d = ",i1); break;
case 2:printf("- 0S%d + 0A = ",i1); break;
case 3:printf(" = "); break;
}
printf("%d",r1[i1]);
printf("\n");
}
if(non==1)
{
for(i1=1;i1<=mv;i1++)
{
printf(" X%d ",i1);
if(i1!=mv)
printf(",");
}
printf(" > 0");
}
else if(non=2)
{
for(i1=1;i1<=mv;i1++)
{
if(i1 != nn)
{
printf("X%d ",i1);
if(i1!=mv)
printf(",");
}
}
printf(" > 0");
printf("And X%d is unristricted in sign",nn);
}
if(z==1)
Page 18 of 28
Student ID: 10IT102
{
}
else
{
printf("\nEnter only maximization Problem....");
}
getch() ;
}
MSOR08
/* Simplex method */
#include<stdio.h>
#include<conio.h>
void main()
{
/*
n=no. of variables
no= no. of constraints
con[][] = matrix of constraints
tab[][]=slack matrix
mat[][] = whole matrix ( con[][] + tab[][] )
*/
inti,j,co[10],var[10],n,no,con[10][10],rhs[10],non[10];
intcj[10],cj_zj[10],rr[10],xb[10],cb[10],tab[10][10],zj[10];
int s=0,flag=0,max,min,pivot,mat[10][10],k;
clrscr();
printf("\nEnter how many variables u want in objective function : ");
scanf("%d",&n);
printf("\nEnter coefficients of objective function : \n");
for(i=1;i<=n;i++)
{
scanf("%d",&co[i]);
cj[i]=co[i];
}
printf("\n\nEnter no. of constraints : ");
scanf("%d",&no);
Page 19 of 28
Student ID: 10IT102
printf("\nEnterconstaints coefficient : \n");

for(i=1;i<=no;i++)
{
for(j=1;j<=n;j++)
{
scanf("%d",&con[i][j]);
mat[i][j]=con[i][j];
}
}
printf("\n\nEnter +ve RHS values : \n");
for(i=1;i<=no;i++)
{
printf("Enter RHS value for constraint %d : ",i);
scanf("%d",&rhs[i]);
xb[i]=rhs[i];
}
printf("\nSelect non negativity conditions for variable : ");
printf("\n1.Non-negativity\n2. Unrestricted\n");
for(i=1;i<=n;i++)
{
printf("Select for variable %d : ",i);
scanf("%d",&non[i]);
}
printf("\n\nObjective function : ");
printf("\n\nMax Z : ");
for(i=1;i<=n;i++)
{
if(co[i]<0)
printf("(%d)X%d ",co[i],i);
else
printf("%dX%d ",co[i],i);
if(i==n)
break;
else
printf(" + ");
Page 20 of 28
Student ID: 10IT102
}
printf("\n\nSubject to constraints : \n");
for(i=1;i<=no;i++)
{
for(j=1;j<=n;j++)
{
if(con[i][j]<0)
printf("(%d)X%d ",con[i][j],j);
else
printf("%dX%d ",con[i][j],j);
if(j==n)
break;
else
printf(" + ");
}
printf(" <= ");
s++;
printf("%d \n",rhs[i]);
}
for(i=1;i<=n;i++)
{
if(non[i]==1)
printf("\nX%d>= 0",i);
else
printf("\nX%d is unrestricted",i);
}
printf("\n\nStandard form : Objective function : ");
printf("\n\nMax Z : ");
for(i=1;i<=n;i++)
{
if(co[i]<0)
printf("(%d)X%d ",co[i],i);
else
printf("%dX%d ",co[i],i);
Page 21 of 28
Student ID: 10IT102
if(i==n)
break;
else
printf(" + ");
}
for(j=1;j<=s;j++)
{
printf(" + 0S%d ",j);
cb[j]=0;
}
for(i=n+1;i<=(n+s);i++)
{
cj[i]=0;
}
printf("\n\nSubject to constraints : \n");

for(i=1;i<=no;i++)
{
for(j=1;j<=n;j++)
{
if(con[i][j]<0)
printf("(%d)X%d ",con[i][j],j);
else
printf("%dX%d ",con[i][j],j);
if(j==n)
break;
else
printf(" + ");
}
printf(" + S%d = ",i);
printf("%d \n",rhs[i]);
}
for(i=1;i<=n;i++)
{
Page 22 of 28
Student ID: 10IT102
for(j=1;j<=s;j++)
{
if(i==j)
tab[i][j]=1;
else
tab[i][j]=0;
}
}
for(i=1;i<=no;i++)
{
for(j=n+1,k=1;j<=(n+s),k<=s;j++,k++)
{
mat[i][j]=tab[i][k];
}
}
printf("\n\n");
for(i=1;i<=n;i++)
{
if(non[i]==1)
printf("\nX%d>= 0",i);
else
printf("\nX%d is unrestricted",i);
}
for(i=1;i<=s;i++)
{
printf("\nS%d>= 0",i);
}
printf("\n\n\n");
flushall();
for(i=1;i<=(n+s);i++)
{
zj[i]=0;
}
for(i=1;i<=no;i++)
{
for(j=1;j<=(n+s);j++)
{
zj[j]+=cb[i]*mat[i][j];
Page 23 of 28
Student ID: 10IT102
cj_zj[j]=cj[j]-zj[j];
if(cj_zj[j]>=0)
flag=1;
}
}
if(flag==1)
{
for(i=1;i<(n+s);i++)
{
if(cj_zj[i]>cj_zj[i+1])
max=i;
else if(cj_zj[n+s]>cj_zj[max])
max=n+s;
}
}
if(flag==1)
{
for(i=1;i<=no;i++)
{
rr[i]=(int)(xb[i]/mat[i][max]);
}
for(i=1;i<no;i++)
{
if(rr[i]<rr[i+1])
min=i;
else
min=i+1;
}
pivot=mat[min][max];
}
printf(" Cj | ");
for(i=1;i<=(n+s);i++)
{
printf("%d\t",cj[i]);
}
printf("\n___________________________________________________\n\n");
Page 24 of 28
Student ID: 10IT102
printf("CB| BV | ");
for(i=1;i<=n;i++)
{
printf("X%d\t",i);
}
for(i=1;i<=s;i++)
{
printf("S%d\t",i);
}
printf("| XB | RR ");
printf("\n___________________________________________________\n\n");
for(i=1;i<=no;i++)
{
printf("%d | ",cb[i]);
printf("S%d | ",i);
for(j=1;j<=n;j++)
{
printf("%d\t",mat[i][j]);
}
for(j=1;j<=s;j++)
{
printf("%d\t",tab[i][j]);
}
printf("| %d ",xb[i]);
if(flag==1)
printf("| %d",rr[i]);
printf("\n");
}
printf("\n___________________________________________________\n\n");
printf(" Zj | ");
for(i=1;i<=(n+s);i++)
{
printf("%d\t",zj[i]);
}
printf("\n___________________________________________________\n\n")
;
printf("\n Cj-Zj | ");
for(i=1;i<=(n+s);i++)
{
Page 25 of 28
Student ID: 10IT102
printf("%d\t",cj_zj[i]);
}
if(flag==1)
printf("\n\n\n%d is pivot index...",pivot);
getch();
}
MSOR09
/*Program to Generate Random Number (integer) between [a, b) */
#include<stdio.h>
#include<conio.h>
#include<math.h>
#include<stdlib.h>
void main()
{
inti,a,b,n,r;
clrscr();
printf("\nProgram to Generate Random Number (integer) in interval [a, b).\n");
printf("\nEnter limits [a, b):\n");
printf("\na = ");scanf("%d",&a);
printf("\nb= ");scanf("%d",&b);
printf("\nNumber of random numbers:");scanf("%d",&n);
printf("\nNo Random Number\n");
for(i=1;i<=n;i++)
{ r = rand()%(b - a) + a;
printf("\n%d %d",i,r);
}
getch();
}
#include<stdio.h>
#include<conio.h>
#include<math.h>
#include<stdlib.h>
void main()
{
Page 26 of 28
Student ID: 10IT102
inti,n,r;
float a,b,R;
clrscr();
printf("\nProgram to Generate Real Random Number in interval [a, b).\n");
printf("\nEnter limits [a, b):\n");
printf("\na = ");scanf("%f",&a);
printf("\nb= ");scanf("%f",&b);
printf("\nNumber of random numbers:");scanf("%d",&n);
randomize();
printf("\nNo Random Number\n");
for(i=1;i<=n;i++)
{
R = 1.0*rand()/RAND_MAX;
R = R*(b-a)+a;
printf("\n%d %f",i,R);
}
getch();
}
#include<stdio.h>
#include<conio.h>
#include<math.h>
#include<stdlib.h>
void main()
{
inti,n,score,Total_Score;
float a,r,R,x,y,d;
clrscr();
printf("\nProgram to Compute a distance of point on a circle of fixed Area\n");
printf("\nUse this program to construct simple DART game");
printf("\nEnter Area of Circle:");
printf("\nArea = ");scanf("%f",&a);
r = sqrt(a)*M_1_SQRTPI;
printf("\nRadius of Circle: ");printf("%.2f",r);
printf("\nNumber of Attempts:");scanf("%d",&n);
randomize();
printf("\nNo point P(x,y)
Distance
Score\n");
Total_Score = 0;
Page 27 of 28
Student ID: 10IT102
for(i=1;i<=n;i++)
{ R = 1.0*rand()/RAND_MAX;
x = r*R;
R = 1.0*rand()/RAND_MAX;
y = r*R;
d = sqrt(x*x + y*y);
if(d >= (2*r)/3 && d < r)
score = 5;
else if(d >= r/3 && d < 2*r/3)
score = 10;
else if(d < r/3)
score = 25;
else
score = 0;
printf("\n%2d
(%.2f,%.2f)
%.2f
%2d",i,x,y,d,score);
Total_Score += score;
}
printf("\n\nThe Total Score of the game is %d",Total_Score);
getch();
}

Page 28 of 28

Modelling Simuation & Operation Research

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Modelling Simuation & Operation Research

Uploaded by

Copyright:

Available Formats

CHAROTAR UNIVERSITY OF SCIENCE AND TECHNOLOGY

printf("\nEnterconstaints coefficient : \n");

printf("\n\nSubject to constraints : \n");

IT 304: MSOR Practical Assignment

You might also like

Modelling Simuation &amp; Operation Research

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Modelling Simuation &amp; Operation Research

Uploaded by

Copyright:

Available Formats

CHAROTAR UNIVERSITY OF SCIENCE AND TECHNOLOGY

printf("\nEnterconstaints coefficient : \n");

printf("\n\nSubject to constraints : \n");

IT 304: MSOR Practical Assignment

You might also like

Modelling Simuation & Operation Research

Modelling Simuation & Operation Research