Data Structures & Algorithm Lab 4

Aim

Write a Menu driven Program to implement Queue ADT using array (Linear Queue). Main queue operations:  enqueue(int): inserts an element at the end of the queue  int dequeue(): removes and returns the element at the front of the queue Auxiliary queue operations:  int front(): returns the element at the front without removing it  int size(): returns the number of elements stored  int isEmpty(): indicates whether no elements are stored

References

Information

• date: 2024.08.17
• time: 12:28