CS225, Fall 2006, Wednesday Nov. 8, Day 32 Hit
reload!
HW Day 32, Due Friday
Day 33 (10 class days after today)
You have done your subroutine cover sheet(s). You have done
algorithm(s).
A) (For each) Translate the algorithm into PEP8 language.
Embed it in a test driver (that is, a main program with the
globals you want to use, and a call to your program.)
You may want to start modestly, making sure the test driver works and
your Procedure structuring works. Then expand on the algorithm
within the Procecure, incrementally.
Post on the Wiki or Email me by 11 a.m. Friday something working
(however simple); or if not, something whose bugs you can't solve.
= = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =
=
= = = = = = =
Notes: Continuing with TicTacToe, with Wiki. Most
up-to-date versions of files are on the Wiki.
Global variables: In the beginning of memory, accessed
(for example, the first character of Board) as LdbyteA Board, d
Hierarchy chart, showing how info passes.
We're still missing what happens after CkWin and
CkTie--what do they do after they've checked; what info do they pass
and how?
Examine algorithms.
Test environment ("Test driver"): Simple Main program
which supplies any variables needed and calls your procedure.
If
time allows, more about addressing modes
Day 29
This page belongs to Sally Sievers who is solely
responsible
for its content. Please see our statement
of responsibility.