-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathext.cpp
More file actions
54 lines (49 loc) · 765 Bytes
/
ext.cpp
File metadata and controls
54 lines (49 loc) · 765 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
#include<bits/stdc++.h>
using namespace std;
int main()
{
float r[10],c[10],p[10],tmp;
int n;
cout<<"\nEnter no. of process :";
cin>>n;
for(int i=0;i<n;i++)
{
cout<<"\n Enter exe time and time period of "<<(i+1)<<" job: ";
cin>>c[i]>>p[i];
}
for(int i=0;i<n;i++)
{
for(int j=i+1;j<n;j++)
{
if(p[j]<p[i])
{
swap(p[j],p[i]);
swap(c[j],p[i]);
}
}
}
for(int i=0;i<n;i++)
cout<<p[i]<<" ";
cout<<endl;
int j;
for(int i=1;i<n;i++)
{
j=0;
r[j]=c[i];
r[j+1]=c[i];
for(int k=1;k<=i;k++)
r[j+1]+=ceil((r[j]/p[i-k]))*c[i-k];
while(r[j]!=r[j+1]&&r[j+1]<=p[i])
{j++;
r[j+1]=c[i];
for(int k=1;k<=i;k++)
r[j+1]+=ceil((r[j]/p[i-k]))*c[i-k];
}
cout<<"\nmax response time : "<<r[j+1];
if(r[j]==r[j+1])
cout<<"\n Schedulable ";
else
cout<<"\n Cannot schedule";
}
return 0;
}