HAROLD WASHINGTON COLLEGE COURSE SYLLABUS

Department: Class Index: Credit Hours: Course Title: Course Schedule: Classroom: Instructor: Office: Office Hours: E-mail: Semester: CATALOG DESCRIPTION: Introduction to Programming with C++ Fundamentals of structured problem-solving in C++ language: emphasis on syntax, data types, operators, control structures, functions program structure, pointers, arrays, input, and output; students will complete programs in C++ of moderate size and complexity. Writing assignments, as appropriate to the discipline, are part of the course. Prerequisites: Computer Information Systems 103, or Computer Information Systems 106, or Computer Information Systems 107, or Computer Information Systems 130, or Computer Information Systems 135, and Math 112 or higher or Consent of Department Chairperson Information Technology CIS 142 3 Introduction to Programming with C++ Tuesday and Thursday 08:00am 09:20am 407 Paul Aikonedo 311B Tuesday and Thursday 09:30am 10:30am paikonedo1@ccc.edu Fall 2011

COURSE OBJECTIVES:

The student will learn the basic concepts and programming skills in C++ applications that provide a background to prepare them for a career in the field.
EXPECTED LEARNING OUTCOMES: Read and write programs written in C++ Language Write programs in C++ Language of moderate difficulty using simple data structures such as array, buffer and etc. Write programs in a modular form

Amount of Writing Required:

Computer programming requires the preparation of source code with explanatory

comments in English CURRENT TEXT AND MATERIALS USED: <<An Introduction to Programming with C++>>, Sixth Edition, Diane Zak, 630 pages Soft cover; Publish date: 2011 ISBN: 10: 0-538-46652-9 ISBN: 13: 978-0-538-46652-3 TEACHING METHOD 1. Lectures and Assignments 2. Quizzes: Occasional unannounced quizzes will be given to help ensure students stay up with assigned material. 3. Exams: Three exams will be given. The exams will be closed book/notes and will test assigned readings and material discussed in class. Review sheets will be provided prior to the exam day. The final exam will not be comprehensive in nature. However, the instructor reserves the right to retest on material that was not appropriately comprehended. These items will be noted on exam review sheets. 4. Participation: Student participation will be graded by the level of class participation and attendance. COURSE POLICIES: Missed Classes: The student is responsible for obtaining material distributed on class days when he/she was absent. This can be done through contacting a classmate who was present or by contacting the instructor during his office hours or other times. Missed or late quizzes cannot be made up under any circumstances but with good cause and adequate notice, an early quiz may be given. One quiz (lowest score) will be dropped at the end of the semester. Assignments: All assignments are due at the beginning of class on the date due. Late submission of assignments will be assessed a penalty of 10% per day. No exceptions are made. Academic Dishonesty: Cheating is an unethical behavior. In short: don't do it! You may work with friends to help guide problem solving, but copying from friends, previous students, or the Internet is strictly prohibited. Cheating is a mark of disrespect for the school, your instructor, and your classmates. If I suspect a student of cheating on the lab assignment, exam, or project, I will fail you in this course and report you to the

appropriate school authority for action against you. Students are encouraged to discuss lab assignments or projects and coding techniques. However, students may NOT work on lab assignments or projects with one-another unless the lab assignment or project is group work. Students may NOT share code with one-another. Plagiarism and cheating are serious offenses and may be punished by failure on exam, paper or project; failure in course; and or expulsion from the College. For more information refer to the "Academic Dishonesty" policy in the College Undergraduate Catalog. Restating my earlier statement on this matter, for this class, it is permissible to assist classmates in general discussions of computing techniques. General advice and interaction are encouraged. Each person, however, must develop his or her own solutions to the assigned projects, assignments, and tasks. In other words, students may NOT "work together" on graded assignments. Need for Assistance: If you have any condition, such as a physical or learning disability, which will make it difficult for you to carry out the work as I have outlined it, or which will require academic accommodations, please notify me as soon as possible. Internet Support: Check the class Web page for additional information about Office 2007, or to post a question about this course. Posting of Grades: Final grades will not be posted. If you wish to have your final grade sent to you, please bring a self-addressed, stamped envelope to the final exam. Incomplete Policy: Students will not be given an incomplete grade in the course without sound reason and documented evidence as described in the Student Handbook. In any case, for a student to receive an incomplete, he or she must be passing and must have completed a significant portion of the course. Students who have actively pursued a course and earned a passing grade up to the final examination period, but have not completed the final examination and/or other specific course assignments, may be issued a grade of I by the instructor. The student should make prior arrangements and receive, from the instructor, a written understanding of the work needed to complete the requirements of the course. To remove an I grade, a student must complete all requirements by the mid-term of the following semester (not including a summer term). If the completed course requirements are not received by the instructor by the deadline, the I grade will be converted to an F grade. When the instructor cannot be contacted for purposes of completion, the student should contact the department chairperson. Students with an I grade will not be allowed to re-register for that course. However, if the I is changed to either a D or F, the student may then re-register for that course.

