Repository navigation
Expand file tree
/
Copy pathStudentQueue.cpp
More file actions
113 lines (107 loc) · 2.22 KB
/
Copy pathStudentQueue.cpp
File metadata and controls
113 lines (107 loc) · 2.22 KB
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
#include <iostream>
using namespace std;
class Queue
{
public:
int A[6];
int front;
int rear;
Queue()
{
front = -1;
rear = -1;
}
void enqueue(int token)
{
if (rear == 5)
{
cout << "Queue is OverFlow\n";
return;
}
if (front == -1)
{
front = 0;
}
rear++;
A[rear] = token;
cout << "Student token " << token << " added\n";
}
void dequeue()
{
if (front == -1 || front > rear)
{
cout << "Queue is UnderFlow\n";
return;
}
cout << "Student with token " << A[front] << " is processed\n";
front++;
if (front > rear)
{
front = -1;
rear = -1;
}
}
void peek()
{
if (front == -1)
{
cout << "Queue is UnderFlow\n";
return;
}
cout << "Front token = " << A[front] << endl;
cout << "Rear token = " << A[rear] << endl;
}
void display()
{
if (front == -1)
{
cout << "Queue is Empty\n";
return;
}
cout << "Complete Queue: ";
for (int i = front; i <= rear; i++)
{
cout << A[i] << " ";
}
cout << endl;
}
};
int main()
{
Queue q;
int choice, token;
do
{
cout << "\n--- Student Admission Queue ---\n";
cout << "1. Enqueue Student\n";
cout << "2. Dequeue Student\n";
cout << "3. Display Front and Rear\n";
cout << "4. Display Complete Queue\n";
cout << "5. Exit\n";
cout << "Enter your choice: ";
cin >> choice;
switch (choice)
{
case 1:
cout << "Enter student token number: ";
cin >> token;
q.enqueue(token);
break;
case 2:
q.dequeue();
break;
case 3:
q.peek();
break;
case 4:
q.display();
break;
case 5:
cout << "Program ended\n";
break;
default:
cout << "Invalid choice\n";
}
} while (choice != 5);
return 0;
}