This course is the second course for computer science majors, following the guidelines established by the Association for Computing Machinery. This course also partially satisfies the requirements for Understanding the World Through Science of the common curriculum. The course content will include defining data types including singly-linked lists, doubly-linked lists, stacks, queues, and trees; recursion; use of libraries; pointers; dynamic memory; type-independent programming; and program implementation strategies.
The objectives of this course include, but are not limited to, the following:
Most course-related information (this syllabus, homework and reading assignments, etc.) will be made available via the World Wide Web. The course Web page is a starting point for Web-accessible course material; you can find it linked from my home page (http://www.cs.trinity.edu/~bmassing), directly at http://www.cs.trinity.edu/~bmassing/CS1321_2001fall/, or via Tiger's Lair (http://bb.trinity.edu/).
Grades in this course will be determined by the results of three major exams (two midsemester exams and a final exam) and several homework assignments. Each midsemester exam will be worth 100 points, the final exam will be worth 200 points, and together the homework assignments will be worth approximately 400 points, with the weight of individual assignments determined by their length and difficulty. Numeric grades will be calculated as a simple percentage, by dividing points earned (on homework assignments and exams) by points possible. These numeric grades will then be converted to letter grades based on a curve, but in no case will the resulting letter grades be worse than students would receive based on the following scheme:
| Numeric grade | Letter grade |
|---|---|
| 90 - 100 | A |
| 80 - 89 | B |
| 70 - 79 | C |
| 60 - 69 | D |
| 0 - 59 | F |
Exams are comprehensive but will emphasize the most recent material. They are scheduled as follows. Please plan accordingly.
Several homework assignments will be required for successful completion of this course. Detailed requirements, including due dates and times, will be provided as part of each assignment; normally you will have about a week between the time the homework is assigned and the time it is due. Most homeworks will be C++ programming assignments. You are encouraged to use the department's network of Linux machines, but unless otherwise specified for individual assignments, you may use any other system that provides a suitable environment.
Regular class attendance is strongly encouraged.
Course-related announcements will sometimes be made by sending e-mail to the Trinity e-mail addresses of all registered students. Students are strongly encouraged to read mail sent to their Trinity addresses frequently. An archive of such announcements will be provided via the course Web page.
Exams can be made up only in cases of documented conflict with a university-sponsored activity or documented medical emergency. Homework will normally be accepted up to one class period late, but no more, at a penalty of 10 percent off per working day. This penalty may be waived or additional time allowed at the instructor's discretion in cases of illness or conflict with a university-sponsored activity.
If you have unusual circumstances (as we all sometimes do), please discuss these with the instructor as far in advance as possible.
Unless otherwise specified, all work submitted for a grade (homework assignments and exams) must represent the student's own individual effort. Discussion of homework assignments among students is encouraged, but not to the point where detailed answers are being written collectively. Answers that are identical beyond coincidence are in violation of Trinity's Academic Integrity Policy and will result in disciplinary action, including, but not limited to, a failing grade on that assignment for all parties involved. You are responsible for the security of your work, both electronic and hard copy.