• if your Practical Exam is perfect
• you can choose to not take the final exam
• but your programs for the practical must be perfect.

They could be from Homework Ten, Seven, Six and Eight (Clock).

Here's a nice approach to default no-arg constructors by John Kenny:

#HW8,Prob 1, Point

class Point(object):

    def __init__(self,horiz=0,vert=0):
        self.x= horiz
        self.y= vert

    def show(self):
        return "("+str(self.x)+","+str(self.y)+")"

    def dist(self,f):
        return ((((self.x-f.x)**2)+((self.y-f.y)**2))**.5)

y = Point()
a = Point(3,0)
b = Point(0,4)
c = Point(1,1)

print "the distance between the points",a.show(),"and",b.show(),"is:", a.dist(b)
print "the distance between the default",y.show(),"and",c.show(),"is:", c.dist(y)

raw_input("Press 'Enter' to exit: ")

It is good exam practice.

Here's some help with Homework Nine:

def magic(n):
     m = []  
     for i in range(n):
         m.append([0] * n)
     return m
     
def show(m):
     for i in range(len(m)):
         for j in range(len(m)):
             print m[i][j],
         print
         
n=int(raw_input("Enter size of matrix: "))
if n%2==1:
     l = magic(n)
     show (l)
else:
     print "This is not a valid magic square dimension"

Here's the basic update procedure. Assume we update randomly here:

import random

def magic(n):
     m = []  
     for i in range(n):
         m.append([0] * n)
     for k in range(1, n*n, 1):
         i = random.randrange(n)
         j = random.randrange(n)
         m[i][j] = k
     return m
     
def show(m):
     for i in range(len(m)):
         for j in range(len(m)):
             print ("   " + str(m[i][j]))[-3:],
         print
         
n=int(raw_input("Enter size of matrix: "))
if n%2==1:
     l = magic(n)
     show (l)
else:
     print "This is not a valid magic square dimension"

Enter size of matrix: 5
  23  11  16   0  22
   0  20  10   0   9 
  21   0   0  13  24
   4  17   0   7   0 
  12  19   0   0  14

Below we have the code developed with Magnai Ganzorig in class on Fri:

def average(line):
    new_line=""
    tokens=float(len(line.split()))
    for words in line.split():
        new_line+=words
    return len(new_line)/tokens # this was the helper method 

text_file=open("text.txt","r")
lines=text_file.readlines()
print lines
text_file.close()               # this part gets all the data in a list 

text_file=open("output.txt","w")
for line in lines:              # element by element 
    text_file.writeln(str(average(line))) # we apply the helper to the lines

file=""                         
for line in lines:
    file+=line                  # turn the file (list of lines) in one long line 
text_file.writeln(str(average(file)))  # then apply the helper to the resulting string

text_file.close()
print "Program finished. Thank you." 

def sameSet(a, b):
    for i in range(len(a)):
        if not a[i] in b:
            return False
    for elem in b:
        if not contains(a, elem):
            return False
    return True

def contains(a, elem):
    for e in a:
        if e == elem:
            return True
    return False

Here's a solution to the seventh problem on the same assignment:

def sameElements(a, b): # other approach sort then equals
    for e in a:
        if count(e, a) != count(e, b):
            return False
    for e in b:
        if count(e, a) != count(e, b):
            return False
    return True

def count(elem, a):
    sum = 0
    for i in a:
        if i == elem:
            sum += 1
    return sum

Here's the Coin problem we developed in class:

import random

class Coin(object):
    def __init__(self):
        self.heads = 0
        self.tails = 0
    def flip(self):
        num = random.randrange(2)
        if num == 0:
            self.tails += 1
        else:
            self.heads += 1
    def report(self):
        return "Heads: " + str(self.heads) + ", tails: " + str(self.tails);
    def reset(self):
        self.heads = 0
        self.tails = 0

coin = Coin()
for exp in range(20): 
    for i in range(1000):
        coin.flip()
    print coin.report()
    coin.reset()

class Pattern(object):
    def __init__(self, size):
        result = []
        for i in range(size):
            row = " *" * size
            result.append(row.split())
        self.result = result

Wednesday	Thursday		Friday	Monday
Danny Kaufman	David Gower	Joel Richardson	Magnai Ganzorig	Preeti Misra

• Wed Jun 7, Danny Kaufman (Chapter 4)
• Thu Jun 8, David Gower and Joel Richardson (Chapters 5, 6)
• Fri Jun 9, Magnai Ganzorig (Chapters 7, 6)
• Mon Jun 12, Preeti Misra (Chapter 8)

In addition anyone who wants to contribute is more than welcome too.

Lectures from now on will start with review then someone will work out problems from the list posted.

Labs will ask you to take notes in lecture and implement those notes in lab and submit them to OnCourse.

# Defined Sum Average:
x = 0
def numbers():
   newnumb = []
   userin = ""
   while userin == "":
       userin = raw_input("Enter the string of numbers\n(ex. 5 3 6 4): ")
       newnumb = userin.split()
   return newnumb

def sum(numbers,x):
   """Sums numbers entered, and counts how many entered"""
   x = 0
   total = 0
   for i in range(len(numbers)):
       total += float(numbers[i])
       x += 1
   return total,x

def average(sum):
   aver = float(sum[0])/sum[1]
   return aver

print "To get the average", average(sum(numbers(),x))," = The Average"

raw_input("Press 'Enter' to exit: ")

They will hope to act as Charlie Rose and David Brancaccio. This promises to be good.

Tomorrow final review starts, featuring Joel Richardson and David Gower as our exclusive analysts.

Tomorrow Chapters 1 and 2, more details to be posted soon.

size = int(raw_input("What size: "))

