Note: You must use concept of circular array of at least size 10 to implement queue.
A queue is an object that allows the following operations:
Enqueue: Add an element to the end of the queue
Dequeue: Remove an element from the front of the queue
IsEmpty: Check if the queue is empty
IsFull: Check if the queue is full
Peek: Get the value of the front of the queue without removing it.
Create a class to define above mention operations of a queue and a main function to implement operations.
Note: You must use concept of circular array of at least size 10 to implement queue.
Comments
Leave a comment