(Latest Revision: 10/21/2000)
Week 08 Notes for CS 2500 -- Fall 2000
Monday, October 23
       -  Take Roll.
       
 -  Check out this week's schedule
       
 -  Announcement(s)
       
              -  Sorry, no progress yet on grading program #2.
              
 -  I posted the  program #4 assignment.
              
 -  I posted the  program #5 assignment.
	      
 -  Watch out about the due dates!!  Start all
	           tasks as early as possible.  Don't expect it
		   will be "OK" to start work on program #4
		   after program #3 is due, or to start work on
		   program #5 after program #4 is due.
              
 -  
       
 
        -  Discuss design for program #3 down to level three.
       
             -  Look closely at code where data types are
	          declared
	     
 -  Look closely at code where variables are
		  declared
	     
 -  Look closely at code where information is
	          retrieved from a data structure
	     
 -  Look closely at code where information is
	          stored to a data structure
       
 
        -  Begin discussing linked lists.
       
	     -  Note what is different in ListP.h from ListA.h
	     
 -  In the ListP.cpp implementation file we see
		  the use of pointers, linking, dynamic memory
		  allocation/deallocation using the "new
		  dataType"/"delete pointerToData"
		  functions/syntax.
             
 -  Look at various samples of insertion code.
	          Get help from example *.jpg files.
             
 -  Look at a couple of cases of retrieval.
	     
 -  Consider deletion
	     
 -  Review the pro's/con's and performance
	          differences between pointer-based and
		  array-based implementations.
       
 
 
 Wednesday, October 25
       -  Take Roll.
       
 -  Check out this week's schedule
       
 -  Announcement(s)
       
              -  Sorry, no progress yet on grading program #2.
	      
 -  I made small changes to listCls.h.  Now the
		   definition of inventoryItemType fits the
		   problem better.
       
 
        -  Discuss design for program #3 down to level three.
       
             -  Look closely at code where files are opened.
             
 -  Look closely at code where files are passed
	          as parameters.
             
 -  Look closely at code where the program reads
	          from files and writes to files.
             
 -  Look closely at code where data types are
	          declared
	     
 -  Look closely at code where variables are
		  declared
	     
 -  Look closely at code where information is
	          retrieved from a data structure
	     
 -  Look closely at code where information is
	          stored to a data structure
       
 
        -  Begin discussing linked lists.
       
	     -  Note what is different in ListP.h from ListA.h
	     
 -  In the ListP.cpp implementation file we see
		  the use of pointers, linking, dynamic memory
		  allocation/deallocation using the "new
		  dataType"/"delete pointerToData"
		  functions/syntax.
             
 -  Look at various samples of insertion code.
	          Get help from example *.jpg files.
             
 -  Look at a couple of cases of retrieval.
	     
 -  Consider deletion
	     
 -  Review the pro's/con's and performance
	          differences between pointer-based and
		  array-based implementations.
       
 
        -  
 
Friday, October 27
       -  Take Roll.
       
 -  Check out this week's schedule
       
 -  Announcement(s)
       
              -  Sorry, no progress yet on grading program #2.
		   I think you'll have it back sometime this
		   weekend.
              
 -  
       
 
        -  Finish up with topics from last time.