A class with Dynamic Memory

• Let's implement a queue
  • A queue is a "line"
  • First in first out.
• Domain
  • A homogeneous data structure ordered by insertion time.
• Operations
  • Size : return the number of elements in the queue
  • Enqueue: add an item to the back of the queue
  • Dequeue: remove an item from the front of the queue
  • Front: return a copy of the first item in the queue.
• Draw an uml diagram of this with umlentino.
• Sufficient?
• How will we implement this?
  • I plan to use a linked list.
  • But it will be sort of "backwards"
  • 
  • Why do it this way?
• Make the .h file.
• Make the .cpp file
• Make a Makefile (or just copy one)
• Make a test driver.
• Try with valgrind