Department of Computer Science
Course: Programming
Fundamentals (CS135)
Instructor: Robert H. Dependahl, Jr.
Required Text: TURBO PASCAL, Dale & Weems, 4th Ed.
Computer Center: Room H-245 is open:
8 A.M. to 9:50 P.M Monday-Friday
Office Hours: Room H-226,
Phone#: 965-0581 (ext. 2452) E-mail: rhd@cs.sbcc.edu
Monday Tuesday Wednesday Thursday Friday
7-8PM 10:30-11:10AM 4:40-5PM 10:30-11:10AM by appt
12:30-12:45PM
12:30-12:45PM
Homepage & Notes: Lecture notes, homework / exam scores and
interesting class related links are available on my homepage: www.cs.sbcc.edu/~rhd/
Grading: The final grade
for this class will be determined by the collective number of points
accumulated through the following assignments and exams.
Programming: Several programming assignments will be
given. You will prepare these programs
in Pascal and check them out on the computer.
Programming will account for approximately 40% of the course grade.
Midterms: Two will be given worth 100 points each. Failure to take a Midterm on the scheduled
day will result in the following exam grade penalties.
If late up to
1 day -------------------- 10% off
If 1-4 days
late ----------------------- 20% off
If later
--------------------------------- 50% off
Final: The final examination will be worth 240
points and will be a composite of the topics covered over the entire semester.
Quizzes: There will be a number of unannounced 25
point quizzes. Quizzes cannot be made up. At the end of the course I will strike your
worst quiz. (Best Idea: Perfect attendance then no missed quizzes).
All homework / programs must be submitted on paper. Emailing of coursework will not be accepted
for credit.
Copying/Cheating: --- According to college policy, those involved will be
sent to the Dean for disciplinary action.
Attendance: If you miss a
class during the first three weeks, I will assume (unless you inform me
otherwise) that you are not interested in this class and you will be
dropped. Poor / unexcused classroom or
computer lab attendance will lead to a lower final grade.
Miscellaneous Rules: 1. No food in the
classroom 2. No heads on the desktop.
3. No cell phones in classroom 4. No
leaving the classroom once an exam has started
5. No printing of unrelated materials on the Computer Science
Department’s printers.
Schedule of Topics and
Reading Assignments
Date Chapter Lecture Description
1/24 1 & 2 Introduction
to Computers and Problem Solving
1/31 3 & 4 Design Methodology
2/7
5 Selection - Simple &
Complex IF’s
2/14
Washington’s Birthday Holiday
2/21 6 Looping
Techniques
2/28 7 Procedures
3/7
Midterm #1 (Covering Chapters 1 thru 6)
3/14 8 Parameters, Scope
Rules & Nesting
3/21 9 Functions &
Recursion
3/28 *** Spring Break ***
4/4 10 & Control Structures, User
Data Types & Arrays
12 (pages
511-522)
4/11 12 (pages
527-542) Applied Arrays
4/18
Midterm #2 (Covering
Chapters 7-10 &
Chapter 12 [pages 511-522])
4/25 15 Multidimensional Array
5/2 11 Records, Sets & Strings
13 (pages
577-581)
5/9
16
& 17 Objects, Pointers &
Linked Lists
5/13 Last day to turn in programs (
Final Examination Schedule: Monday Class à
Wednesday Class à 2-4 pm Wednesday, May 18th
At the end
of this course a successful student will be able to:
a.
Construct
a top-down design for the solution of a computer program.
b.
Implement
programs utilizing fundamental programming constructs (i.e., sequential,
computational, logical and looping programming
constructs).
c.
Implement
programs using common data structures including arrays, records, files, and
binary trees.
d.
Implement
modules utilizing functions, procedures and recursive use.
e.
Validate
a program’s correctness and make necessary corrections.
f.
Document
and prepare materials supporting how a program works.