CS 1440 - Computer Science I

Course Syllabus (Sections 101 and 103)

(ASU - Fall 2000 )


Professor: Rahman Tashakkori
Office: CAP 127B
Office Phone: 262-7009
Office Hours: MWF 9-10,  MWF 2-3 for sure and other times if my office door is open.
Class Time/Location: Section 101 MWF 11:00-11:50/CAP 307
                                 Section 103 MWF 8:00-8:50/CAP 337
Lab Location: CAP 439
Email:  rt@cs.appstate.edu
Web Page: http://www.cs.appstate.edu/~rt/

Course Description
This course is the first programming course for majors and minors in computer science. It is taught using the C++ programming
language. Topics covered include introduction to computers, problem solving and algorithm development, C++ programming, programming style, and program testing.

Topics Covered
Topics covered include the departmental computing environment, problem solving, program design, the C++ language, and debugging C++ programs. We will cover chapters 1 - 5, 7, 9 and 10 of the textbook. If we have time left at the end of the semester, we will also cover chapter 6. I will use the learn-by-example method. Thus, I will supplement the instructional material with some labs involving the Department's computer system.

MAT 1020 or MAT 1025 or equivalent with a grade of C- or higher

Required Texts
Problem Solving with C++: The Object of Programming, 2nd Edition, by Walter Savitch

Grading Policy
The following grading scale is used in this course:
                         Two exams, 20% each.
                         Final exam, 25%.
                         Quizzes (usually unannounced), 10%.
                         Homework 15%.
                         Labs and projects %10
Students are required to attend all classes.  Short quizzes will be given at the beginning of some of the classes.  These quizzes are very easy and are designed to help students with their understanding basic concepts and with their grades.  All assignments are due before the start of the class on the due date.  No assignment will be accepted once the solution is discussed in the classroom. To help students with the instructional material, some of the solutions will be posted on the web page of the course.  No make-up exams will be given in this course.  If you missed an exam due to an "Extreme circumstances" such as illnesses, death of a relative, or problems of this nature, you have to present documents (e.g. a letter from a doctor, a letter from a hospital, or an obituary from the funeral).  In the such cases, student's final exam's grade will be used for the missed exam.

All assignments and programs MUST be completed by students individually.  No collaboration are allowed for completing assignments and programs.  You may discuss the assignments and programs among each other but you have to write/edit programs by YOURSELFand have to understand them and be able to describe them in the classroom.   Please see the ASU Academic Integrity Policy for a description of the woes that befall a transgressor!

Grading Scale
A = 90 to 100
B = 80 to 89
C = 70 to 79
D = 60 to 69
F = Below 60

No incomplete will be given except in extreme circumstances.

Important Note
I will work on to the system several hours in the evenings and over the weekend.  Eventually, I may set online office hours and extra labs to help you with the instructional material and assignments.  If you have a question send me e-mail at any time, and I will try to reply as soon as possible.  I encourage all students to communicate with me using e-mail whenever they have questions.  I also encourage you to check the announcements periodically for updates regarding our class, assignments, etc....

Course Schedule

Date / Topic / Reading

August 16 / Course Introduction, Algorithms
August 18 / More algorithms / Sections 1.1 - 1.2

September 7 / Convocation and Assessment Day (no class)

October 21 / Fall Break (no class)

Final Exam:
Section 101 : Tuesday 12/12/00, 3:00-5:00 PM
Section 103 : Friday    12/08/00, 3:00-5:00 PM