-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathtask7.c
185 lines (167 loc) · 2.76 KB
/
task7.c
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
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
#include<stdio.h>
#include<stdlib.h>
#include<conio.h>
#define MAX 8
int queue[MAX],front=-1,rear=-1,flag=1;
int isfull()
{
if(front!=-1 && rear==front)
return 1;
else
return 0;
}
int isempty()
{
if(rear==-1)
return 1;
else
return 0;
}
void enqueue()
{
if(flag==1)
{
printf("\nWriting process starts...\n");
if(isfull())
{
printf("\nQueue is full\n");
return;
}
int data;
printf("\nEnter the data: ");
scanf("%d",&data);
if(rear==-1)
{
front=0;
rear=0;
}
queue[rear]=data;
rear=(rear+1)%MAX;
}
else
{
printf("\nBurning process is going on.. First stop burning\n");
return;
}
}
void dequeue()
{
if(flag==2)
{
printf("\nBurning process starts..\n");
if(isempty())
printf("\nQueue is empty\n");
else
{
printf("\n Deleted element is %d",queue[front]);
front=(front+1)%MAX;
if(front==rear)
{
front=-1;
rear=-1;
}
}
}
else
{
printf("\nWriting process is going on.. First stop writing to burn\n\n");
return;
}
}
void display()
{
int i;
if(isempty())
printf("\nQueue is empty\n");
else if(front<rear)
{
for(i=front;i<rear;i++)
{
printf("%d\n",queue[i]);
}
}
else
{
for(i=0;i<rear;i++)
printf("%d\n",queue[i]);
for(i=front;i<MAX;i++)
printf("%d",queue[i]);
}
}
int main()
{
char res;
int ch=1;
do
{
printf("\n1.Insert data\n");
printf("2.Burn data\n");
printf("3.Display\n");
printf("4.Stop Writing\n");
printf("5.Stop Burning\n");
printf("6.Show last data\n");
printf("7.Show first data which is going to burn\n");
printf("8.Show Position of last data\n");
printf("9.Show Position of first data which is going to burn\n");
printf("\nEnter your choice: ");
scanf("%d",&ch);
switch(ch)
{
case 1:
enqueue();
break;
case 2:
dequeue();
break;
case 3:
display();
break;
case 4:
{
flag=2;
printf("\nWriting process stopped..\n");
break;
}
case 5:
{
flag=1;
printf("\nBurning process stopped..\n");
break;
}
case 6:
{
if(isempty())
{
printf("\nToo less Data..\n");
break;
}
printf("\nIt is : %d\n",queue[rear-1]);
break;
}
case 7:
{
if(isempty())
{
printf("\nToo less Data..\n");
break;
}
printf("\nIt is : %d\n",queue[front]);
break;
}
case 8:
printf("%d\n",rear-1);
break;
case 9:
printf("%d\n",front);
break;
}
if(rear==MAX-1)
{
printf("\nDisc is full, you can't enter more data");
printf("\nDisc burning starts\n\n Disc BURNED.");
rear=-1;
front=-1;
}
}
while(ch!=10);
}