22C111 Course Syllabus Fall 2007
Programming Language Concepts
Monday-Wednesday-Friday 2:30-3:20 room 217 MacLean Hall
Professor: Ted Herman, 201M MacLean, Telephone: 335-2833
E-mail: herman at cs.uiowa.edu
Office Hours: 11:30-12:00 every day
Prerequisite: grades of C- or higher in 22C:019, 22C:021, and 22C:022
Miscellaneous Announcements: The University of Iowa Policies.
This course is given by the College of Liberal Arts and Sciences (CLAS). This means that class policies on matters such as requirements, grading, and sanctions for academic dishonesty are governed by the College of Liberal Arts and Sciences. Students wishing to add or drop this course after the official deadline must receive the approval of the Dean of the College of Liberal Arts and Sciences. Details of the University policy of cross enrollments may be found at: http://www.uiowa.edu/~provost/deos/crossenroll.doc.
See the student academic handbook for administrative procedures, your rights and responsibilities, and other topics. The official classroom procedures for faculty includes policies on cheating and plagiarism, students with disabilities, and other topics. In particular, we are required to state the following: I would like to hear from anyone who has a disability which may require seating modifications or testing accommodations or accommodations of other class requirements, so that appropriate arrangements may be made. Please contact me during my office hours.
Also, we are required to specify the following information. The name of the department, location of the departmental office, and information on how to contact the DEO or his/her designee: Department of Computer Science, 14 MacLean Hall, Professor James Cremer, DEO
- "Statement that, for each semester hour credit in the course, students should expect to spend two hours per week preparing for class sessions (e.g., in a three-credit-hour course, standard out-of-class preparation is six hours)."
- "Procedures for student complaints." There is rather specific language (legalese) describing the escalating hierarchy of complaint procedures in several University documents. Typically, the student tries to resolve the matter with the instructor; then it can go to the department chairman or higher levels of authority. Please see the official documents for all the details of grievances and appeals.
- The collegiate policy on plagiarism and cheating Plagiarism and cheating are not tolerated. In the past, I've gone so far as making multiple versions of quizzes and examinations to discourage cheating (which had the unfortunate side-effect of being "unfair" because not all examinations were identical). Generally, students caught cheating for the first time may be given a penalty up to an automatic F in the course. Such an F cannot be removed from the transcript. Penalties up to expulsion may apply to second offences. While you are encouraged to discuss homework problems with others in the class (this is a good way to learn), do not discuss anyone's solutions prior to turning in your final copy! In some cases, I may assign group homeworks, and of course the submitted work will be by the group in those cases, where collaboration is expected.
- Goals and objectives of the course. This course examines advanced topics in programming languages, for example, syntax specification and informal semantic models; program control structures, including recursion, co-routines, backtracking, and concurrency; and data abstraction and structuring methods. The course introduces programming paradigms, such as functional and logic programming, that contrast with more conventional languages. Examples and assignments may rely on several languages such as Java or Python, with Prolog for the logic programming part and Haskell for the functional programming part.
- Schedule of topics, readings, and course materials or other description of course content. See above, and frequently consult the course web page for assigned readings, pointers to online documents, and other announcements.
- Grading procedures, including whether plus/minus grading will be used. Plus/minus grading will be used based on normalizing total student scores to a curve. There are two examinations: midterm and final. Examination scores contribute 50% of the final grade. There will be at least four in-class quizzes. Quiz scores will contribute 20% of the final grade. There will be at least six homework assignments, and homework scores contribute 30% of the final grade. Above, it is noted that students can expect to spend about six hours per week outside of class on this course.
- Instructor's or departmental policies on attendance and tardiness, assignments, and examinations. Students are expected to attend classes. No late homeworks are accepted if solutions have been posted to the course web site. There is no guarantee that late homeworks will be accepted; if the Professor or TA agree to accept a late homework, the score will be penalized: homeworks submitted late, but before the TA has graded all the on-time homework, will be penalized by 20%; homeworks submitted after the TA has finished grading all the on-time homeworks, but within a week of the deadline, will be penalized 50%.
Dates and times of any exams scheduled outside of class time and the date and time of the final examination. According to the University's Final Examination Schedule, the final examination will be at 7:30 a.m. on Tuesday, December 18 2007.
- Corrections or changes (if any) in the information about the course printed in the Schedule of Courses or other official University publications. Corrections, updates and announcements will be posted on the course web page version of this syllabus.
- Resources for obtaining additional help, such as tutors, teaching assistants, or tutorial laboratories (if any). Most of the additional resources are online or in libraries. They will be announced on the course web page.