Queue Operations in Data Structure

What is a Queue?

A queue is a logical group of elements in which updates or changes are introduced at one side (the “back”) and existing items are deleted at the opposite end (the “front”) (the “front”). When an item is introduced to the queue, it moves from the back to the front, ready to be eliminated next. The queue’s newly acquired item will have to wait until the collection’s finish. This way of ordering is also known as first-in-first-out (FIFO) (first-in, first-out). “First-come, first-served” is another term for it.

Operating systems employ a variety of queues to manage things within a system. The next job is frequently planned using a queuing approach in order to run programs as quickly as feasible while servicing the largest number of people possible. Furthermore, while we type, keystrokes might occasionally outweigh the text on the screen. The reason is that the computer is now engaged with other duties. The strokes of keys are queued in a file and eventually shown on the screen in the right sequence.

Different operations in Queue Data Structure:

The various operations that are supported by a queue data structure that helps the user to modify and manipulate the data present in the queue are:

Enqueue operation: The term “enqueue” refers to the act of adding a new element to a queue. Where does a new individual go and wait in a standard queue at a ticket counter to join the queue? The individual walks to the back of the room and takes a seat. A new element in a queue is similarly added at the end of the queue.
Dequeue operation: Dequeue is the process of deleting an item from a queue. We must delete the queue member that was put first since the queue follows the FIFO principle. We’ll delete the front element and make the element behind it the new front element because the element added initially will naturally be at the head of the queue.
Front Operation: This works similarly to the peek operation in stacks in that it returns the value of the first element without deleting it.
isEmpty Operation: The isEmpty() function is used to check if the Queue is empty or not.
isFull Operation: The isFull() function is used to check if the Queue is full or not.

After seeing all the different valid operations for the queue data structure, let us write a code to implement all of these operations as functions in the desired programming language.

Let us begin with writing a basic program in Java programming language that will have the functions to simulate all the operations discussed above on the queue data structure.

