The purpose of this course is to introduce the student to the major ideas and techniques of Artificial Intelligence, as well as to develop an appreciation for the engineering issues underlying the design of intelligent computational agents. The successful student will finish the course with specific modeling and analytical skills (e.g., search, logic, probability), knowledge of many of the most important knowledge representation, reasoning, and machine learning schemes, and a general understanding of AI principles and practice. The course will serve to prepare the student for further study of AI, as well as to inform any work involving the design of computer programs for substantial application domains.
Students will be evaluated on a combination of team and individual efforts.
- Team efforts include six problem sets, each with a substantial programming exercise. Teams will be assigned by the staff based on student preferences and rotated every two problem sets. Team members will turn in peer evaluations.
- Individual efforts include two midterm exams, which will be held in the evening, and a final exam.
|Problem Sets||32 %|
|Submit end-of-term course evaluation||1 %|
If all members of a team receive 85/100 or higher on their midterms or finals, all will receive an additional 5% bonus on that exam. The purpose of this policy is to encourage you to help each other by forming study groups.
- The participation grade will be determined from peer evaluations as part of each lab, as well as in-class participation (particularly during discussion sections).
- Students must provide screenshots of course evaluation "receipt" (not the a screenshot of the evaluation itself.)
The problem sets (along with their programming exercises) are collaborative activities. Each team must turn in work that is wholly their own: teams are encouraged to discuss problems, strategies, ideas, algorithms, etc. with other teams, but their write-ups (including software) must be done independently.
Members of a team are required to work together on the problems; dividing up the problems and working separately is not acceptable. This will require at least one in-person meeting. On every problem set, each team will certify when their team met and who attended, noting any exceptions. With each problem's solution being the product of the group, all members will be held accountable for violations of the honor code. Students must sign the statement below, noting any qualifications necessary to render the statement true:
"I participated and contributed to team discussions on each problem, and I attest to the integrity of each solution. Our team met as a group on [DATE(S)]."
An example of a reasonable qualification might be: "Jimmy was out of town when we met, but Amy and Jimmy were able to meet later on. Jimmy's ideas were emailed to us and are reflected in our final solutions." We expect exceptions to be rare, but we understand that life can be complicated! The certification should be physically signed by each team member, and a photo attached to the submission.
Note that every student on a team will receive the same grade on that project. Students will evaluate their teammates; a student's evaluations will affect their participation grade.
It is not acceptable to use code or solutions from outside class (including those found online) unless the resources are specifically suggested by the problem set. This includes (but is not limited to) previous years' materials (regardless of whether it originated from staff, students, etc.), the textbook's solution manual, etc.
Assignment Turn-in and Lateness Policy
Problem sets are due at 11:59p on their corresponding due date and should be submitted electronically by email (including a photo of the signature page). Late problem sets will be penalized 10% for each day (or fraction of) that they are late; after three days, no credit will be given.
Students who miss an exam for legitimate reasons will be given a make-up oral exam by the staff. Approval for absences should be sought at least two weeks before the scheduled exam. All other absences will result in a zero score.