Question

What will be the algorithm to insert an element in queue without using tag ....?​

Answer 1

Explanation:

start,

check if the queue is full or not if(rear=n-1)

then print "queue is full and exit else goto .

step no 3 .in step 3_

increment the rear ++rear;

add the item at the 'rear' position Q[rear]=item,

exit.

hope its help u.

happy to help u ..