for lin in range(size):
    for col in range(size):
        if lin == 0 or lin == size - 1 or col == 0 or (lin == size / 2 and col < size/2):
            print "*",
        else:
            print " ",
    print

Labs Eleven and Twelve, Homework Assignments Seven and Eight to be posted today.

Grades for the exam to be posted Thu morning in Postem.

Lab notes for the day have been posted.

Date: Sun, 28 May 2006 22:58:21 -0400 (EDT)
From: Adrian German <dgerman@cs.indiana.edu>
To: A201/A597 First Summer 2006 <dgerman@indiana.edu>
Subject: A201/A597 Update (Midterm Exam, Review Sessions)

Just a reminder there is a review session tomorrow night:

      Monday 7:15-9:15pm in LH102 (lecture room)

and also one on Tuesday, same time, same place.

Homework Six is due tomorrow at the end of the day and the
exam is on Wednesday in class, during lecture.

Solutions for all the problems not on Homework Six have been
posted Saturday evening under Lecture Notes Fourteen. If you
have any questions please let me know.

Tomorrow the building is locked, so I will be at the back door
around 7:05pm to start admitting people for the review session,
hope to see everyone who needs help there.

Gradebook has been updated, complete set of grades plus grade
reports sent by e-mail, individually, to follow tonight.

... Adrian

When the update is finished we will send a notification by e-mail to everybody and post it here too.

Both help sessions are CONFIRMED:

• MONDAY at 7:15PM in Lindley Hall 102 (lecture room)
• Tuesday also at 7:15pm in LH102 (same room as always)

Monday because the building is locked:

• I will be admitting people
• between 7:05-7:15pm
• at the NE door (backdoor next to elevator).

• calculate the grade for homework (at the end)
• by summing up the 10 (ten) scores and dividing by 7 (seven).

• all the code in the first six chapters of the book posted under Lecture Notes Twelve,
• problems for exam in Lecture Notes Thirteen (solutions to follow).

Here's the polynomial solution to the months problem discussed in class with John Ullman.

• one on Monday at 7:15pm in LH102
• and one on Tuesday at 7:15pm in LH102

I will try to confirm these as soon as possible (and find out the status of LH on Monday).

Reminder, Shakila's office hourse are noon-1:00pm Tue, Wed, Thu in LH406.

Knock on the door and ask about Shakila or make appointment by e-mail.

Adrian's office hours: 9:30-10:30am daily or 9:00am-1:00pm daily by appointment (both in LH201D).

Except today I won't be available 10:15am-12:30pm.

Sally Wood will be our guest today.

Program that Sally will be developing for us:

A good test file for this program would be (note all the spaces):

Code developed today in class: problem 3 assignment 4 solved by Joel Richardson problem 4 assignment 4 solved by Preeti Misra jumpstart for the lab assignment for today have just been posted under Lecture Notes Eleven.

Here's an alternative statement for problem 3 on the first homework assignment:

(Averages) Write a program that

• asks the user to enter 10 (ten) numbers,
• one number per line
• and prints back (after every line)
• the current average of all the numbers entered up to that point.

Program stops after the tenth number is processed.

Your program must only use two variables not more.

Assignment statements and simple numeric expressions is all you need.

• hangman game and the
• word jumble program

(run them, submit them to OnCourse).

Grades for the semester will be posted here from now on (check A201-7055).

Code developed with Nick Quagliara in class yesterday is now posted as part of Lecture Notes Six. The lecture today will be a review and overview of the problems discussed this week in lecture and lab. The lab will be a collection of notes setting you up for the weeks ahead. Your lab assignment for today May 18 will be posted before lecture and discussed in class too.

Today in class we will discuss branching, paths and conditional execution statements in Python.

Homework Assignments Three and Four are now complete with examples and sample runs.

Note they contain a lab assignment (seven programs) that need to be turned in today, in OnCourse.

Date: Mon, 15 May 2006 17:06:15 -0400 (EDT)
From: Adrian German <dgerman@cs.indiana.edu>
To: A201/A597 Summer 2006 Distr. List <dgerman@indiana.edu>
Subject: A201/A597 update 


Dear A201/A597 Friends,

Just a reminder Homework One is due tonight. Homework Two is due
tomorrow. Please try to keep up with the due dates and should you
encounter any problems please let us know by e-mail, or in person
during office hours and we will promptly try to help.

With the labs this week we're going to start focusing exclusively
on Python. It would be good to try to install Python from the CD that
comes with the text on your machines, and to experiment with it while
looking through chapters 1, 2 and 3 of the Python book for tomorrow.

We will continue to refer to Alice, and will finish reviewing the
entire Alice textbook in class, but that would be for illustration
purposes only. The true problem-solving emphasis of the course will
however switch to the Python book in labs and gradually in lectures
as well (this week the lectures will be half and half).

Lab Notes for the week will be posted tonight, as will be the next
two new homework assignments. If you need any help or have questions
please let us know and we will try to help immediately.

Sincerely,
Adrian German

Please check this link for Python API info.

Here are three worlds we might need on Monday:

• the queen problem as discussed on Fri (to be wrapped up on Mon)
• the beetles world, to be discussed on Mon
• the snowpeople exercise, with methods (was the lab exercise on May 10)

Don't forget to stay current with the reading assignments for the week.

Today in lab you will also be given a brief taste of Python.

We would just like to see how it compares in general with Alice (in terms of programs one can write, interface, program development etc.)

Grading guidelines for this course.

Calendar for this summer session sketched on the class notes page.

Lecture Notes Two posted, provide a review of the main example in Chapter Two.

Labs will be taught by Shakila Shayan.

Notes for this class as taught in:

• Spring Semester 2005

• First Summer 2004

Office hours for Adrian, for now: daily 9:30-10:30 in LH201D.

Schedule of office hours to be posted soon.