Define queues. Implement Qinsert and Qdelete function for queues using arrays

Define queues. Implement Qinsert and Qdelete function for queues using arrays

A queue is an ordered list in which insertions (additions, pushes) and deletions (removals and pops) take place at different ends.

Qinsert function for queues using arrays

void Qinsert(element item) { 
  /* add an item to the queue */ 
  if (rear == MAX_QUEUE_SIZE-1){ 
  queueFull(); 
}
else{
      if (front == - 1){
         /*If queue is initially empty */
         front = 0;
      }
         queue [++rear] = item; 
}

Qdelete function for queues using arrays

element Qdelete() { 
  /* remove element at the front of the queue */ 
  if (front == rear){ 
  return queueEmpty( ); /* return an error key */ 
}
else{
  return queue[++front]; 
}