-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path11]fds_program_for_queue_jobQueue.cpp
152 lines (138 loc) · 2.52 KB
/
11]fds_program_for_queue_jobQueue.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
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
#include <iostream>
using namespace std;
const int MAX = 5; //Cap
class Job
{
int id;
int priority;
friend class Queue;
public:
void getdata()
{
cout << "\nEnter Job id: ";
cin >> id;
cout << "\nEnter Job priority: ";
cin >> priority;
}
void putdata()
{
cout << "\n\t" << id;
cout << "\t\t" << priority;
}
};
class Queue
{
int front, rear;
Job queue[MAX];
public:
Queue()
{
front = rear = -1;
}
bool isEmpty();
bool isFull();
void insert();
void remove();
void display();
};
bool Queue::isEmpty()
{
if (front == (rear + 1) || rear == -1)
return 1;
else
return 0;
}
bool Queue::isFull()
{
if (rear == MAX - 1)
{
return 1;
}
else
return 0;
}
void Queue::insert()
{
Job j;
if (isFull())
{
cout << "\nQueue is Full.";
}
else
{
j.getdata();
if (rear == -1)
{
front++;
rear++;
queue[rear] = j;
}
else
{
int i = rear;
while (i >= front && queue[i].priority > j.priority)
{
queue[i + 1] = queue[i];
i--;
}
queue[i + 1] = j;
rear++;
}
cout << "\nJob Added To Queue." << endl;
}
}
void Queue::remove()
{
if (rear == -1 || front == (rear + 1))
{
cout << "\nQueue is Empty." << endl;
}
else
{
front++;
cout << "\nJob Processed From Queue." << endl;
}
}
void Queue::display()
{
if (isEmpty())
{
cout << "\nQueue is Empty." << endl;
}
else
{
for (int i = front; i <= rear; i++)
{
queue[i].putdata();
}
cout << endl;
}
}
int main()
{
int ch;
Queue q;
do
{
cout << "1.Insert job\n";
cout << "2.Display jobs\n";
cout << "3.Remove job\n";
cout << "4.Exit\n";
cout << "Enter your choice: ";
cin >> ch;
switch (ch)
{
case 1:
q.insert();
break;
case 2:
cout << "\n\tJob id ";
cout << "\t Job priority ";
q.display();
break;
case 3:
q.remove();
}
} while (ch != 4);
return 0;
}