HW5 - FOL, PROLOG and Planning

HW4 - Games, Propositional Logic and Simulated Annealing

HW3 - Search

HW2 - Machine Learning - Neural Networks

Exercise1: Decision Trees

HW1 - Machine Learning - Decision Trees

•  Academic Misconduct
• All examinations, programming assignments, and written homeworks must be done individually. Cheating and plagiarism will be dealt with in accordance with University procedures. Hence, for example, code for programming assignments must not be developed in groups, nor should code be shared. You are encouraged to discuss with your peers, the TAs or the instructor ideas, approaches and techniques broadly, but not at a level of detail where specific implementation issues are described by anyone. If you have any questions on this, please ask the instructor before you act.
• Late policy on HWs
• HWs are due at 5 pm. Turn in HWs during class or in Zaverucha's mailbox (5th floor of CS building).
• Each student will have FIVE "free" late days for use over the semester, for delays due to illness, especially hectic weeks, interview trips, etc. Once these are exhausted, there will be a penalty of 10 points per day (measured 5pm-to-5pm; weekends are free).
• To make the TA's job tractable, no HWs will be accepted more than one week late.
• Here is a good command to use for printing out files of code (do a man print for more information):

      		print -landscape -Plaser HW1.java