(Latest Revision: 02/13/2005)
Week 01 Notes for CS 3100 -- Spring 2005 
-  Check attendance -- the class list may be available, else we will just
     use a sign-up sheet.
 -  Pass around a sign-up sheet for new accounts.
 -  Discuss schedule for first week.
 -  Announcement:  Progamming II is a prerequisite for Data Structures +
     Algorithms, and students without prerequisites may be dropped by the
     instructor.
 -  Announcement:  I have to leave early on 2/18 - I won't be able to keep
     the 13:25-14:25 office hour.
 -  Show students where to access course handouts online.
 -  Go over some of the information in the course description.
 -  Show class where to get hello world handouts and Jove handouts online:
     
 -  Day One: Discuss recursive algorithms as time allows.  
     
     -  palindrome test: 
if the string is empty or its length is 1return
	  true; else if the first and last character are the same; return the
	  result of a recursive call made on what remains of the string after
	  removing the first and last character; else return false.
      -  AnBn test: 
if the string is empty return
	  true; else if the first character is A and the last character is B
	  then return the result of a recursive call made on what remains of
	  the string after removing the first and last character; else return
	  false. 
      -  YepNope test
     
 
 -  Day Two: If need be, perform "Hello World" lab.  If done early, discuss
     more recursive algorithms.
 -  Day Three: include discussion of programming assignment #1.
 -  
 
Note the due date for Programming assignment #1. (Monday February 28)
 
 -  Note: I will test the program you turn in.  It must run without errors on
     a sun ultra.  Therefore you need to test it there.
 -   Have a look at the hints page. 
 -  
 
Go over "What to turn in" from the assignment sheet.
 
 -  Discuss program testing strategies and requirements.
     
     -  Data Coverage -- Black Box Testing
          
          -  Average inputs
          
 -   inputs near and on boundaries 
          
 
      -  Code Coverage -- White/Clear Box Testing
          
          -  Statement Coverage
          
 -  Path Coverage
          
 
      -  As an example, use a recursive algorithm that tests a string to see
	  if it is a palindrome. What black-box and white-box testing are
	  required?
     
 
 -