May 20

... start recording

What's what

Today :

• Please submit a rough draft of whatever you have for a project ... I'll get comments back soon.
• A bit more on recursion and algorithms.
• SEPC discussion.

Monday :

• overview summary of what we've done & discussion of future courses
• start project presentations - anyone who's willing to share work

next Thursday : last class !

• final draft of final projects due : code, docs, discussion paper, bibliography
• more project presentations - option but encouraged

Questions about anything?

define "recursion" : see "recursion

I've posted my code for last week's homework

• palindrome.py
• turtle_tree.py

Please do take note of the conventions in those python files (docstrings for the functions, a docstring at the top of the file, clear variable names, tests, ...), and use them in your final project. Style and readability counts.

We'll go over a few more examples of recursion ... a short but elegant one, and then some you might see in the course after this one, "algorithms".

• hanoi.py - solving the classic 'towers of hanoi' puzzle ; this one is discussed in our textbook.
• pegs.py - solving a peg solitaire puzzle
• minimax_tictactoe.py - solving tic-tac-toe with a recursive minmax search.

That'll probably take all the time that we have ... if not, I'll discuss solving the Fibonnaci series using recursion ... and what can go wrong.

SEPC discussion

... without me. ;)