queue-program/queue prg.txt at master · ameenaak/queue-program · GitHub

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
#include<stdio.h>
#include<stdlib.h>
#define max_size 5
int queue[max_size];
int item,front=0,rear=0;
void enqueue();
void dequeue();
void isempty();
void isfull();
void display();
int main()
{
	int choice;
	do
	{
		printf("\nqueue operations\n");
		printf("\n1.enqueue");
		printf("\n2.dequeue");
		printf("\n3.isempty");
		printf("\n4.isfull");
		printf("\n5.display");
		printf("\n6.exit");
		printf("enter your choice");
		scanf("%d",&choice);
		switch(choice)
		{
			case 1:enqueue();
				break;
			case 2:dequeue();
				break;
			case 3:isempty();
				break;
			case 4:isfull();
				break;
			case 5:display();
				break;
			case 6:exit(0);
				break;
			default:
				printf("invalid choice");
				break;
		}
	}while(choice!=6);
	return 0;
}
void enqueue()
{
	if(rear==max_size)
	{
		printf("queue is full");
	}
		if((rear==0)&&(front==0))
		{
			printf("\nenter the element to be inserted");
			scanf("%d",&item);
			front=1;
			rear=rear+1;
			queue[rear]=item;
		}
		else
		{
			printf("\nthe inserted element are");
			scanf("%d",&item);
			rear=rear+1;
			queue[rear]=item;
		}
}
void dequeue()
{
	int item;
	if(rear==0)
	{
		printf("\nqueue is empty");
	}
	else
	{
		item=front;
		front=front+1;
		printf("the deleted element is %d",queue[item]);
	}
}
void isempty()
{
	if((front==0)&&(rear==0))
	{
		printf("\nstack is empty");
	}
	else
	{
		printf("\nstack is not empty");
	}
}
void isfull()
{
	if(rear==max_size)
	{
		printf("stack is full");
	}
	else
	{
		printf("queue is not full");
	}
}
void display()
{
	int i,j;
	if((front==0)&&(rear==0))
	{
		printf("queue is empty");
	}
	else
	{
		printf("queue is");
		for(i=front;i<=rear;i++)
		{
			printf("%d\t",queue[i]);
		}
	}
}