|
COURSE SYLLABUS |
||||||||||||||||
|
Course Number: CPT 234 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, preprocessor directives, arrays, and simple pointers. |
|||||||||||||||
|
Entry Level Skills: |
The student should be proficient with the use of the Microsoft Windows operating system and the use of application programs under that system. The student should have a general understanding of number systems, basic mathematical operations and the process of problem solving. |
|||||||||||||||
|
Pre-requisites: |
CPT 167 |
|||||||||||||||
|
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 input and output statements · Understand differences in data types · Use arithmetic operators and understand their precedence · Use logical operators · Use decision statements · Understand problem solving techniques · Develop algorithms to solve problems · Convert algorithms to source code · Use looping constructs · Modularize programs using functions · Understand the mechanisms used to pass information between functions · Use arrays to store and access information · Search and sort arrays · Use pointers and pointer operations · Create and use structures and unions · Create, read, write and update files |
|||||||||||||||
|
Major Course
Topics: |
General program structure Data types and variables Input / Output instructions Arithmetic and logic instructions Equality, relational and logic operators Decision making; if-then and switch instructions Iteration; while and for instructions Functions; definition and prototypes Call by value and call by reference Scope rules Introduction to recursion Developing programs to solve problems Debugging techniques The process of incremental development Comments, structuring and documentation techniques Arrays; defining and accessing, passing to functions Sorting and searching arrays Pointers; definition and initialization Pointer expressions and pointer arithmetic Structures and unions; definition and initialization Accessing members of structures and unions File I/O; sequential and random access |
|||||||||||||||
|
Grade Calculation
Method: |
There will be a Mid Term 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 is calculated as follows:
|
|||||||||||||||
|
Additional Information
Pertaining to Grades: Students must earn a minimum grade of ‘C’ in all CPT/IST courses used to fulfill graduation requirements of a Computer and Information Technology program. |
||||||||||||||||
|
Prepared by |
Date written or
revised: 4/20/2006 |
|||||||||||||||