Date: Wed, 20 Nov 1996 22:32:35 GMT Server: Apache/1.0.3 Content-type: text/html Content-length: 15327 Last-modified: Fri, 03 May 1996 19:28:53 GMT
| Steven D. Johnson, Associate Professor | ||
sjohnson@cs.indiana.edu | |||
Office hours: Tue. and Thu. 2:30-3:30pm in Lindley 330F, or by arrangement | |||
Jim Newkirk, Associate Instructor
| jnewkir@cs.indiana.edu
| Office hours:
Wed. 1:00-3:00pm (tentative) in Lindley 330I, or by arrangement
| |
Computation takes place in a discrete digital domain where all phenomena ultimately reduce to binary 1s and 0s. To explore this universe we need different mathematical tools than are used by physicists and chemists. We use induction far more often than differentiation or integration, for example, and will see numerous styles of inductive reasoning in this course. We will also explore discrete mathematical structures, trees and other graphs, that are prevalent in computing.
The main goal of the course is to improve each participant's ability to conduct a rigorous mathematical argument, that is, to do proofs. One reason (not the only one) we look at logic in this course is for the purpose of evaluating proof narratives. A central idea of this course is that "doing a proof" and "programming" are pretty much the same activities. The better you are at proving, the better programmer you will be. More important, the better computer scientist you will become.
I plan to follow the text book, except for Chapters 4 (Prolog),
8 (Specification in Z), and 12 (Relational Database Systems). I may
have to skip more chapters, depending on our progress through the material.
I may also introduce some topics from later chapters as we go along.
There are a few topics not in the text that we may look at, again, if there
is time. In any event, I will cover all the material of a core 251 course.
Syllabus and supplementary material
One or two weeks will be devoted to each of the chapters listed below.
Supplementary material is (or will be) included below the chapter listing in
some cases. This is an evolving syallabus, which will grow as
the course develops. Check it weekly for new additions to the supplementary
material.
In this course, you are welcome to discuss assignments, presentations, and challenges with other students. Do not assume this is true in all your courses! Teamwork in doing assignments is good as long as each member of the team contributes, and fully understands the assignment. If you are working with a group, please indicate it on your homework papers. If someone has given you a lot of help, acknowledge them; you will not be penalized and they will get the thanks they deserve.
Grading and gradebooks
The gradebook will be posted on this home page and updated regularly.
The course newsgroup, ac.csci.c251 used to post announcements, such as assignments, exams, and any exceptions to our usual office hours. You are also encouraged to use it to post questions related to the course, participate in discussions, or share related information with the class. Please make a habit of looking for new notes a few times each week.
On individual matters, please feel free to contact your instructor or
associate instructor via email or to drop by their office. The
scheduled office hours are reserved for S251 students, but you are welcome
and encouraged to drop by at other times.
Course Evaluation
Participants are strongly encouraged to use the department's
World-Wide-Web based course evaluation system, which can be accessed
through the Computer Science Department's
home page.
Evaluation summaries will be extracted two times during the semester.
During the first three weeks, students will be asked to provide feedback
on all aspects of the course, providing an early opportunity to inform
the instructors about how the course should be run.
Final course evaluations are taken seriously by the department and are
integral to yearly faculty and department evaluations.
To encourage participation, credit
will be given to those students who submit a full evaluation during the
week prior to final examinations. The evaluations are anonymous,
but a transaction record is generated whenever an individual evaluation
is updated. These transaction records are compiled and sorted by the
Undergraduate Secretary. Thus, the instructor is informed about who
filed evaluations independently of what those evaluations may contain.
Final evaluation content will not be reviewed by the instructor until
after grades are assigned.
Policies
Attendence.
Not all the material presented in this course is in the text book.
Class attendance is not monitored and is not mandatory, although
regular attendance and class participation are a factor in
grading. Attendance at examinations
is mandatory and make-up examinations will normally not be given.
No special assignments or projects will be given to help students
raise their grades.
Academic Integrity. If you have not already done so, please read the Computer Science Department's Statement on Academic Integrity to be sure you understand the rules under which computer science courses operate. Cases of academic dishonesty will be reported to the Office of Student Ethics, a branch of the Office of the Dean of Students.
Withdrawal. Wednesday, March 6, is the last day to drop a course or withdraw from all courses with an automatic W. After that date, a student may withdraw only with the permission of his or her dean. This approval is normally only for urgent reasons related to extended illness or equivalent distress.
Incompletes. An incomplete (I) final grade will be given only in exceptional circumstances conforming to university and departmental policies which requires, among other things, that the student must have completed the bulk of the work required for the course with a passing grade, and that the remaining work can be made up within 30 days after the end of the semester. If these conditions cannot be met withdrawal is the appropriate course of action.