Getting started with Alice: one, two.

Schedule:

• grade reports to be sent by e-mail tonight,
• Saturday we wait for any comments,
• Sunday turn them in to the Registrar.

You will receive either:

• 1-2 problems like those on the midterm/practical or
• 3-4 smaller problems each about half the size of those on the midterm/practical

The exam is written and closed-book, entirely based on the homework and labs.

Problems are like those we posted for you to work on and review.

Just relax, review and come to the exam ready to apply what you've learned this semester:

1. values, expressions, variables, assignment statements
2. decisions, booleans, if statements, loops (while, for)
3. sequences (strings, tuples, lists): indexing, slicing
4. dictionaries, functions, text file I/O

Class today will discuss more examples of problems, take questions.

As a last note, a saying: "Education is what's left after you forget everything you learned in school."

Makeups are not encouraged, unless truly necessary.

Alice code for the Hanoi problem (see link above).

Code developed in class in preparation for the exam:

1. exam001.py
2. exam002.py
3. exam003.py
4. exam004.py

Notes for the rest of the week, grades to be posted Monday.

A brief note about Chapter 6 from the Spring notes of A202.

Notes updated for last Fri and the Fri before.

1. bubble sort
2. selection sort
3. magic square with nested lists
4. magic square with dictionaries
5. play addition quiz with the user

Grades for the Midterm, third week coming up.

No office hours today, I am in Chicago.

See posted notes for pool of problems and additional information.

Date: Sun, 27 May 2007 17:55:59 -0400 (EDT)
From: Adrian German 
To: A201/A597 Summer I 2007 Distr. List 
Subject: a201/a597 update 


Dear A201/A597 Friends,

Notes for Tue May 29 and Wed May 30 have been posted, they discuss the 9
(nine) problems you need to focus on for the midterm. Note that the first
two labs this week will be used as mock (pretend) exams. Both Metal and I
will be there, just to be sure you get enough help. The exam is on Thu in
class, with the lab on Thu offering a chance to self-grade your work right
after you submitted it and perhaps catch errors and fix/explain them so as
to not lose all the points---or, to just confirm it to yourself that all's
well and your exam was perfect.

Individual grade reports for the second week forthcoming, later tonight.

Sincerely,
Adrian German

1. teach the computer to play the game of nim with the user
2. find/extract the prime factors of a positive integer
3. determine the greatest common divisor of two positive integers
4. report the letter profile of a string received from the user
5. generate random sized random matrix of integers and print it nicely
6. scalable patterns (4, A, C, E, Q, M, W, F, H, K, N, Z, P, R, V, X, Y)
7. teach the computer to play the game of hangman with the user
8. jumble the word (generate a permutation of the user input)
9. sorting a list of integers (bubble sort, selection sort)

Lecture notes for Tue and Wed will include detailed solutions for these problems.

Labs will be used for exam practice (Tue, Wed details to be posted) and as part of the exam (Thu).

Full details to be posted Sunday May 27 and sent by e-mail as part of our weekly individual grade reports.

We hope to use it in the context of the on-going review for the exam.

Code we might refer to in class (or develop in class).

Code developed in class yesterday.

Some pseudocode discussed during office hours.

Homework Six will be: describe (better than the book does) the info presented in chapters 1, 2, 3.

Homework Seven will be: describe (better than the book does) the info presented in chapters 4, 5.

Feel free to re-organize the material between the two if you so think it necessary.

There will be three more lab assignments this week (programs).

All of these (Labs 7, 8, 9 and Hw 6, 7) are due next Tue, May 29, in OnCourse.

Additional details in the notes to be posted.

Useful resource:

http://www.libraries.iub.edu/scripts/countResources.php?resourceId=59555

http://docs.python.org/lib/decimal-tutorial.html

>>> import decimal
>>> 4.35 * 100
434.99999999999994
>>> decimal.Decimal(str(4.35 * 100))
Decimal("435.0")
>>> 0.1 * 10
1.0
>>> 0.1 + 0.1 + 0.1 + 0.1 + 0.1 + 0.1 + 0.1 + 0.1 + 0.1 + 0.1
0.99999999999999989
>>> 0.1
0.10000000000000001
>>> decimal.Decimal(str(0.1))
Decimal("0.1")
>>> decimal.Decimal(str(0.1 + 0.1 + 0.1 + 0.1 + 0.1 + 0.1 + 0.1 + 0.1 + 0.1 + 0.1))
Decimal("1.0")
>>> for i in range(10):
	a += decimal.Decimal("0.1")
	
>>> a
Decimal("1.0")
>>>

Date: Wed, 16 May 2007 22:54:28 -0400
From: "German,  Dan-Adrian" <dgerman@indiana.edu>
To: SU07-BL-CSCI-A201-C2304@oncourse.iu.edu
Subject: minute papers from now on, individual feedback forthcoming

Dear A201/A597 Friends,

Starting tomorrow your minute papers should include a brief summary,
comprising perhaps the most memorable things in your current reading
assignment, or any highlights that would emphasize the essential ideas
of the reading assignment for the day. Of course, you can bring your
minute paper written already from home. Then, in class, we will likely
ask a question during the lecture anyway, and you will add that to the
paper as brought from home and turn that in.

I will read them carefully, it will help me understand how you absorb
the information in your readings.

Individual feedback is forthcoming, including grades for the the first
week and feedback from your minute papers collected thus far.

Thanks and let me know if you need me in any way.

Sincerely,
Adrian German


----------------------
This automatic notification message was sent by Oncourse (https://oncourse.iu.edu/portal) from the SU07 BL CSCI A201 C2304 site.
You can modify how you receive notifications at My Workspace > Preferences.

There is a box open in OnCourse for Week One (Labs 1, 2, 3 and Homework 1, 2).

It's better to turn assignments late than never, so keep working until you finish them.

Ideally you will turn them on time (on Tuesdays) but if you're late turn them in late.

Late assignments are not encouraged (in fact they are discouraged) but they are accepted.