Queue

The general principle of queue is

• First in and last out

• When do pop, top element is removed

• First in and first out

• Use push to remove element

With alternative-3 implementation of queue (circular), if tail is at the last element then add a new element will be located in:

• in the random position

• the last position

• the first position

• in the middle position

With naive implementation (alternative-1) of Queue:

• Back never moves when delete element

• Front never moves when delete element

• All element always move when delete element

• Back never moves when add element

With alternative-3 implementation of queue (circular):

• Front moves when delete element

• Back moves when delete element

• No element moves when add or delete element

• Back and front move when delete element

With alternative-2 implementation of Queue (move when necessary):

• Back never moves when add element

• Back never moves when delete element

• All elements do not move when delete element except if the back is in the last position

• Front always moves when delete element