6.8 Circular queue using arrays

Program Definition
Insert a set of integers into the Circular QUEUE , ,and delete these integers from circular QUEUE using arrays
Algorithm:
Algorithm for addition of an element
1. Algorithm add q(item)
2. // Insert item in the circular queue
3. // sorted in q[0;n-1] rear points to the
4. // last item and front is one position
5. // counter wise from the first item in q
6. {
7. rear := (rear+1)mod n; // advance rear clockwise
8. if (front =rear) then
9. {
10. write (“queue is full”);
11. if (front=0) then rear:=n-1;
12.else rear:=rear-1;
13.// move rear one position counter clockwise
14.return false;
15.}
16. elae
17.{
18. q[rear]:= item; || insert new item
19. return true;
ALGORITHM FOR DELETION OF AN ELEMENT

1.algorithm delete q(item)
2.// removes and returns the front element of the queue q[0;n-1]
3.{
4.if (front=rear) then
5.{
6.write(“queue is empty”);
7.return false;
8.}
9.else
10.{
11.front := (front+1)mod n;
12. item := q[front];
// set item to front of queue

13.return true;
14.}
15.}
Circular queue using arrays output:

enter choice1
enter element:6
1.insert 2.delete 3.display 4.exit
enter choice1
cq is over flow
1.insert 2.delete 3.display 4.exit
enter choice2
deleted element is:2
1.insert 2.delete 3.display 4.exit
enter choice1
enter element:10
1.insert 2.delete 3.display 4.exit
enter choice3
the elements in the array are:
10 3 5 6
1.insert 2.delete 3.display 4.exit
enter choice2
deleted element is:3
1.insert 2.delete 3.display 4.exit
enter choice2
deleted element is:5
1.insert 2.delete 3.display 4.exit
enter choice2

deleted element is:6
1.insert 2.delete 3.display 4.exit
enter choice2
deleted element is:10
1.insert 2.delete 3.display 4.exit
enter choice2
cq is empty
1.insert 2.delete 3.display 4.exit
enter choice4