Page 524 - Computer science 868 Class 12
P. 524

8               cap=max;
                 9               ele=new int[cap];

                10               front=rear=0;
                11           }
                12           void enque(int v)

                13           {

                14               if((rear+1) % cap == front)// queue full
                15               { System.out.println("Full from rear !");
                16

                17               }
                18               else

                19                  ele[++rear%cap] = v; // increasing rear counter
                20           }

                21          int deque()
                22           {  int t;

                23
                24               if(front==rear)// queue empty

                25               {   return -999;
                26

                27               }
                28               else

                29                   { t=ele[(front+1)%cap];
                30                      front=(front+1)%cap;// increasing front counter by 1

                31                      return t;
                32           }

                33              }
                34           void display()

                35           {
                36               int i;
                37               if(front != rear)

                38               {

                39                   i = (front +1) %cap; // initialising front
                40                   while(i!=(rear+1)%cap)
                41                   {





                522522  Touchpad Computer Science-XII
   519   520   521   522   523   524   525   526   527   528   529