A queue is a First In First Out digital logic design that saves the elements in an array such that elements are added from one end (head) and removed from the other end (tail). For example, if user saves elements ‘2’, ‘4’, ‘6’, ‘8’ one by one the queue will return ‘2’, ‘4’, ‘6’ and ‘8’ one by one when required.
Functionality Required:
- Storage of 10 integers ranging from (0)10 to (15)10
- Insert element in queue, if queue is already full then inform the user
- Remove element from queue, if queue is empty then inform the user
- User friendly interface