rear rear queue[reardata return true end procedure implementation of enqueue(in programming language example int enqueue(int dataif(isfull()return rear rear queue[reardatareturn end procedure dequeue operation accessing data from the queue is process of two tasks access the data where front is pointing and remove the data after access the following steps are taken to perform dequeue operation step check if the queue is empty step if the queue is emptyproduce underflow error and exit step if the queue is not emptyaccess the data where front is pointing step increment front pointer to point to the next available data element step return success algorithm for dequeue operation procedure dequeue