COMP 1301: Computer
Science I
Fall 2008 Semester
Class: Tuesdays
& Thursdays
Room
132C
Lab: Fridays
Room
132C
Instructor: Christine
Kikuchi
Office: 129C
Office
Phone: 449-7590
Email: ckikuchi@waycross.edu
Prerequisite: MATH 1113 or consent of instructor
Office Hours: Mondays and Wednesdays: 9:25 AM - 10:40 AM
Room
Tuesdays
and Thursdays:
Open Lab Hour Fridays
(for all computer students)
Room 132C
Course
Materials:
|
Author |
Book |
ISBN |
|
Dale,
N., Weems, C., & Headington, R. |
Programming and Problem Solving With C++, 4th
Edition, Jones & Bartlett, April 2004 |
0763707988 |
|
Software: This
class will use the Microsoft C++
programming language, version 6.0. There is no need for students to buy the
program. C++ is installed on all of the |
||
|
Supplies:
You will need to have a portable storage device to save your work.
Assignments and program code may not be saved to the computer's hard drives. |
||
Computer Laboratory Facilities: The
Waycross College Computer Laboratory is available a number of hours outside of
class time for you to prepare assignments. Times available for you to use the
Computer Laboratory are posted at the Lab. No documentation or software may be
removed from the Computer Lab and no programs may be installed on the machines.
Course Description
An introduction to the fundamentals of computer programming emphasizing
problem solving, development of algorithms and structured programs using modern
programming paradigms and techniques. Simple data types, arithmetic and logic
operators, selection structures, repetition structures, text files, arrays, and
procedural abstraction and software design are included. This course involves
extensive programming activities.
Course Introduction:
It is expected that you will have some basic knowledge in using a computer, i.e., copying files, installing software, creating directories (folders), and using Windows.
Participating in this course is a wonderful way to ease into various computer studies fields.. Our goal will be to improve your reasoning and thinking skills, which should prove helpful, not only in future programming and mathematics classes, but throughout your academic and professional career.
COMP 1301 is an introduction to the field of computer programming and algorithmic problem solving. The course will provide an understanding of fundamental object-oriented programming concepts and constructs. It focuses on the techniques and concepts of object-oriented program design. This course is a prerequisite for COMP 1302 and students who complete this class should be able to read/write simple programs in pseudocode and C++.
Many of the benefits of this course are derived from practicing the learning
techniques with others. Good learning, like good work, is collaborative and
social; learning is not competitive, and learning is not achieved in isolation.
By sharing your ideas with others, and responding to their reactions, not only
will your thinking skills be sharpened, but your understanding of the subject
deepened as well. To get the maximum benefit from this, it is necessary,
therefore, to complete the assigned readings on time and actively participate
in the class.
Methodology:
Classes will assume that you have read the required materials and prepared
the assignments. Classes will include lecture, discussion, participation, and opportunities
to work with C++ to learn programming.
Course Goals/Objectives
After completing this course, you should be able to:
· solve critical thinking problems
· understand what an algorithm is and know how to write simple algorithms
· grasp the basics of object-oriented programming
· be able to solve small programming problems in a correct and creative manner
· create, compile, and execute simple programs in a modern programming language.
· know how to use the programming constructs of sequence, iteration, and selection.
· comprehend and use fundamental programming concepts such as data types and declarations, assignment statements, variables, constants, and arithmetic and logical operators
· have a solid understanding of functions, scope, and lifetime of identifiers, and an awareness of the power of one-dimensional arrays.
· be familiar with debugging programs.
· utilize proper naming conventions for variables and constants
· document programs effectively and design and use test data for validating programs
·
appreciate how well designed interfaces add to
the success of applications
Grading
Information:
Grades will be determined as follows:
|
(6) homework assignments (7% each) |
35% |
|
(5) quizzes (students will take 6 quizzes, but the lowest quiz grade will be dropped - 3% each) |
15% |
|
(8) Labs (1.25% each) |
10% |
|
Midterm Exam |
20% |
|
Final Exam |
20% |
|
TOTAL |
100% |
The grading scale, based on 100 points, is:
|
A |
90-100 points |
|
B |
80-89 points |
|
C |
70-79 points |
|
D |
60-69 points |
|
F |
0-59 points |
In order to receive full credit,
assigned work must be submitted at the start of the class on the scheduled due
dates. Late assignments will not
be accepted. If a homework assignment or test is missed, documentation
must be provided showing the reason for the student's absence. No makeup test or assignment will be
given without sufficient written documentation. Arrangements for make-ups of the midterm
and final exam are made only for official emergencies and must be made prior to
the examination. Documentation must be provided showing the reason for the
student’s absence. No makeup test will be given without sufficient
written documentation.
EXTRA CREDIT: There is no such thing as Extra Credit.
QUIZZES:
Each quiz will be a combination of short answer, fill-in the blank, multiple
choice, essay questions, and problems. Quizzes will be taken on "lab
days" and will cover one chapter and the lecture notes for that chapter.
There will be a total of six quizzes, covering chapters 1, 2, 3, 4, 6, and 9;
however, the lowest quiz grade will be dropped.
LABS: There will be eight labs and it is vital that students attend the lab and do the work. Successfully accomplishing the lab work will help students be able to complete their homework assignments and be more successful in taking quizzes and exams.
EXAMS:
Each examination will be a combination of short answer, fill-in the blank,
multiple choice, essay questions, and problems. Attention to class discussions,
being able to discuss and apply assigned reading materials, participating in
class, and completion of assignments and projects will prepare you for the
examinations. Exams will be taken over two days. The midterm will cover Chapters
1 - 5 and the lecture notes and the final exam will Chapters 6 - 9 and the
lecture notes.
HOMEWORK PROJECTS: There will be six homework assignments. All papers must have your full name, class title and section, and assignment number written on them.
The projects are designed to give the student practical experience with the theory presented. Students having trouble with the projects are encouraged to seek help from a classmate, the instructor, or other person. Do not wait until the last minute to begin work on your projects.
Group work is encouraged, but only for studying the material discussions. Note that plagiarized programs or exams, whether or not copied in whole or in part, will receive a grade of 0 (zero).
TIME REQUIREMENTS: Students will be spending a considerable amount of non-classroom time researching, reading, and preparing class assignments. A rough estimate, based on the mythical average student, would be 10-12 hours per week in outside class time.
ATTENDANCE: Attendance will be taken during each class. If you come to class late, it is your responsibility to make sure that you have not been put down as absent. An absence is counted as not being in class for any reason. An instructor may drop a student from any class with a grade of "WF" when he/she has missed twenty percent of the regularly scheduled class meetings. It remains your responsibility to obtain information concerning the material covered and upcoming assignments.
TO DROP A COURSE WITHOUT PENALTY: In order to drop a course officially without
penalty, a student must obtain and fill out a Drop/Add form from the
Registrar's office, acquire appropriate signatures, and return the completed
form to the Registrar's office before the designated date published in the Academic Calendar
posted on the College website.
PLAGIARISM:
Plagiarism, intentional or unintentional, is prohibited. Plagiarism is defined
by Webster as "the stealing and passing off of the ideas or words of
another as one's own". Further, the MLA Handbook states, "Plagiarism
may take the form of repeating another's sentences as your own, adopting a
particularly apt phrase as your own, or even presenting someone else's line of
thinking in the development of a thesis as though it were your own." (p.
4) Alleged violations involving plagiarism and other academic misconduct will
be handled according to the procedure outlined in the Waycross
College Student Handbook.
REGENTS' TEST: The Regents' Testing program was developed to assess the reading and
writing competencies of students in the University System of Georgia. Students
in programs leading to the baccalaureate, Associate of Arts or Associate of
Science degree must pass both components of the Regents' Test as a requirement
for graduation.
The Regents' Test
measures literacy and writing abilities.
The
GRADE OF INCOMPLETE The grade of Incomplete is only given in extraordinary circumstances. The grade is given to students who for reason of illness, accident, or emergency are unable to complete a segment of the course. Students requesting an incomplete must have completed at least 75 percent of the course work and hold passing grade in the work completed.
Course Schedule: (This schedule is subject to change)
|
Week |
Session Dates |
|
Labs & Quizzes |
|
1 |
AUG 19
& AUG 21 |
Welcome to class Chapter #1: Overview of Programming & Problem Solving |
Lab One |
|
2 |
AUG 26 & AUG 28 |
Chapter #1: Overview of Programming & Problem Solving (continued) Chapter #2: C++ Syntax and Semantics, & the
Programming Development Process Programming Assignment One
Assigned |
Quiz One (Chapter 1) |
|
3 |
SEP 2
& SEP 4 |
Chapter #2: C++ Syntax and Semantics, & the Programming Development Process (continued) |
Lab Two |
|
4 |
SEP 9
& SEP 11 |
Chapter #3: Numeric Types, Expressions & Output Programming Assignment Two
Assigned Programming Assignment One
Due (SEP 11) |
Quiz Two (Chapter 2) |
|
5 |
SEP 16
& SEP 18 |
Chapter #3: Numeric Types, Expressions & Output (continued) Chapter #4: Program Input & the Software Design Process |
Lab Three |
|
6 |
SEP 23
& SEP 25 |
Chapter #4: Program Input & the Software Design
Process (continued) Programming Assignment Three
Assigned Programming Assignment Two
Due (SEP 25) |
Quiz Three (Chapter 3) |
|
7 |
SEP 30
& OCT 2 |
Chapter #5: Conditions, Logical Expressions, & Selection Control Structures Programming Assignment Four Assigned |
Lab Four |
|
8 |
OCT 7 & OCT 9 |
Chapter #5: Conditions, Logical Expressions, & Selection Control Structures (continued) Review for Midterm Programming Assignment Three
Due (OCT 9) |
Quiz Four (Chapter 4) |
|
9 |
OCT 14 & OCT 16 |
Midterm (Chapters 1 - 5 and lecture notes) |
Open Lab - Catch up |
|
10 |
OCT 21 & OCT 23 |
Chapter #6: Looping Programming Assignment Four
Due (OCT 23) |
Lab Five |
|
11 |
OCT 28 & OCT 30 Tuesday, October 28 - Advising Day/Regents' Test - No
classes |
Chapter #6: Looping (continued) Programming Assignment Five
Assigned |
Quiz Five (Chapter 6) |
|
12 |
NOV 4 & NOV 6 |
Chapter #9: Additional Control Structures |
Lab Six |
|
13 |
NOV 11 & NOV 13 |
Chapter #9: Additional Control Structures (continued) Chapter #7: Functions Programming Assignment Five Due (NOV 13) |
Quiz Six (Chapter 9) |
|
14 |
NOV 18 & NOV 20 |
Chapter #7: Functions (continued) Programming Assignment Six Assigned |
Lab Seven |
|
15 |
NOV 25 & NOV 27 Thursday, November 27 - Thanksgiving |
Chapter #8: Scope, Lifetime, & More on Functions |
Thanksgiving |
|
16 |
DEC 2 & DEC 4 |
Chapter #8: Scope, Lifetime, & More on Functions (continued) Chapter #12.1: One-dimensional Arrays Programming Assignment Six Due (DEC 4) |
Lab Eight |
|
17 |
December
8 - 10 |
Final Examinations (Chapters 6 - 9 and
lecture notes) |
|