Harold Washington College "No Show" Policy

Students who do not attend two of the first three class sessions (or one of the first two sessions if the class meets once a week) may be reported as a "No Show" by the instructor. Students reported as "No Shows" are administratively withdrawn from the class with no refund. Students who have been continuously absent three weeks prior to

the mid-point of the class will also be administratively withdrawn. Students who officially withdraw (WTH), are administratively (ADW), and/or no showed on (NS1) from all their classes prior to completing 60% of the period of enrollment charged, will be required to return a portion of the Title IV funds they have received. Electronic Devices Policy: No personal electronic devices are allowed to use in class. Children are not allowed in the classroom HELPDESK If you have homework related questions you may turn to tutors in Room 409 or lab aids in Room 404 for help. However they are not supposed to do your homework. INSTITUTIONAL POLICIES Read the City Colleges of Chicago STUDENT MISCONDUCT PENALTIES and Student Policy Manual: http://www.haroldwashingtoncollege.edu/misconduct.asp?section=sec&navpage=smisc ondp STUDENTS WITH SPECIAL NEEDS/DISABILITIES Contact the Services for Students with Disabilities Office: http://www.haroldwashingtoncollege.edu/specialneeds.asp?section=stusvc&navpage=s ncenter

METHODS OF EVALUATION Assignments & Projects Attendance, Lab, & Participation Exam 1/Mid Term Exam Exam 2 Final Exam GRADING POLICY In order to receive a grade of B or better a students homework must meet all of the requirements set forth in the assignment. From To Grade 90 100 A 80 89 B 70 79 C 60 69 D 0 59 F Active Pursuit The Midterm Grade for students who are not actively pursuing the course will be adjusted. Active Pursuit includes completion of homework and exams and participation in class activities; such activities would indicate that a student was interested and invested in completing the course. 30% 10% 20% 20% 20%

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

Tentative Schedule

Week 01 Administrative tasks, File Management, and Basic history of the Language Administrative tasks, Introduction Basic program construct, variable declaration and data type Overview of the Integrated Development Environment (IDE) A look at sequential program (program app or driver program) Week 02 Beginning Problem-solving Process Analyze problems and develop computer algorithms to solve the problem Week 03 Variables and Constants Selecting names for memory locations and data type Primitive data type Basic discussion of the strings class as a composite/compounded data type An early look at the string class getline() function Brief discussion of variable visibility/scope Basic discussion of decision structures (conditional statements and looping constructs) Week 04 - Program structure Developing programs that follow industry practice & Software Engineering principles of modularity and abstraction Design and write code that uses the basic principles of Modular design using functions The use of common abstract methods/functions to describe the solution to a given problems Discussion of function prototypes Discuss the contents of exam 01 Week 05 - Software Engineering principles of modularity continues Discussion of value-returning functions More discussion on the scope and lifetime of a variable Basic discussion of passing parameters Calling a function Exam 01 Week 06 - Software Engineering principles of modularity continues Discussion of void functions More discussion on passing parameters/variables A look at passing a variable by-value A look at passing a variable by-reference Week 07 Selection Structure Making decision in your program Nested Selection Structure Logic Errors in Selection Structures Multiple-Alternative Selection Structures The Switch Statement Week 08 - Repeating Structure Using a Pretest Loop

 A look at the while Statement Using counters to control Pretest Loops Using Posttest loops A look at the do while loop Discuss the contents of exam 02 Week 09 One-dimensional Arrays One-dimensional arrays Declaring and initializing a one-dimensional array Populating a one-dimensional array Displaying the contents of a one-dimensional array Passing an array to a function Exam 02 Week 10 One-dimensional Array continues Sorting data stored in a one-dimensional array A look at the bubble-sort Parallel one-dimensional array Week 11 Two-dimensional arrays Declaring and initializing a two-dimensional array Populating a two-dimensional array Displaying the contents of a two-dimensional array Week 12 Strings Discussion of the string class A look at some of the supporting functions of the string class and how they are used Week 13 Sequential Access File File type Creating File Objects Opening a Sequential Access File Determining whether a file was successfully opened Reading and Writing to a Sequential Access File Testing for end of a Sequential Access File (EOF) Closing a Sequential Access File Discuss the contents of exam 03/Final Week 14 Classes and Objects Object-Oriented Terminology Defining a class A look at constructors Discussions of Data members and method A closer look at class methods and method overloading/overriding Instantiating an object and referencing it methods Exam 03/Final