CMPUT 325: Assignment 3

	Reinforcement Learning and Artificial Intelligence (RLAI)
	CMPUT 325: Assignment 3

New Due Date:
Due: Monday, 9 October, 2006 by 23:59:59.

Specs:
Do exercises 2.5, 2.7, 2.8, 2.18, 2.20, 2.21, 2.27, 2.33, 2.38 and 2.39 from Structure and Interpretation of Computer Programs (second edition).

Submission Instructions:
Write all your answers in a plain text file named a3. From the directory where this file is located, type in the following command:

astep -c c325 -p ex3 a3

When prompted if this is your primary submission, answer Y. You may submit as many times as you like; the last version you submit will be marked. All submissions should be primary submissions, not just the last.

We ask that you follow the Style and Submission Guidelines exactly. We will not be deducting marks on the assignment if you do not, however.

Rules, Guidelines and Suggestions:

Language change: Please make sure your submitted code works under the language, Standard (R5RS). Also make sure the Case Sensitive option is checked.
For exercise 2.5, you do not need to do the "show" part. Just provide the procedure definitions as asked. You are allowed to use the built-in functions expt and remainder.
The code you write for exercises 2.5, 2.18, 2.20, and 2.27 will be tested electronically. To ensure we can test your code, please do the following:

Write your answers to all the other exercises inside comments. Comments in Scheme are delimited by the characters #| and |#
For 2.5, you should define the functions mycons (which takes 2 integer parameters), mycar (which takes one integer parameter) and mycdr (which takes one integer parameter).
For 2.18, you should define the function reverse, which takes one parameter, which is a flat list, for e.g. (list 1 2 3).
For 2.20 you should define the function same-parity which takes one or more parameters as defined in the question
For 2.27 you should define the function deep-reverse which takes one parameter, a list that can have as many sub-lists as possible. For e.g., (list (list 1 2) (list 3 4)). Hint: you will need to use the pair? primitive procedure.
You may write whatever additional functions you need, you can also use block structures.

Use functional programming in this and all assignments from Chapters 1 and 2. To be on the safe side:

use only functions that have been mentioned in the book prior to the exercise being worked on (unless specified otherwise).
never use mutating operators, such as (re)assignment of variables. Define is ok

For questions which require procedures to be written, hand in syntactically correct Scheme code (which hopefully is also algorithmically correct)
We will be marking for style on some questions. Code which is cleanly written, and which performs the given task well will receive a higher mark than solutions which are poorer in terms of structure and algorithm. Put closing parenthesis on the same line as the thing they enclose, not on a new line by themselves. No orphan parenthesis!
Be certain you are using the correct edition of the text. Not all exercises are similar between the first and second editions of the text. Ditto for the online version

Test Cases
Make sure these test cases are not included in the file you submit for marks.

Mark Breakdown:

Question	Marks
2.5	2
2.7	1
2.8	2
2.18	3
2.20	3
2.21	2
2.27	4
2.33	3
2.38	3
2.39	2
Total	25
Cumulative Total	78

Back to CMPUT 325 Homepage

Extend this Page How to edit Style Subscribe Notify Suggest Help This open web page hosted at the University of Alberta. Terms of use 1199/0