knerr cs21 notes...

back to schedule

WEEK05: functions and lists
---------------------------------------------------------------
 F: more functions and lists

SPECIAL READING NOTE: section 6.2 (Incremental Development) from
	the Downey book is a *must* read!


REVIEW:

 - take a look at /home/jk/inclass/functions1.py and
   make sure you understand it! copy it and run it...

 - take a look at grade_averageLIST2.py and make sure
   you understand the readGrades and averageGrades
	 functions

YOUR TURN:

 - try to write the findMax and findMin functions in grade_averageLIST2.py

 - copy /home/jk/inclass/biggest_circle.py and see if you can
   write the findBiggest function

	 HINT: use the getRadius() circle method,
	       return the circle with the biggest radius
         (similar to get findMax function above)