Queues operations (or) implementing the Queues

Queues operations (or) implementing the Queues  :

Array Representation

Linked Representation

The following operations we are going to perform :

PRIMITIVE OPERATIONS ON QUEUES 

isempty()	return true if queue is empty, return false otherwise
isFull()	return true if queue is full, return false otherwise
insert()	add an element to the rear end of queue
del()	delete the element at the front end of queue
display	print all the data which is in the queue

  first()                                                                 it returns first inserted value in the queue
  last()                                                                  it returns last inserted value in the queue
  parameterized constructor                      which initializes the f,r,size, and created run time queue
destructor()                                                      which deletes the run time queue

Checking queue is overflow or not?

Checking queue is underflow (empty) or not?

Program and algorithm for insertion in the queue

Program and algorithm for deletion from the queue

program to display first inserted value in the queue
program to display last inserted value in the queue   

displaying the queue

 







Queues: