Notes: (1) Homework's and projects should be submitted before 5:00pm on the
due date.
(2) Late penalty
applies as discussed in class. Tip: don't be late as you're busy with other
courses too.
(3) You can submit
your homework either to the instructor in class, or other times in the general
office (have it time-stamped).
Your suggestions are welcome. Please share your views with me (hliu@asu.edu).
LISP Assignment (extra credit): Please see myASU Assignments for details.
Deadline: Feb 9 Wednesday 11:59am, 2005.
All homework assignments are chosen from the text.
All should be submitted in hard copy unless specified otherwise.
Homework 1 (7 problems) due on 02/10/2005, 5:00pm Thursday
Chapter 1 (page 30): 1.1, 1.2, and 1.7 (f-i)
Chapter 2 ( page 56): 2.2, 2.3, 2.5 (b,d), and 2.6 (b,d)
Project 1 – please
find the details here.
Homework 2 (8 problems)
due on 02/24/05 5:00pm Thursday
Chapter 3 (page 90): 3.6, 3.7 (a, b), 3.8, and 3.13
Chapter 4 (page 134): 4.2, 4.3, 4.4 (graph-search algorithm is Fig 3.19), and
4.7
First Exam is on March 24,
Thursday.
Homework 3 (7 problems)
due on 03/21/05 5:00pm Monday (you can always turn in before deadline at the
CSE main office)
Chapter 7(page 236): 7.4, 7.5, 7.8
Chapter 8 (page 268): 8.6 (b, e, f, k),
8.7
Chapter 9 (page 318) 9.4, 9.9
Question of Resolution with Refutation: Given the following facts:
Do the following
Project 2 – please
find the details here.
Homework 4 due on 4/18/05 5:00pm Monday
Chapter 18 (page 676) 18.4, 18.5, 18.7, 18.10
Chapter 19 (page 710) Discuss the pros and cons
of version space and decision tree induction.
Homework 5 due on 4/29/05 5:00pm Friday
Chapter 11 (page 412) 11.2, 11.7 (a, b)
Chapter 12 (page 460) 12.1, 12.11, 12.18