ST. GREGORY'S UNIVERSITY
COURSE SYLLABUS
Programming II
Fall 2000
|
COURSE |
CS 2203 Programming II - C++ |
|
TIME/LOCATION |
10:00-10:50 MWF Room 308 |
|
PREREQUISITE |
Completion of any programming language course with a "C" or better and CIS 1103 |
|
INSTRUCTOR |
Connie Farthing |
|
OFFICE |
Room 442- B 878-5150 |
|
HOME TELEPHONE |
728-6709 |
|
OFFICE HOURS |
MWF 12:00-1:00 |
|
|
csfarthing @sgc.edu |
COURSE DESCRIPTION FROM OFFICIAL BULLETIN
Designed to provide students with an understanding of structured and object oriented programming. Major components include: problem solving methodology, introduction to programming basics using the C++ programming language, loops and decisions, structure functions, objects and classes, and arrays. Examples of various business applications will be studied. Prerequisite: CS 2103.
PURPOSE OF THE COURSE
OBJECTIVES
These objectives can only be achieved through joint effort. We will work to stimulate your interest and learning in these areas, but you will be expected to display initiative and a program of self-study as well. In that sense, a complementary objective of the course is to provide you with an environment that will encourage and reward your own intellectual effort, while simultaneously maintaining rigorous standards that identify those who are motivated to pursue excellence in their own educational preparation for a business career.
REQUIRED TEXT AND SUPPLEMENTAL MATERIALS TO BE PURCHASED BY STUDENT
An Introduction to
BIBLIOGRAPHY:
BOOKS:
|
Lombardi, J. |
Computer Literacy: The Basic Concepts |
1983 |
|
Lucky, R. |
Silican Dreams: Information, Man and Machine |
1991 |
|
Lundell A. |
The Secret World of Computer Invaders That Bred & Destroy |
1989 |
|
Mabie, M. |
Going Public: MIP’s Computer & The Enhepreneurial Dream |
1991 |
|
McGregor, P. |
Web Browsing with Netcom Netcriser |
1995 |
|
McKenna, R. |
Who’s Afraid of Big Blue? |
1989 |
|
Miller, M. A. |
Internetworking: A Guide to Network Communication |
|
|
Wodaski, R & Brown, D. |
Virtual Reality and More |
1994 |
ATTENDANCE POLICY
Attendance is recorded and reported. However, attendance does not add points to the grade. Students should be aware that research shows a strong correlation between attendance and course grade. Absence will not be considered an excuse for submitting assignments late.
Lack of attendance will not automatically drop or withdraw a student from class. Students have the responsibility of processing a "Drop" from any class. Note: Most F's result from students ceasing to attend the class without processing a "Drop" slip.
METHODS OF ASSESSMENT AND STUDENT EVALUATION
|
Homework Projects |
800 |
|
Mid-term Project |
100 |
|
Final Project |
200 |
|
Attendance |
50 |
|
Total points |
1150 |
EXAMINATIONS AND PRESENTATIONS
If any exam question is left unattempted, the value of that question will be subtracted from the exam score.
Being prepared and present for the exams and presentations is your responsibility. The exam and presentation will be given on schedule. Mark your calendars now.
A make-up exam will not be given. If the exam is missed, your total points possible will be adjusted accordingly.
HOMEWORK
Each homework assignment must be e-mailed. It is your responsibility to see that the e-mail was received. Late homework will not be accepted.
COURSE OUTLINE
The schedule is flexible. Much material is required. It is not possible for an instructor to cover all the course material without student independent study. As students are interested in a particular topic or as test scores warrant review, more time will be spent on a chapter, or as may be required.
|
Week |
Tutorial |
Topic |
|
1 |
|
Introduction and Syllabus |
|
2 |
|
An Overview of a Microcomputer System and Programmin |
|
|
|
Lesson B: An Introduction to Control Structures |
|
3 |
|
An Introduction to Problem Solving and C++ |
|
|
|
Lesson B: An Introduction to the C++ Language |
|
4 |
|
Variables, Constants, and Equations |
|
|
|
Lesson B: Using the String Data Type and C)) Equations |
|
|
|
Lab |
|
5 |
|
Built-in Functions and Programmer-Defined Functions |
|
|
|
Lesson B: Value-returning Functions |
|
|
|
Lab |
|
6 |
|
The Selection Structure |
|
|
|
Lesson B: Coding the Math Program |
|
|
|
Lab |
|
7 |
|
The Repetition Structure (Looping) |
|
|
|
Lesson B: The For Statement and the do-while Loop |
|
|
|
Lab |
|
8 |
|
Sequential Access Files and Structs |
|
|
|
Lesson B: Structs |
|
|
|
Lab |
|
9 |
|
Arrays |
|
|
|
Lesson B: More on One-dimensional Arrays |
|
|
|
Lab |
|
10 |
|
Two-Dimensional Arrays |
|
|
|
Lesson B: More on Two-dimensional Arrays |
|
|
|
Lab |
|
11 |
|
Sorting, Searching, and Control Breaks |
|
|
|
Lesson B: Control Break Algorithms |
|
12 |
|
Classes |
|
|
|
Lesson B: Using Value-returning Functions in a Class |
|
|
|
Lab |
|
13 |
|
Pointers |
|
|
|
Lab |
|
14-16 |
|
Group Special Projects |
GENERAL CLASS POLICIES
Attendance
Academic Freedom
Exams
Written Assignments, Problems, Projects, etc.
Grades
Final Note