CSCI2350-01 Course Syllabus
Object Oriented Programming (C++), Fall 2010

PROFESSOR INFORMATION
Name:             Dr. Yao
Office:             Atk 317
Telephone:      (478) 445-5483
Email:              jf.yao@gcsu.edu
URL:               http://abacus2.gcsu.edu 
Office Hours:  8:20a.m.--9:20a.m., 10:50a.m.-12:20p.m. on Tu. and Th.  or by appointments 

CLASSROOM AND LAB: A&S 143

REQUIRED TEXT: Starting Out with C++: From Control Structures through Objects (6th Edition) by Tony Gaddis

COURSE DESCRIPTION : Students are introduced to C++, and strengthened in the knowledge of object oriented languages and the concepts of object oriented design of algorithms. The central issues of data hiding, encapsulation and polymorphism are emphasized.

EXPECTED COURSE OUTCOME:

1.      Students will become familiar with the object-oriented programming language, C++;

2.      Students will understand data encapsulation and data hiding;

3.      Students will understand composition, inheritance and software reusability;

4.      Students will be able to create and manipulate super-classes and subclasses;

5.      Students will be able to create use and destroy objects;

6.      Students will be able to control access to object instance variables and methods;

7.      Students will be able to appreciate how polymorphism makes systems extensible and maintainable;

8.      Students will understand exceptions and error handling;

GRADING CRITERIA:

Students learning will be assessed primarily through participation in programming homework, written responses to tests, and a cumulative final exam.

Assessment will be based on one or more of the following criteria:

• A demonstrated proficiency and mastery in developing software with an object-oriented programming language;

• Attend class regularly, complete programming homework assignments, and actively participate in classroom activities;

• Demonstrate an understanding of the object-base and object-oriented programming;

• Exceptional performance on all tests, and the cumulative final examination.

GRADE DISTRIBUTION:                                               

• Mid-Term Exam: 35% (October 7, 2010)

• Final Exam: 35% (11:00a.m.-1:45p.m., Th, Dec. 9, 2010)

• Homework: 30%    

COURSE POLICY:

• Class and lab participation is essential in learning computer technology.  It is your responsibility to attend the class/lab in order to achieve good learning, therefore obtain a good grade.

• You must NOT miss a test unless you have a verifiable written excuse.  An unexcused absence from a test will result in a numerical grade of zero for that test.

• The homework material may be included in the tests.  Therefore, doing homework assignments yourself is essential in obtaining a good score in a test.

• Late assignments will be penalized 10% per day after the assigned due day. 

ACADEMIC HONESTY:

The integrity of students is a critical component of the academic process.  All written work submitted in this course must be individual work unless the instructor assigns a team of students to work on an assignment. Students must properly document all outside sources used for projects, programs, and homework. The submission of anotherﾒs work as oneﾒs own is plagiarism, and will be dealt with using the procedures outlined on the Undergraduate Catalog.

 TENTATIVE LECTURE SCHEDURE:

WEEK              TOPICS

=============================================================

1.               Chapter 1: Introduction to Computers and Programming

2.               Chapter 3: Expression and Interactivity 

3.               Chapter 6: Functions

4.              Chapter 7: Arrays

5.              Chapter 9: Pointers

6.              Chapter 10: Characters, strings, and the string Class

7.              Chapter 11: Structured Data

8.              Chapter 12: Advanced File Operations 

9.              Chapter 13: Introduction to Classes

10.            Chapter 14: More About Classes 

11.            Chapter 15: Inheritance, Polymorphism, and Virtual Functions      

12.            Chapter 16: Exceptions, Templates, and the Standard Template Library (STL)

13.            Chapter 16: Exceptions, Templates, and the Standard Template Library (STL)

14.            Chapter 17: Linked Lists

15.            Chapter 17: Linked Lists            

16.            Chapter 19: Recursion

17.            Chapter 19: Recursion

(Class ended Dec. 6, 2010)  

Labor Day Holiday (Sept. 6, 2010)
Fall Break (Oct. 11-12, 2010)
Thanksgiving Holidays (Nov. 24-26, 2010)

OCTOBER 14, 2010 IS THE LAST DAY TO WITHDRAW A COURSE WITHOUT ACADEMIC PENALTY.

FIRE DRILL PROCEDURE

In the event of a fire alarm signal students will exit the building in a quick and orderly manner through the nearest hallway exit.  Learn the floor plan and exits of this building. Do not use elevators.  Crawl on the floor if you encounter heavy smoke. Assist disabled persons and others if possible without endangering your own life. Assemble for a headcount on front lawn of main campus.