QUEUE
Queue is defined as a linear list of elements ,having a front and a rear end.Queue is linear data structure in which insertion takes place at one end called rear and deletion at other end called front end of queue.The elements of queue processed in order in which they enter in queue.FIFO(first in first out) is another name given to queue.
OVERFLOW AND UNDERFLOW CONDITIONS:
(a)if rear=max-1,it is an overflow condition,where max is maximumcapacity of queue.we can not insert elements in case of queue is full.
(b)if front=-1,it indicates an underflow condition,where NULL is speacial type of variable,which indicates that queue is empty and we can not perform deletion operation.
OVERFLOW AND UNDERFLOW CONDITIONS:
(a)if rear=max-1,it is an overflow condition,where max is maximumcapacity of queue.we can not insert elements in case of queue is full.
(b)if front=-1,it indicates an underflow condition,where NULL is speacial type of variable,which indicates that queue is empty and we can not perform deletion operation.
No comments:
Post a Comment