|
COURSE SYLLABUS |
||||||||||||||||
|
Course Number: CPT 232 Course Title: C++ Programming I |
||||||||||||||||
|
Class Hours Per week: 3 |
Lab Hours Per Week: 0 |
Credits Awarded: 3 |
||||||||||||||
|
Catalog Description: |
This introductory course in C++ programming emphasizes the designing, coding, testing and debugging of C++ programs involving input/output operations, data types, storage classes, decision structures, looping, functions, arrays, simple pointers and strings. |
|||||||||||||||
|
Entry Level Skills: |
The student should be proficient with the C programming language and able to use arrays, pointers, structures and file I/O. |
|||||||||||||||
|
Pre-requisites: |
CPT 234 |
|||||||||||||||
|
Co-requisites: |
None |
|||||||||||||||
|
Text(s)/Required
Materials: |
· Text(s): C How to Program, Fourth Edition, Deitel and Deitel, Pearson Prentice Hall, © 2004 · Storage media: USB flash drive |
|||||||||||||||
|
Course Competencies
and Objectives: |
Upon satisfactory completion of the course, the student should be able to: · Use dynamic memory allocation in programs · Use linked lists, stacks, queues and structures · Understand the concepts of Object Oriented Programming (OOP) · Understand encapsulation and data hiding · Create classes · Create, use and destroy class objects · Understand and use friend functions and classes · Use container and iterator classes · Use operator overloading · Create new classes by inheritance · Understand how inheritance promotes software reusability · Understand and use base classes and derived classes · Use polymorphism and virtual functions · Understand the distinction between abstract and concrete classes · Use C++ stream I/O · Use class templates to create a group of related types · Use C++ exception handling |
|||||||||||||||
|
Major Course
Topics: |
Dynamic memory allocation Linked lists; stacks, queues and trees Object Oriented Programming (OOP) Data hiding Classes – Abstract & Concrete References Unary scope resolution operator Friend functions and classes Container and iterator classes Operator overloading Inheritance Base classes and derived classes Polymorphism and virtual functions Stream I/O Templates Exception handling |
|||||||||||||||
|
Grade Calculation
Method: |
There will be a Midterm Exam at the end of the seventh week of the semester and a Final Exam at the end of the course. Throughout the course short quizzes will be given and a series of programming assignments will be completed. The final grade will be calculated as follows:
|
|||||||||||||||
|
Additional Information
Pertaining to Grades: Students must earn a minimum grade of ‘C’ in any course used to fulfill graduation requirements of a Computer and Information Technology program. |
||||||||||||||||
|
Prepared by |
Date written or
revised: 4/20/2006 |
|||||||||||||||