Java Code:

  import java.util.Scanner;    public class Queue_Data_Structure {    int SIZE_OF_QUEUE = 8;    int array_of_Queue[] = new int[SIZE_OF_QUEUE];    int front_index, rear_index;      Queue_Data_Structure() {      front_index = -1;      rear_index = -1;    }      boolean isFull() {      if (front_index == 0 && rear_index == SIZE_OF_QUEUE – 1) {        return true;      }      return false;    }      boolean isEmpty() {      if (front_index == -1)        return true;      else        return false;    }      void enQueue_Data_Structure(int element) {        if (isFull()) {        System.out.println(“Queue_Data_Structure is full”);      }      else {        if (front_index == -1) {          front_index = 0;        }          rear_index++;        array_of_Queue[rear_index] = element;        System.out.println(“Inserted ” + element);      }    }      int deQueue_Data_Structure() {      int element;        if (isEmpty()) {        System.out.println(“Queue_Data_Structure is empty”);        return (-1);      }      else {        element = array_of_Queue[front_index];          if (front_index >= rear_index) {          front_index = -1;          rear_index = -1;        }        else {          front_index++;        }        System.out.println( element + ” Deleted”);        return (element);      }    }      void display() {      int i;      if (isEmpty()) {        System.out.println(“Empty Queue_Data_Structure”);      }      else {        System.out.println(“nfront_index index-> ” + front_index);          System.out.println(“array_of_Queue -> “);        for (i = front_index; i <= rear_index; i++)          System.out.print(array_of_Queue[i] + ”  “);          System.out.println(“nrear_index index-> ” + rear_index);      }    }      public static void main(String[] args) {        Queue_Data_Structure q = new Queue_Data_Structure();      char ch;      System.out.println(“nSIZE of Queue Data Structure is 8n”);      Scanner scan = new Scanner(System.in);          /**  Perform operations  **/          do              {              System.out.println(“nSelect one of the operations::”);              System.out.println(“1. To insert data in the Queue_Data_Structure Data Structure.”);              System.out.println(“2. To display the data present in the Queue_Data_Structure Data Structure.”);              System.out.println(“3. To perform deQueue_Data_Structure operation on the Queue_Data_Structure Data Structure.”);                 int choice = scan.nextInt();                          switch (choice)              {              case 1 :                   System.out.println(“Enter integer element to insert”);                  q.enQueue_Data_Structure(scan.nextInt());                                       break;                                        case 2 :                   System.out.println(“Queue_Data_Structure::”);                  q.display();                  break;                                                        case 3 :                   // System.out.println(“Data removed.”);                  q.deQueue_Data_Structure();                  break;                   default :                   System.out.println(“Wrong Entry n “);                  break;                 }              System.out.println(“nDo you want to continue (Type y or n) n”);              ch = scan.next().charAt(0);                                  } while (ch == ‘Y’|| ch == ‘y’);    }  }   

Output:

SIZE_OF_QUEUE of Queue_Data_Structure is 8      Select one of the operations::  1. To insert data in the Queue_Data_Structure Data Structure.  2. To display the data present in the Queue_Data_Structure Data Structure.  3. To perform deQueue_Data_Structure operation on the Queue_Data_Structure Data Structure.  1  Integer value for the Queue  67  Inserted 67    Do you want to continue (Type y or n)     y    Select one of the operations::  1. To insert data in the Queue_Data_Structure Data Structure.  2. To display the data present in the Queue_Data_Structure Data Structure.  3. To perform deQueue_Data_Structure operation on the Queue_Data_Structure Data Structure.  1  Integer value for the Queue  54  Inserted 54    Do you want to continue (Type y or n)     y    Select one of the operations::  1. To insert data in the Queue_Data_Structure Data Structure.  2. To display the data present in the Queue_Data_Structure Data Structure.  3. To perform deQueue_Data_Structure operation on the Queue_Data_Structure Data Structure.  1  Integer value for the Queue  45  Inserted 45    Do you want to continue (Type y or n)     y    Select one of the operations::  1. To insert data in the Queue_Data_Structure Data Structure.  2. To display the data present in the Queue_Data_Structure Data Structure.  3. To perform deQueue_Data_Structure operation on the Queue_Data_Structure Data Structure.  1  Integer value for the Queue  33  Inserted 33    Do you want to continue (Type y or n)     y    Select one of the operations::  1. To insert data in the Queue_Data_Structure Data Structure.  2. To display the data present in the Queue_Data_Structure Data Structure.  3. To perform deQueue_Data_Structure operation on the Queue_Data_Structure Data Structure.  1  Integer value for the Queue  21  Inserted 21    Do you want to continue (Type y or n)     y    Select one of the operations::  1. To insert data in the Queue_Data_Structure Data Structure.  2. To display the data present in the Queue_Data_Structure Data Structure.  3. To perform deQueue_Data_Structure operation on the Queue_Data_Structure Data Structure.  1  Integer value for the Queue  18  Inserted 18    Do you want to continue (Type y or n)     y    Select one of the operations::  1. To insert data in the Queue_Data_Structure Data Structure.  2. To display the data present in the Queue_Data_Structure Data Structure.  3. To perform deQueue_Data_Structure operation on the Queue_Data_Structure Data Structure.  1   Integer value for the Queue  78  Inserted 78    Do you want to continue (Type y or n)     y    Select one of the operations::  1. To insert data in the Queue_Data_Structure Data Structure.  2. To display the data present in the Queue_Data_Structure Data Structure.  3. To perform deQueue_Data_Structure operation on the Queue_Data_Structure Data Structure.  1   Integer value for the Queue  98  Inserted 98    Do you want to continue (Type y or n)     y    Select one of the operations::  1. To insert data in the Queue_Data_Structure Data Structure.  2. To display the data present in the Queue_Data_Structure Data Structure.  3. To perform deQueue_Data_Structure operation on the Queue_Data_Structure Data Structure.  2  Queue_Data_Structure::    front_index index-> 0  array_of_Queue ->   67  54  45  33  21  18  78  98    rear_index index-> 7    Do you want to continue (Type y or n)     y    Select one of the operations::  1. To insert data in the Queue_Data_Structure Data Structure.  2. To display the data present in the Queue_Data_Structure Data Structure.  3. To perform deQueue_Data_Structure operation on the Queue_Data_Structure Data Structure.  1  Integer value for the Queue  100  Queue_Data_Structure is full    Do you want to continue (Type y or n)     y    Select one of the operations::  1. To insert data in the Queue_Data_Structure Data Structure.  2. To display the data present in the Queue_Data_Structure Data Structure.  3. To perform deQueue_Data_Structure operation on the Queue_Data_Structure Data Structure.  3  67 Deleted    Do you want to continue (Type y or n)     y    Select one of the operations::  1. To insert data in the Queue_Data_Structure Data Structure.  2. To display the data present in the Queue_Data_Structure Data Structure.  3. To perform the deQueue_Data_Structure operation on the Queue_Data_Structure Data Structure.  2  Queue_Data_Structure::    front_index index-> 0  array_of_Queue ->   54  45  33  21  18  78  98    rear_index index-> 6    Do you want to continue (Type y or n)     n

Now let us have a look at the C++ code to implement Queue data structure.

C++ Code:

  // A sample C++ to implement the Queue DS  // Queue_Data_Struct implementation in C++    #include   #define SIZE_OF_QUEUE 7    using namespace std;    class Queue_Data_Struct {     private:    int array_of_Queue[SIZE_OF_QUEUE], front_index, rear_index;       public:    Queue_Data_Struct() {      front_index = -1;      rear_index = -1;    }      bool isFull() {      if (front_index == 0 && rear_index == SIZE_OF_QUEUE – 1) {        return true;      }      return false;    }      bool isEmpty() {      if (front_index == -1)        return true;      else        return false;    }      void enQueue_Data_Struct(int element) {      if (isFull()) {        cout << “Queue_Data_Struct is full”;      } else {        if (front_index == -1) front_index = 0;        rear_index++;        array_of_Queue[rear_index] = element;        cout << endl           << “Inserted ” << element << endl;      }    }      int deQueue_Data_Struct() {      int element;      if (isEmpty()) {        cout << “Queue_Data_Struct is empty” << endl;        return (-1);      } else {        element = array_of_Queue[front_index];        if (front_index >= rear_index) {          front_index = -1;          rear_index = -1;        } /* Q has only one element, so we reset the Queue_Data_Struct after deleting it. */        else {          front_index++;        }        cout << endl           << “Deleted -> ” << element << endl;        return (element);      }    }      void display() {      /* Function to display elements of Queue_Data_Struct */      int i;      if (isEmpty()) {        cout << endl           << “Empty Queue_Data_Struct” << endl;      } else {        cout << endl           << “front_index index-> ” << front_index;        cout << endl           << “array_of_Queue -> “;        for (i = front_index; i <= rear_index; i++)          cout << array_of_Queue[i] << ”  “;        cout << endl           << “rear_index index-> ” << rear_index << endl;      }    }  };    int main() {    Queue_Data_Struct q;    int data;      char ch;      cout<<“nSIZE_OF_QUEUE of Queue_Data_Struct is 7.n”;          /*  Perform tree operations  */          do              {              cout<<“nSelect one of the operations::”<>choice;                          switch (choice)              {              case 1 :                   cout<<“Enter the value to be inserted”<>data;                  q.enQueue_Data_Struct(data);                  break;                                        case 2 :                   cout<<“Contents of the Queue_Data_Struct are::”<>ch;                                  } while (ch == ‘Y’|| ch == ‘y’);      return 0;  }  ;>;>;>

Output:

SIZE_OF_QUEUE of Queue_Data_Struct is 7.    Select any one of the operations::  1. To insert data in the Queue_Data_Struct Data Structure.  2. To display the data present in the Queue_Data_Struct Data Structure.  3. To perform the deQueue_Data_Struct operation on the Queue_Data_Struct Data Structure.  1  Integer value for the Queue  56    Inserted 56    Do you want to continue (Type y or n)   y    Select any one of the operations::  1. To insert data in the Queue_Data_Struct Data Structure.  2. To display the data present in the Queue_Data_Struct Data Structure.  3. To perform the deQueue_Data_Struct operation on the Queue_Data_Struct Data Structure.  1  Integer value for the Queue  44    Inserted 44    Do you want to continue (Type y or n)   y    Select any one of the operations::  1. To insert data in the Queue_Data_Struct Data Structure.  2. To display the data present in the Queue_Data_Struct Data Structure.  3. To perform the deQueue_Data_Struct operation on the Queue_Data_Struct Data Structure.  1  Integer value for the Queue  32    Inserted 32    Do you want to continue (Type y or n)   y    Select any one of the operations::  1. To insert data in the Queue_Data_Struct Data Structure.  2. To display the data present in the Queue_Data_Struct Data Structure.  3. To perform the deQueue_Data_Struct operation on the Queue_Data_Struct Data Structure.  1  Integer value for the Queue  98    Inserted 98    Do you want to continue (Type y or n)   y    Select any one of the operations::  1. To insert data in the Queue_Data_Struct Data Structure.  2. To display the data present in the Queue_Data_Struct Data Structure.  3. To perform the deQueue_Data_Struct operation on the Queue_Data_Struct Data Structure.  1  Integer value for the Queue  342    Inserted 342    Do you want to continue (Type y or n)   y    Select any one of the operations::  1. To insert data in the Queue_Data_Struct Data Structure.  2. To display the data present in the Queue_Data_Struct Data Structure.  3. To perform the deQueue_Data_Struct operation on the Queue_Data_Struct Data Structure.  1  Integer value for the Queue  87    Inserted 87    Do you want to continue (Type y or n)   y    Select any one of the operations::  1. To insert data in the Queue_Data_Struct Data Structure.  2. To display the data present in the Queue_Data_Struct Data Structure.  3. To perform the deQueue_Data_Struct operation on the Queue_Data_Struct Data Structure.  1  Integer value for the Queue  12    Inserted 12    Do you want to continue (Type y or n)   y    Select any one of the operations::  1. To insert data in the Queue_Data_Struct Data Structure.  2. To display the data present in the Queue_Data_Struct Data Structure.  3. To perform the deQueue_Data_Struct operation on the Queue_Data_Struct Data Structure.  1  Integer value for the Queue  4  Queue_Data_Struct is full  Do you want to continue (Type y or n)   y    Select any one of the operations::  1. To insert data in the Queue_Data_Struct Data Structure.  2. To display the data present in the Queue_Data_Struct Data Structure.  3. To perform the deQueue_Data_Struct operation on the Queue_Data_Struct Data Structure.  2  Contents of the Queue_Data_Struct are::    front_index index-> 0  array_of_Queue -> 56  44  32  98  342  87  12    rear_index index-> 6    Do you want to continue (Type y or n)   y    Select any one of the operations::  1. To insert data in the Queue_Data_Struct Data Structure.  2. To display the data present in the Queue_Data_Struct Data Structure.  3. To perform the deQueue_Data_Struct operation on the Queue_Data_Struct Data Structure.  3  deQueue_Data_Struct operation successful.    Deleted -> 56    Do you want to continue (Type y or n)   y    Select any one of the operations::  1. To insert data in the Queue_Data_Struct Data Structure.  2. To display the data present in the Queue_Data_Struct Data Structure.  3. To perform the deQueue_Data_Struct operation on the Queue_Data_Struct Data Structure.  2  Contents of the Queue_Data_Struct are::    front_index index-> 1  array_of_Queue -> 44  32  98  342  87  12    rear_index index-> 6    Do you want to continue (Type y or n)   n

Now let us have a look at the C code to implement the Queue data structure.

C Code:

  // Queue implementation in C  // Queue implementation in C    #include   #define SIZE_OF_QUEUE 7    void enQueue(int);  void deQueue();  void display();    int array_of_Queue[SIZE_OF_QUEUE], front_index = -1, rear_index = -1;    int main() {        int data;      char ch;          /*  Perform tree operations  */          do              {              printf(“nSelect one of the operations::”);              printf(“n1. To insert data in the Queue Data Structure.”);              printf(“n2. To display the data present in the Queue Data Structure.”);              printf(“n3. To perform the deQueue operation on the Queue Data Structure.n”);                int choice;              scanf(“%d”,&choice);                          switch (choice)              {              case 1 :                   printf(“nEnter the value to be insertedn”);                  scanf(“%d”,&data);                  enQueue(data);                                       break;                                        case 2 :                   printf(“nContents of the Queue are::n”);                  display();                  break;               case 3 :                   printf(“nDequeue Done.n”);                  deQueue();                  break;              default :                   printf(“Wrong Entryn”);                  break;                 }                printf(“nDo you want to continue (Type y or n)n”);              scanf(” %c”,&ch);                                  } while (ch == ‘Y’|| ch == ‘y’);    return 0;  }    void enQueue(int value) {    if (rear_index == SIZE_OF_QUEUE – 1)      printf(“nQueue is Full!!”);    else {      if (front_index == -1)        front_index = 0;      rear_index++;      array_of_Queue[rear_index] = value;      printf(“nInserted -> %d”, value);    }  }    void deQueue() {    if (front_index == -1)      printf(“nQueue is Empty!!”);    else {      printf(“nDeleted : %d”, array_of_Queue[front_index]);      front_index++;      if (front_index > rear_index)        front_index = rear_index = -1;    }  }    // Function to print the queue  void display() {    if (rear_index == -1)      printf(“nQueue is Empty!!!”);    else {      int i;      printf(“nQueue elements are:n”);      for (i = front_index; i <= rear_index; i++)        printf(“%d  “, array_of_Queue[i]);    }    printf(“n”);  }  

Output:

Select any one of the operations:: 1. To insert data in the Queue Data Structure. 2. To display the data present in the Queue Data Structure. 3. To perform the deQueue operation on the Queue Data Structure. 1 Integer value for the Queue 23 Inserted -> 23 Do you want to continue (Type y or n) y Select any one of the operations:: 1. To insert data in the Queue Data Structure. 2. To display the data present in the Queue Data Structure. 3. To perform the deQueue operation on the Queue Data Structure. 1 Integer value for the Queue 22 Inserted -> 22 Do you want to continue (Type y or n) y Select any one of the operations:: 1. To insert data in the Queue Data Structure. 2. To display the data present in the Queue Data Structure. 3. To perform the deQueue operation on the Queue Data Structure. 1 Integer value for the Queue 87 Inserted -> 87 Do you want to continue (Type y or n) y Select any one of the operations:: 1. To insert data in the Queue Data Structure. 2. To display the data present in the Queue Data Structure. 3. To perform the deQueue operation on the Queue Data Structure. 1 Integer value for the Queue 12 Inserted -> 12 Do you want to continue (Type y or n) y Select any one of the operations:: 1. To insert data in the Queue Data Structure. 2. To display the data present in the Queue Data Structure. 3. To perform the deQueue operation on the Queue Data Structure. 1 Integer value for the Queue 90 Inserted -> 90 Do you want to continue (Type y or n) y Select any one of the operations:: 1. To insert data in the Queue Data Structure. 2. To display the data present in the Queue Data Structure. 3. To perform the deQueue operation on the Queue Data Structure. 1 Integer value for the Queue 78 Inserted -> 78 Do you want to continue (Type y or n) y Select any one of the operations:: 1. To insert data in the Queue Data Structure. 2. To display the data present in the Queue Data Structure. 3. To perform the deQueue operation on the Queue Data Structure. 1 Integer value for the Queue 56 Inserted -> 56 Do you want to continue (Type y or n) y Select any one of the operations:: 1. To insert data in the Queue Data Structure. 2. To display the data present in the Queue Data Structure. 3. To perform the deQueue operation on the Queue Data Structure. 1 Integer value for the Queue 45 Queue is Full!! Do you want to continue (Type y or n) y Select any one of the operations:: 1. To insert data in the Queue Data Structure. 2. To display the data present in the Queue Data Structure. 3. To perform the deQueue operation on the Queue Data Structure. 2 Contents of the Queue are:: Queue elements are: 23 22 87 12 90 78 56 Do you want to continue (Type y or n) y Select any one of the operations:: 1. To insert data in the Queue Data Structure. 2. To display the data present in the Queue Data Structure. 3. To perform the deQueue operation on the Queue Data Structure. 3 Dequeue Done. Deleted : 23 Do you want to continue (Type y or n) y Select any one of the operations:: 1. To insert data in the Queue Data Structure. 2. To display the data present in the Queue Data Structure. 3. To perform the deQueue operation on the Queue Data Structure. 2 Contents of the Queue are:: Queue elements are: 22 87 12 90 78 56 Do you want to continue (Type y or n) n

So, in this article, we understood the Queue data structure and various operations that we can do on the Queue data structure to modify and manipulate the data present in the Queue. And in the latter section of the article, we also have written code in three different programming languages (C, C++, and Java) where each operation of the Queue Data structure is implemented as an individual function that is called whenever we need to perform that particular operation on the data in the Queue.

Next TopicWhat is a non-linear data structure

Queue Operations in Data Structure

Queue Operations in Data Structure

What is a Queue?

Different operations in Queue Data Structure:

Java Code:

C++ Code:

C Code:

Cycle Sort

Characteristics of OLAP

You may also like