CSC126
SPRING
2007
Instructor: Professor: Herbert Schanker
Office: 4N 206
Phone: (718)982-2975
Office hours: Tues
and Thursday 2:30-3:30 and by appointment. Occasionally I will be at college
meetings during this time.
Email: schanker@mail.csi.cuny.edu
CSC126,
Introduction to Computer Science, meets for 6 hours per week, two hours
of which are spent in the computer laboratory.
Attendance
is expected for all class hours, including lab hours, and will be counted as
part of your final grade for the course.
Outside of class hours, you may complete your lab work on any computer
that has the proper software.
TEXT: C++
Programming: From Problem Analysis To Program Design, Third Edition
D. S. Malik, Course Technologies, ISBN 1-4188-3639-7
If you have the second edition, you may
use it for this semester.
COURSE
INFORMATION: Information about the course, including all
handouts,
assignments, and announcements can be
obtained by
following the CS126 link from: http://www.cs.csi.cuny.edu/~schanker
If you miss any class, you are expected
to look at the web site, complete all assignments and readings on time, and
be prepared for all scheduled exams and
quizzes.
GRADING: The Grade in this course will be based on
quizzes, a final exam, two in-
class exams, programming assignments,
homework
and attendance. In
addition, you must receive a passing
grade on the final in order to pass the course.
Programming assignments, homework,
attendance, quizzes: 20%
2 Examinations: 50%
Final Examination: 30%
Syllabus (subject to
slight modifications)
Week 1 Chapter
1 An Overview of Computers and
Programming Languages,
Chapter 2 Basic Elements of C++
Week 2 Chapter
2
Week 3 Chapter
3 Input/Output
Week 4 Chapter
4 Selection Structures
Week 5 Chapter
4 Selection Structures
Week 6 Chapter
5 Repetition Structures
Week 7/8 Chapter
5 Repetition Structures
Week 7/8 Exam I
Week 9 Chapter
6 Functions
Week 10 Chapters
7 Functions
Week 11 Strings
& Arrays Chapter 8 pgs 446 – 464, Chapter 9
Week 12 Strings
and Arrays, Array Applications - Searching
Sorting (Linear and Binary search, Bubble, Selection
and Insertion Sort), Chapter 10
Week 13/14 Exam II
Week 14 Finish Searching and Sorting, Pointers,
Chapter 14 pgs 792 – 800
Week 15 Final
Exam Review, Optional Topics