CS
170 Computer Science I: Language (C++)
Course
Syllabus, Fall Semester 2006
Course title: CS170
Computer Science I: Language (C++)
Credits: 4 required CS credits
Prerequisites: CS
140 or CS 143
Instructor: Dr.
Gancho Ganchev
Office: WS114 - Mo We 1:30 - 3:00, Tu Th 3:15 – 4:15
Phone: (203) 837-9349
Email: ganchevg@wcsu.edu, gfganchev@yahoo.com
Description:
This course equips the student with good knowledge of
a selected modern widely used programming language (C++) and a selected
integrated development environment. The
software development process and sound programming practices are emphasized. The course prepares students to respond
positively to further programming languages and development environments. This
is
NOT AN INTRODUCTORY programming course.
Previous programming experience at the level of CS 140 or CS 143 is required. In particular, it
is required that students are proficient in the following:
1.
Efficient
use of various data types;
2.
Designing
selection statements, including nested selections and composite conditions;
3.
Designing
loops, including loops with one level of nesting;
4.
Efficient
use of one-dimensional arrays.
These topics are only scanned in this course with
emphasis on the specifics of the C++ programming language. The course includes
a significant amount of project work with relatively short deadlines.
.
Resources:
Recommended
textbooks:
[1] Absolute
C++ by Walter Savitch, Addison Wesley 2006
[2]
C++ How to Program by H. M. Deitel
and P. J. Deitel, Prentice Hall 2003.
Class
notes and additional course materials will be
posted on the N: drive in the folder N:/Class/GanchevG/CS170
Attendance: You are expected
to be present for each class session.
Withdrawals: No withdrawals after the official WCSU deadline.
Assessment: Two
tests, three programming assignments, each consisting of three to four
independent small programming projects, and a cumulative final exam (2 hours).
The emphasis will be on producing high quality programs with good internal and
external documentation and efficient utilization of language features.
NOTE: Homework
exercises are assigned at nearly every session. You are strongly encouraged to
perform the assigned work and submit it for feedback. There will be one
required homework submission in the first half of the semester.
Grading:
Test 0. . . . . . . 00%
Assignment 1. . . . 15%
Test 1 . . . . . . 05%
Assignment 2 . . . 15%
Test 2 . . . . . . 05%
Assignment 3 . . . 20%
Final exam . . . . 40%
Tentative Schedule of
Topics:
|
Session |
Date
|
Topics |
Reference
|
|
1-We |
Sep 06 |
Introduction to the Course |
|
|
2-Mo |
Sep 11 |
Test 1. Introduction to the Language |
[1] |
|
3-We |
Sep 13 |
Variables, Data Types, Expressions |
[1] |
|
4-Mo |
Sep 18 |
Variables, Data Types, Expressions |
[1] |
|
5-We |
Sep 20 |
Input and Output with Streams
|
[1] |
|
6-Mo |
Sep 25 |
Control Structures
|
[1] |
|
7-We |
Sep 27 |
Control Structures |
[1] |
|
8-Mo |
Oct 02 |
Control Structures |
[1] |
|
9-We |
Oct 04 |
Control Structures |
[1] |
|
10-Mo |
Oct 09 |
Submit
homework for feedback Functions |
[1] |
|
11-We |
Oct 11 |
Functions |
[1] |
|
12-Mo |
Oct 16 |
Test 1,
Functions |
[1] |
|
13-We |
Oct 18 |
Testing and Documentation |
Notes |
|
14-Mo |
Oct 23 |
Arrays |
[1]Ch 5, 10, [2] |
|
15-We |
Oct 25 |
Arrays |
[1]Ch 5, 10, [2] |
|
16-Mo |
Oct 30 |
Strings |
[1] |
|
17-We |
Nov 01 |
Assignment 1
due Strings |
[1]Ch .9, [2] |
|
18-Mo |
Nov 06 |
Structures |
[1] |
|
19-We |
Nov 08 |
Classes |
[1] |
|
20-Mo |
Nov 13 |
Object Oriented Programming |
[1] |
|
21-We |
Nov 15 |
Dynamic Memory Allocation |
{1} |
|
22-Mo |
Nov 20 |
Dynamic Memory Allocation |
{1} |
|
23-Mo |
Nov 27 |
Assignment 2
due Dynamic Memory Allocation |
{1} |
|
24-We |
Nov 29 |
Object Oriented Programming |
[1]Ch.14 , [2] |
|
25-Mo |
Dec 04 |
Object Oriented Programming |
[1]Ch.14, [2] |
|
26-We |
Dec 06 |
Files |
[1] Ch.12, [2]Ch.12, 14 |
|
27-Mo |
Dec 11 |
Object Oriented Programming |
[1]Ch.15, [2]Ch.10 |
|
28-We |
Dec 13 |
Assignment 3
due Additional Topics |
TBA |