Lab Assignment 5

 

 

 

1.     Implement a 'Priority Queue' using either 'array' or 'linked list'.

 

 

 

 

2.     Implement a ‘Circular queue’ using either array or ‘linked list’

 

Supporting operations: “enqueue’, ‘dequeue’, ‘overflow’ and ‘under-run’ exceptions.

Assume the length of queue yourself. [ Refer to: “Application of Queue’ for details]