Data-structure-CSL-201-LAB/dequeue.c at main · nibinpsreenivas/Data-structure-CSL-201-LAB · 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
#include <stdio.h>
int isempty();
int isfull();
void display();
void insert(int item);
int delete();
#define n 10
int q[n],front=-1,rear=-1;
int main()
{
   int item,a,o;
    do
     {
       printf("\n1)insertr\n2)deletef\n3)insertf\n4)deleter\n5)display\n6)end");
       printf("\nenter the number to perform the operation");
       scanf("%d",&o);
       switch(o)
        {
          case 1 : if(isfull())
                    printf("\nthe queuee is full");
                    else
                     {
                       printf("\nenter the element to be inserted into queue");
                       scanf("%d",&a);
                       insert(a);
                      }
                    break;
          case 2 : if(isempty())
                     printf("\nthe queuee is empty");
                      else
                      {
                        a=delete();
                        printf("\nthe deleted element is %d",a);
                      }
                     break;
         case 3 : if(isfull())
                    printf("\nthe queuee is full");
                    else
                     {
                       printf("\nenter the element to be inserted into queue");
                       scanf("%d",&a);
                       insert(a);
                      }
                    break;
          case 4 : if(isempty())
                     printf("\nthe queuee is empty");
                      else
                      {
                        a=delete();
                        printf("\nthe deleted element is %d",a);
                      }
                     break;
         case 5 : if(isempty())
                     printf("\nthe queuee is empty");
                    else
                      display();
                   break;


        }while(o!=6);
 }

 int isempty()
 {
     if(front == -1)
      return 1;
     else
      return 0;
 }
 int isfull()
 {
    if(front == (rear+1)%n)
      return 1;
    else
      return 0;
 }
 void insertr(int item)
 {
   if(front=-1)
     front = rear = 0;
   else
     rear = (rear+1)%n;
    q[rear]=item;
 }
 void insertf(int item)
 {
   if(front=-1)
     front = rear = 0;
   else
     front = (front+n-1)%n;
    q[front]=item;
 }
 int deletef()
 {
   int a = q[front];
   if(front==rear)
      front=rear=-1;
    else
     front= (front+1)%n;
   return a;
 }
 int deleter()
 {
   int a = q[rear];
   if(front==rear)
      front=rear=-1;
    else
     rear= (rear+1)%n;
   return a;
 }
void display()
{
  for(int i=front;i<rear;i++)
    printf("\n %d",q[i]);
}