CSCI 2990 Spring 2009
Algorithmic Design
Tentative Syllabus:
TIME: Tuesday and Thursday, 8-9:30 AMLOCATION: Smith 322
INSTRUCTOR: Dr. Fay A. Riddle
OFFICE: Smith 305
OFFICE PHONE: 706.880.8279
OFFICE HOURS: Mon./Wed./Fri. 9:40-10:40 AM, Mon. 1:45-2:35 PM; Thurs. 11:15-11:55 AM (except for faculty meeting days). Available by appointment at other times.
CATALOG COURSE DESCRIPTION: A continuation of CSCI 1990. Further development of techniques for program design, program style, debugging and testing, especially for larger programs. Introduction to algorithmic analysis. Introduction to the basic aspects of string processing, graphical user interfaces, recursion, internal search/sort methods, and simple data structures.
COURSE OBJECTIVES: To continue the development of discipline in style and expression, in debugging and testing, especially in larger programs; to introduce algorithmic analysis; to introduce basic aspects of string processing, graphical user interfaces, recursion, internal search/sort methods, and simple data structures.
TECHNOLOGY REQUIREMENTS: All correspondence (assignments, test information, etc.) will be via e-mail. Each student will be expected to provide an e-mail address to the instructor by the end of the first week of class. Students will be expected to check their e-mail on a daily basis. Cell phones and audible pagers must be turned off in class unless there is a prior arrangement with the instructor.
ATTENDANCE REQUIREMENTS: The Bulletin says, "A student is expected to attend all classes, including labs, for all courses for which he/she is registered. The student is solely responsible for accounting to his/her instructor for any absence. An instructor may recommend that the Academic Dean drop from class with grade of W or U any student whose absences are interfering with satisfactory performance in the course."
Each student is allowed two unexcused absences; any other absence must be excused by the instructor. I will excuse a maximum of 4 absences. Anyone with more than 7 absences (including excused and unexcused) will be penalized 6 points per absence, regardless of excuse. The instructor reserves to right to assign an F to any student with too many absences. Your daily grade is influenced by your attendance. The instructor reserves the right to count a student as absent if the student is late to class.
The student is responsible for all material covered, assignments and test dates announced, and any other announcements made on the day the student is absent. Makeup tests are not automatic; they may only be expected under unusual, documentable circumstances (and at the discretion of the instructor) and, in such a situation, normally only if arranged with the instructor in advance of the test or exam. Absence from class is not an excuse for late or no homework.
COURSE REQUIREMENTS:
READING ASSIGNMENTS: The instructor will assume that the student reads those sections of the text corresponding to what is covered in class, as well as any assigned readings. The instructor reserves the right to give quizzes on assigned readings.
PROGRAMMING ASSIGNMENTS: Programming problems will be assigned regularly and should be turned in by class time on the date specified. Five points will be deducted if submitted late on the due date. Ten points per day for the first two days of lateness will be deducted; after two days, the instructor reserves the right not to accept the assignment.
TESTS: There will be three tests tentatively on February 26, March 18, and April 15, and a final exam on May 12 at 8 AM.
GRADING POLICIES AND PROCEDURES: The homework assignments will count a total of 11% of the course grade. Homework will be collaborative in nature. You may work with as many other students as you desire as long as (a) you and they indicate the collaborators' names with the homework, (b) you do not just copy someone else's homework, and (c) you understand what you are submitting well enough to correctly answer questions on the material on a test. If a student does well on the homework but poorly on related material on a test, the instructor reserves the right to assign a grade of zero to that homework, report the incident to the Honor Council, and suspend the collaboration policy for all students.
Each test will count 21% of the course grade, the exam 21%, and the daily grade 5%. The grading scale is as follows:
98 to 100 A+ 92 to 97.9 A 90 to 91.9 A-
88 to 89.9 B+ 82 to 87.9 B 80 to 81.9 B-
78 to 79.9 C+ 72 to 77.9 C 70 to 71.9 C-
66 to 69.9 D+ 60 to 65.9 D 0 to 59.9 F
The daily grade will be computed as follows: 0-2 unexcused absences: 5 points; 3 unexcused: 3 points; 4 unexcused: 1 point; 5 unexcused: 0 points; 6-7 unexcused: 1 point deducted from your grade; 8-9 unexcused: 2 points deducted from your grade; etc. The quiz grades will also affect the daily grade.
TEXTBOOK: Java How to Program (Seventh Edition) by Deitel and Deitel.
COURSE OUTLINE: The following topics will be covered as time permits. Additional topics may be included as necessary.
1. Introduction to Computers, the Internet and the World Wide Web.2. Introduction to Java Applications.
3. Introduction to Classes and Objects.
4. Control Statements: Part 1.
5. Control Statements: Part 2.
6. Methods: A Deeper Look.
7. Arrays.
8. Classes and Objects: A Deeper Look.
9. OOP: Inheritance.
10. OOP: Polymorphism.
11. GUI Components: Part 1.
12. Graphics and Java 2DT.
13. Exception Handling.
14. Files and Streams.
