Section 1, CPSC 210: 9:05 - 9:55 a.m.
Monday, Wednesday, Friday in Daniel 408
Textbooks:
Java Elements by Duane A. Bailey and Duane W. Bailey (ISBN 0-07-228357-2) and Java Structures by Duane A. Bailey (ISBN 0-07-289179-3).
This course is a combination of CPSC 101 and 102 and is intended only for students who have completed the CPSC 101 material in some language other than Java.
Topics include algorithm development, use of alternation and iteration, arrays, recursion, classes and object oriented design, linked lists, binary trees, and algorithmic complexity.
Since this course is a combination of CPSC 101 and 102, you should expect to spend almost as much time and effort on this one course as you would expect to spend on two normal courses. You will need to attend class regularly, read the text books, and turn in homework.
Students who do not wish to expend this type of effort are advised to take CPSC 101 and 102 instead.
A looseleaf notebook is to be kept with contents grouped as follows:
- Homework in chronological order
- Daily quizzes in chronological order, including correct answers to quizzes.
- Hour quizzes.
- Additional handouts, class notes, and homework
This notebook may NOT contain copies of pages from the text (Making copies of the text is copyright violation and is thus illegal.).
Laboratory Grade:
The laboratory grade will be determined by your laboratory instructor and will count 10% of the final grade.
You must be enrolled in L210 and lab attendance is mandatory.
A passing grade (i.e., >= 60) in laboratory is required to pass the course.
Individual Programming Assignments will be made at class meetings and will count 20% of the final grade. A grade of at least 50% must be earned in the individual programming assignments to pass the course.
Short quizzes and class work:
Short quizzes and class work will be given (almost) every class meeting. These will usually be at the beginning of the class period. If you are late and do not turn in a quiz, you need to give the instructor a sheet of paper with your name clearly printed and the date. This must be done before leaving class on the day you are late.
If N is the number of such quizzes and class work, the number of such grades computed in the average will be ceiling(0.8N).
No makeups of these quizzes/class work will be given for any reason. Since only the best eight out of ten grades will be counted, there is an allowance for absences (excused and unexcused).
Short quiz/class work grade will be 10% of the final grade. Some grades may result from work in small groups. In the case of group work, one paper will be handed in for each group.
Homework will usually be associated with reading assignments and will count 15% of the final grade.
Homework will be checked randomly. Some homeworks will be collected and graded. Some will be checked only for completion. Some homework will not be checked by the instructor, but all homework should be done as assigned.
Hour Quizzes:
Hour Quizzes will be given Friday, February 7, and Friday, March 14. Note that March 14 is the Friday before Spring Break.
Please speak to the instructor this week if either hour quiz is going to be a problem for you.
No makeups of hour quizzes will be given for any reason. If an absence from an Hour Quiz is excused, the final exam will count an additional percentage to replace the missed quiz. If you know in advance that you will miss an Hour Quiz, the instructor will attempt to allow you to take the quiz before the regularly scheduled date. The first Hour Quiz will count 10% of the final grade and the second 15%, making the hour quizzes contribute 25% to the computation of the final grade.
Final Exam:
The final exam will be cumulative and a grade of at least 50 on the final exam is required in order to pass the course.
The Final Exam will be cumulative and will count 20% of the final grade. Exams and quizzes may consist of a closed notes/book and an open notes/book section.
Attendance Policy:
ATTENDANCE IS REQUIRED. The number of unexcused hours of absence for the lecture component of this class may not exceed three (3).
In order that an absence be designated as "excused" you must discuss the absence with the instructor within one week after returning to class and the instructor must agree that the absence is "excused".
Each unexcused absence beyond 3 will deduct 4 points from the final average grade earned in the course. For example, if a student has four unexcused absences and computation of the final grade produces a grade of 72, the final grade will be 68. (Hint: get two alarm clocks and be sure you have a way to get to class even if your car won't start.)
If you have exceeded the maximum number of allowed absences before the last day to drop, you may be dropped from the course.
Mastery Topics:
There are some topics in this course that are
so important to your understanding of future courses that failure to understand
these topics will present major problems. These topics are:
- The ability to trace recursion of complex code. You will be expected
to trace recursive code, using the standards handed out in class.
- The ability to explain correctly the linked list implementation of
stack. You will be expected to know how to initialize linked list
data structures, perform push and pop, and explain the time and space
complexity of the operations on he data structure. Drawing the data
structure may be required.
- The ability to explain correctly the linked list implementation of
queue. You will be expected to know how to initialize linked list
data structures, perform enqueue and dequeue, and explain the time and
space complexity of the operations on the data structure. Drawing the
data structure may be required.
Mechanism for testing mastery: At least three opportunities will
be given to demonstrated mastery of each ability. If possible, at least one of these
opportunities for each ability will appear on an hour quiz. At least
one of these opportunities for each ability will appear on a short
(daily) unannounced quiz. The third opportunity to demonstrate mastery
may appear on a short quiz, on a second hour quiz, or on the final exam.
Such opportunities will be clearly labeled "Mastery". Failure to
achieve "Mastery" at the 90% level on any of these three areas will
result in a grade for the course no higher than 'D'.
Statement on the Trial Period for Plus/Minus Grading
Clemson University is committed to all aspects of academic excellence,
including the
exploration of possible improvements to grading policies. Accordingly,
beginning
with the 2002-2003 academic year, a trial period for the plus/minus
grading system
will be in effect for two years. Although the trial will be ongoing, only non-
plus/minus grades will be used to calculate GPRs. There will be no effect on
transcripts or grade reports, and the data will be used solely for research
purposes.
If at the end of the trial period the plus/minus system is implemented, its
implementation will affect all current students at once; i.e., the change
will be
announced in the Undergraduate Announcements for the year in which it is to
take
effect. This should ensure that a smooth transition is made.
For more information on this grading system, please see the Registrar's web
site at www.registrar.clemson.edu.
Grading Scale:
A+ 96.6 <= grade
A 93.3 <= grade < 96.6
A- 90.0 <= grade < 93.3
B+ 86.6 <= grade < 90.0
B 83.3 <= grade < 86.6
B- 80.0 <= grade < 83.3
C+ 76.6 <= grade < 80.0
C 73.3 <= grade < 76.6
C- 70.0 <= grade < 73.3
D+ 66.6 <= grade < 70.0
D 60.0 <= grade < 66.6
F grade < 60.0
Instructor:
Eleanor Hare
email: ehare@clemson.edu or ehare@cs.clemson.edu
office: 433 Edwards Hall
phone: (864)656-5874
Plagiarism and Academic Dishonesty
The Clemson University official Statement on Academic Integrity states "As members of the Clemson University community, we have inherited Thomas Green Clemson's vision of this institution as a high seminary of learning. Fundamental to this vision is a mutual commitment to truthfulness, honor, and responsibility, without which we cannot earn the trust and respect of others. Furthermore, we recognize that academic dishonesty detracts from the value of a Clemson degree. Therefore, we shall not tolerate lying, cheating, or stealing in any form."
The Clemson University Computer Science Department Academic Honesty Policy can be found at http://www.cs.clemson.edu/html/academics/honest_policy.shtml. If you have any questions as to what I consider honest, please ask!