Notes:

	Due to cancellation of class, homework due for Mar 5th is now due Mar 12th.
	
	The exam will still be held on Mar 12th.  First hour of class will be a discussion of Queues and a quick review of topics for the test.  After the break will be the exam.

Queues


	First in, first out processing
	
	You can only see the next available item on the queue, the oldest one in the queue

	Examples:
	
		a line at a bank
	
Push

	Add a new item to the end of the queue

	What are the possible errors involved?

Pop

	Remove the oldest item from the queue
	
	What are the possible errors involved?

Peek

	Look at the oldest item on the queue.
	
	What are the possible errors involved?

As a Linked List:

	Keep a pointer to the first node of the list
	Push: Add a new node to the end of the list
	Pop : move the ptrFirst forward one and delete the first node

As an Array:

	Keep the index value of the oldest item added
	Push: increment the current index value
	Pop : decrement the current index value