-
Notifications
You must be signed in to change notification settings - Fork 0
/
osproject.cpp
71 lines (68 loc) · 1.35 KB
/
osproject.cpp
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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
#include<iostream>
#include"fcfs1.hpp"
#include"sjfarr.hpp"
#include"srtf1.hpp"
#include"pr.hpp"
#include"r.hpp"
//#include"priorpremp.hpp"
#include"sjf.hpp"
using namespace std;
int main()
{
cout<<"enter your choice\n";
cout<<"press 1 for fcfs scheduling algorithm\n"<<"press 2 for sjf with different arrival time scheduling algorithm\n"<<"press 3 for srtf with diffrent arrival time scheduling algorithm\n"<<"press 4 for priority without premption scheduling algorithm\n"/*<<"press 5 for priority with premption scheduling algorithm\n"*/;
cout<<"press 5 for round robin scheduling algorithm\n";
cout<<"press 6 for sjf with same arrival time scheduling algorithm\n";
int n;
cin>>n;
switch(n)
{
case 1:
{
cout<<"fcfs\n\n";
fcfs();
break;
}
case 2:
{
cout<<"sjf\n\n";
sjf();
break;
}
case 3:
{
cout<<"srtf\n\n";
srtf();
break;
}
case 4:
{
cout<<"priority without premption\n\n";
priority();
break;
}
/*case 5:
{
cout<<"priority with premption\n\n";
priority_premp();
break;
}*/
case 5:
{
cout<<"round robin\n\n";
roundrobin();
break;
}
case 6:
{
cout<<"sjf with same arrival time\n\n";
sjf_same();
break;
}
default:
{
cout<<"no such case exist";
}
}
return 0;
}