ST. Gregory’s University
COURSE SYLLABUS Fall 2001
|
COURSE |
CIS 3103 C++ Programming |
|
TIME/LOCATION |
01:00-01:50 MWF Room 402 |
|
PREREQUISITE |
Completion of any programming language course with a "C" or better and CIS 1103 and/or permission of instructor. |
|
INSTRUCTOR |
Bob Yarbrough Email: bwyarbrough@sgc.edu |
|
OFFICE |
Room 402B |
|
HOURS |
Posted on Door and on Web Site (click on name above) |
COURSE DESCRIPTION FROM OFFICIAL BULLETIN
PURPOSE OF THE COURSE
This course is designed to give the student basic knowledge of programming in the C++ language.
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?
C++ How to Program, Third Edition, Deitel & Deitel, Prentice
Hall, 2001 ISBN: 0-13-089571-7
At least two 3.5"
floppy disks for submitting programs and projects.
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 |
1991 |
|
Naugle, M. G. |
The Illustrated Network Book A Guide to Understanding Networks |
1994 |
|
Regun, P. M. |
Legislating privacy: Technology, Social Values, and Public Policy |
1995 |
|
Sterling, B. |
The Hacker Crackdown Law & Disorder on the Electronic Frontier |
1992 |
|
Thomas, S. L. |
Lotus Notes Certification: Application Development & System Administration |
1997 |
|
Time-Life |
Computer Images |
1986 |
|
Time-Life |
Computer Age |
1992 |
|
Time-Life |
Communications |
1986 |
|
Time-Life |
Memory and Storage |
1987 |
|
Vincent, P. |
Free Stuff From the Internet |
1995 |
|
Vincent, P. |
Free Stuff From The World Wide Web |
1995 |
|
Wodaski, R & Brown, D. |
Virtual Reality and More |
1994 |
POWERPOINT Files
Deitel
Chapter
1
Chapter
2
Chapter
3
Chapter
4
Chapter
5
Chapter
6
HANDOUTS
C++
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 |
|
400 |
|
Mid-term Project |
|
100 |
|
Final Project |
|
100 |
| Quizzes | 100 | |
|
Attendance |
|
100 |
|
Total points |
|
800 |
HOMEWORK
Homework must be neat, well documented (programs) and on time.
Late homework will be graded down or not
accepted if more than a week
late.
Programs submitted as homework or projects must be submitted in electronic
form, floppy disk or e-mail attachment
as requested by the instructor,
and also as separate printouts showing the program on paper. This is not
to be
electronic -- hard copy only -- and must be turned in with the
program. The disk should contain both the original
(*.cpp) file
and the executable (*.exe) file.
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 |
Text |
Topic(s) |
|
1 |
1.1 - 1.19 |
Introduction and Syllabus |
|
2 |
1.20 - 1.24 |
Memory, Variables and
Arithmetic Lab 2 Decision Making |
|
3 |
2.1 - 2.10 | Control
Structures: IF WHILE Lab 3 |
|
4 |
2.11 - 2.16 | Assignment
Operators FOR & SWITCH |
|
5 |
2.17 - 2.18 | DO WHILE; break
& continue Logical Operators |
|
6 |
|
Chapter 2 Programs & Mid-Term Projects |
|
7 |
3.1 - 3.6 |
Built-in Functions and User-Defined Functions |
|
8 |
3.7 -3.9 | Random Numbers and Header Files |
|
9 |
3.11 - 3.14 | Scope and Recursion |
|
10 |
3.17 3.18 3.20 |
Misc. Topics: References Default Arguments Overloading |
|
11 |
4.1 -
4.5 4.9 |
Arrays 2-dimensional arrays |
|
12 |
4.6 - 4.8 | Sorting |
|
13 |
5.1 -
5.9 5.12 |
Pointers Strings |
|
14 |
|
Final Projects |
GENERAL CLASS POLICIES
Attendance
Academic Freedom
Exams
Written Assignments, Problems, Projects, etc.
Grades
Final Note