Queues

• A homogenious ADT with the following properties
  • FILO or LIFO
  • head the earliest element added to the queue
  • tail the last element added to the queue
  • Enqueue(o) - add an object to the tail of the queue
  • Dequeue() - remove the object at the tail, return this object
  • Size() - number of elements in the queue
  • IsEmpty() - bool, status of queue
  • IsFull() - bool status of the queue
  • First() - reference to head object.
• Implementations
  • Array baised
  • Pointer Baised
  • performances?