New York City Technical College
Computer Systems Technology Department
Course Description – Spring 1999

Course Aims/Description
Prerequisites
Required Materials
Attendance Policy
Points for tests and programming assignments
Course grading formula
Materials Fee
Course Outline

CS101 - Computer Programming and Problem Solving

(4 Hours, 3 Credits)

Course Aims/Description: This course introduces the student to concepts of programming in a visual environment. The student uses code and concepts of programming to solve various common problems.

Prerequisites: CUNY certification in mathematics, reading, and writing

Required Materials:

Text: Essentials of Visual Basic 5.0 Programming, David I. Schneider, Prentice-Hall, 1999 Attendance Policy: You are permitted to be absent from class a maximum of three class sessions. This is in accordance with college policy that sets the maximum number of permissible absences at 10% of the number of class meetings scheduled for the semester. Points for tests and programming assignments:
 
POINTS
FINAL
50 (31%) 
MIDTERM
30 (19%) 
QUIZZES (Best 3 of 4)
30 (19%) 
PROGRAMS
50 (31%) 
 
===== 
TOTAL
160

Programming assignments:

See instructor's handout for programming assignments Course grading formula:
 
Points
Grade
144-160
A
128-143
B
112-127
C
96-111
D
0-95
F

Materials Fee: Those enrolled in this course are required to pay a $5.00 fee to cover the cost of required materials that students use in the course. Materials become the property of the student. This fee is to be paid at the time of registration.

Course Outline:
 
Session
 Topics
Section
1.
 An Introduction to Computers
1.1
2.
 Using Windows
1.2
3.
 Disks and Folders
1.3
4.
 An Introduction to Visual Basic
1.4
5.
 Programming Tools
1.5
6.
 Visual Basic Objects
2.1
7.
 QUIZ NO. 1  
8.
 Visual Basic Events
2.2
9.
 Numbers
2.3
10.
 Strings
2.4
11.
 Input and Output
2.5
12.
 Appendix C—Stepping Through an Elementary Program
pgs. 283-288
13.
 QUIZ NO. 2  
14.
 Decision Structures
3.1
15.
 Appendix C—Stepping Through Programs Containing Decision Structures
pgs. 288-290
16.
 MIDTERM EXAMINATION  
17.
 Do Loops
3.2
18.
 Appendix C—Stepping Through a Program Containing a Do Loop
pgs. 290-291
19.
 For...Next Loops
3.3
20.
 A Case Study: Weekly Payroll
3.4
21.
 Creating and Accessing Arrays
4.1
22.
 QUIZ NO. 3  
23.
 Sorting and Searching
4.2
24.
 Arrays and Sequential Files
4.3
25.
 Graphics
5.1
26.
 Four Additional Controls
5.2
27.
 QUIZ NO. 4  
28.
 General Procedures
5.3
29.
 Appendix C—Stepping Through a Program Containing a General Procedure
pgs. 291-292
30.
 FINAL EXAMINATION  
Top
 

Prof. Popkin's home page
Computer Systems Technology Department home page
Use the Back button on your browser to return to this page.