Course Administration for CS250
Tuesdays 2-4pm or by appointment
Usually, I will also be available after class on both Tuesdays and Thursdays.
We'll communicate amongst ourselves in several ways. Lectures and class discussions are obviously a key element, but there's more. Much more. Generally, I'll post relevant information to the Web site1, which you should check frequently. The Web site will often have updated information on assignments (e.g., hints, reductions and expansions). There are also HyperNews discussion groups so that we can continue our discussions outside of class. Finally, I will sometimes send email to the class (or just you), and email is a great way to reach me.
Course grades will be based on class discussion, a midterm, programming assignments and a final project. Approximate breakdown of the weight of each component is given below, but the weight will often vary among individuals.
The aim of the final project is to give you chance to dig a bit deeper into a topic that interests you. Your project doesn't neccesarily need to focus on a topic that we cover during the quarter, as long as its related to AI. Papers and/or code will be acceptable. As a rough gauge of the size of the project, a paper alone should run about 10 pages, and a program would probably be several hundred lines of Lisp code. (Several hundred lines might not sound like much if you're used to C, but Lisp is a different ballgame.) Some example projects would be:
Pass-fail is at the discretion of the instructor , and I'm generally inclined against it for this class. If you'd like to take the class pass/fail, send me a note by email stating your reasons.
Sharing thoughts and ideas with your fellow students is not only suggested, it is encouraged. Except for the final project, you should turn in your own work. If you gave or received extensive help, you should note on your assignment who you gave help to, or received help from. In this context, "extensive" means either in terms of time or difficulty. For example, if you struggled with a Lisp function for two days, and some one showed the trick to writing an elegant recursive version, that constitutes extensive help, even if the whole exchange only took a few moments.
It's a shame I even have to include a section on this topic, but I've learned from past experience. In a nutshell, if I catch you cheating I reserve the right to adminster the most severe punishment I can possibly muster under the academic code. If there is any doubt in your mind regarding the prorpriety of your actions (past or planned), talk to me. Do not mistake my gentle, easy-going nature as a sign of someone who is sympathetic to the cries of those caught red-handed.
![]() |
This page maintained by Kurt D. Fenstermacher.
Last updated on December 29th, 1998.