algorithm for insertion of any element into the


Algorithm for insertion of any element into the circular queue:

Step-1: If "rear" of the queue is pointing at the last position then go to step-2 or else Step-3

Step-2: make the "rear" value as 0

Step-3: increase the "rear" value by one

Step-4: a. if the "front" points where "rear" is pointing & the queue holds a not NULL value for it, then it's a "queue overflow" state, thus quit; else go to step-b

b. Insert the new value for the queue position pointed by the "rear"

Request for Solution File

Ask an Expert for Answer!!
Computer Engineering: algorithm for insertion of any element into the
Reference No:- TGS0413486

Expected delivery within 24 Hours