for python 3, you have to say python3.1
http://www.python.org/download/
http://www.upriss.org.uk/python/session1.html

hello.py
name.py
convert.py
cat.py
loops.py
filein.py
	Assignment: piglatin

fib.py -- recursion
fibfast.py -- recursion and non-recursion

zoo.py
ten.py
	Assignment: Do the game of 10 questions for a number between 1 and 1000.
Is the number equal, greater than, or less than x?
People have to answer something like "it is equal to x. equal to x. exactly
x. bigger than x....."
Initially, lower bound is 1 and upper bound is 1000.
Each time you get an answer, you either raise the lower bound
or lower the upper bound.

Mastermind like game: guess the four numbers in order.
Each number is a single digit.
The numbers can be repeated.
Server returns number in correct position and numbers that are present
but incorrect position.
mastermindserver.py
mastermindclient.py

mergesort.py
knap.py -- this gives you the basic read of the knapsack data

german.py -- example of dictionary obsolete
simpsons.py -- example of dictionary

Assignment: an engaging Eliza program: see notes of oct 26 and oct 28 2009

discuss local and global variables.
screengame.py: print screen and print out letter; screen changes
a simple game that stops if you hit an obstacle

Assignment: game of your choosing

dectree2.py: computes entropy and conditional entropy
k dectree generates a tree in tmpinput and a result in tmpoutdectree
That works on MakeATree.orig and produces tmpoutdectree which you can show.
gendata.k can generate data for an exercise

Assignment: Determine decision tree to conclude whether sick or not 

Or better: a single person game where someone uses the arrow keys
to avoid obstacles that come from the top.
You are timed.

Sudoku game solver.

Sudokill maybe.


Need some examples of recursion
fib.py
piglatin.py
multidim.py

threader.py


From shasha@access1.cims.nyu.edu  Mon Nov 30 16:15:38 2009
Received: from mx.cims.nyu.edu (mx.cims.nyu.edu [128.122.80.107])
	by mail.cims.nyu.edu (8.13.8+Sun/8.13.8) with ESMTP id nAULFcKs007318
	for <shasha@mail.cims.nyu.edu>; Mon, 30 Nov 2009 16:15:38 -0500 (EST)
Received: from access1.cims.nyu.edu (access1.cims.nyu.edu [128.122.49.15])
	by mx.cims.nyu.edu (8.13.8+Sun/8.13.8) with ESMTP id nAULFaWO016335
	for <shasha@cs.nyu.edu>; Mon, 30 Nov 2009 16:15:37 -0500 (EST)
Received: from access1.cims.nyu.edu (localhost [127.0.0.1])
	by access1.cims.nyu.edu (8.13.8+Sun/8.13.8) with ESMTP id nAULFaKR011965;
	Mon, 30 Nov 2009 16:15:36 -0500 (EST)
Received: (from shasha@localhost)
	by access1.cims.nyu.edu (8.13.8+Sun/8.13.8/Submit) id nAULFa8w011964;
	Mon, 30 Nov 2009 16:15:36 -0500 (EST)
Date: Mon, 30 Nov 2009 16:15:36 -0500 (EST)
From: Dennis Shasha <shasha@courant.nyu.edu>
Message-Id: <200911302115.nAULFa8w011964@access1.cims.nyu.edu>
To: abk235@nyu.edu, ck1247@nyu.edu, dlc333@nyu.edu, jas1026@nyu.edu,
        jh2674@nyu.edu, lad393@nyu.edu, ld969@nyu.edu, lsl278@nyu.edu,
        mjk474@nyu.edu, msm452@nyu.edu, my719@nyu.edu, sh1759@nyu.edu,
        shasha@cs.nyu.edu, tz348@nyu.edu, yas225@nyu.edu
Subject: description of the final assignment
X-Scanned-By: MIMEDefang 2.58 on 128.122.80.107
X-Greylist: Sender IP whitelisted, not delayed by milter-greylist-3.0 (mx.cims.nyu.edu [128.122.80.107]); Mon, 30 Nov 2009 16:15:37 -0500 (EST)
Content-Length: 138


Writing a program to create a decision tree based on
a set of data (called MakeATree) and you're laying out that
tree in outline format.

