{"id":16203,"date":"2023-05-09T10:37:52","date_gmt":"2023-05-09T10:37:52","guid":{"rendered":"https:\/\/www.prepbytes.com\/blog\/?p=16203"},"modified":"2023-05-09T10:37:52","modified_gmt":"2023-05-09T10:37:52","slug":"insertion-in-queue","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/insertion-in-queue\/","title":{"rendered":"Insertion in Queue"},"content":{"rendered":"

\"\"<\/p>\n

A queue is a data structure that follows the First-In-First-Out (FIFO) principle, meaning the element that is added first to the queue is the first one to be removed. In a queue, elements are inserted at one end called the rear or tail, and removed from the other end called the front or head.<\/p>\n

What is Insertion in Queue?<\/h2>\n

Insertion in a queue is the process of adding an element to the rear end of the queue. The process of insertion can be done using various methods, including:<\/p>\n

    \n
  1. Enqueue:<\/strong> The enqueue operation adds an element to the rear end of the queue. In this operation, the element is added to the end of the queue and the rear pointer is incremented by one.<\/li>\n
  2. Circular Queue:<\/strong> A circular queue is a modified version of a queue in which the rear end is connected to the front end. In this type of queue, when the rear end reaches the end of the queue, it wraps around to the beginning of the queue. This allows for efficient use of memory and can help prevent overflow errors.<\/li>\n
  3. Priority Queue:<\/strong> A priority queue is a queue in which each element is associated with a priority. The elements with higher priority are dequeued before those with lower priority. In this type of queue, the insertion is done based on the priority of the element.<\/li>\n<\/ol>\n

    Insertion in a queue is an important operation that enables adding new elements to the queue in a proper and organized way. This operation is commonly used in computer science and programming, particularly in data processing and algorithms.<\/p>\n

    Basic Operations of Queue<\/h2>\n

    An object called a queue (an ADT, or abstract data structure) enables the following operations:<\/p>\n

      \n
    • Enqueue:<\/strong> Add a component to the queue’s end.<\/li>\n
    • Dequeue:<\/strong> Put a component at the end of the queue.<\/li>\n
    • IsFull:<\/strong> A complete queue should be checked.<\/li>\n
    • IsEmpty:<\/strong> Verify that the queue is empty.<\/li>\n
    • Peek:<\/strong> Without deleting it, obtain the value at the head of the queue.<\/li>\n<\/ul>\n

      Insertion in Queue: Enqueue()<\/h3>\n

      The enqueue operation adds an element to the rear end of the queue. Following is the algorithm:<\/p>\n

        \n
      • Step1<\/strong>: Begin<\/li>\n
      • Step 2<\/strong>: A complete queue should be checked.<\/li>\n
      • Step 3<\/strong>: Produce an overflow error and quit if the queue is full.<\/li>\n
      • Step 4<\/strong>: Place a data element where the rear is pointing in the queue.<\/li>\n
      • Step 5<\/strong>: End<\/li>\n<\/ul>\n

        Implementation of Queue for Insertion<\/strong><\/p>\n\t\t\t\t\t\t