CSC 133 - Intro to Structured Programming
Fall 2001, CSC 133 70 2, Tu 7:00-9:30, ADM 4
Instructor:
Norm Lippincott, Curtis 105, 610-606-4666 ext. 3697
nlippinc@cedarcrest.edu (home: nl@acm.org)Office Hours:
M 1:00-3:00, Tu 4:00-7:00, W 1:00-3:00, F 11:00-12:00
Course Description:
This course develops algorithmic design and problem solving using structural programming techniques and the C/C++ programming language. Programming emphasis will be on block structures and stepwise refinement of algorithms. Language syntax, data types, and control structures are presented. Data structures considered include one- and two-dimensional arrays. Search and sort algorithms are developed. Modular coding, parameter passage, correct use of local and global variables, and debugging techniques are stressed.
Textbook:
Dale, N., Weems, C., and Headington, M., Programming and Problem Solving with C++, 2ed., Jones and Bartlett, 2000. ISBN: 0-7637-1063-6.
Dale, N., A Laboratory Course in C++, 2 ed., Jones and Bartlett, 2000. ISBN: 0-7637-1146-2.
Note: The above two books are available as a bundle using ISBN 0-7637-1153-5, or as a bundle with the optional "lecture companion" using ISBN 0-7637-1350-3.
Objectives:
Grading:
Grades for the course will be based on the following grade components
Assignments (8) 50%
Tests (2) 25%
Final Exam 20%
Class Participation 5%
A final grade percentage will be computed according to the weights above and rounded to the nearest full percent. Final grades will be awarded based on that percentage as follows:
93-100 A 80-82 B- 67-69 D+
90-92 A- 77-79 C+ 60-66 D
87-89 B+ 73-76 C 0-59 F
83-86 B 70-72 C-
Grade Components:
Assignments
Assignments will consist of one or more problems for which you will need to devise a solution and implement that solution using the C++ programming language. Microsoft Visual C++ is available on-campus in Curtis 104, 201, and 208, and in Admin 4 and 10. Any other standard C++ compiler may be used as well.
Programs should be well documented using comments. Please include, at the beginning of your program, a comment block with your name, course number, assignment number, date, a brief description of the problem, and an overview of your approach to the problem. Also include comments throughout the program to clearly describe all steps in your algorithm. Each function should have a comment block describing the function, all parameters, and return value. Further, code should be indented to enhance readability.
Assignments are graded on a 10 scale. The average of the eight assignments is computed, multiplied by 5, then is added to the other grade components to determine the final grade.
Tests
Tests will be written and will consist of multiple choice, true/false, and fill-in-the-blank questions. Test dates are shown in the schedule on page 4 of this syllabus. The last hour of the class period will be allocated for the test.
Tests are graded on a 100 scale. The average of the two tests is computed, multiplied by 0.25, then is added to the other grade components to determine the final grade.
Final Exam
The format for the final exam will be the same as that of the tests, but longer. The final exam is comprehensive.
The final exam is graded on a 100 scale, multiplied by 0.2, then added to the other grade components to determine the final grade.
Class Participation
Students who are active and attentive members of the class may receive up to 5 points for class participation. Students who engage in side conversations during class time should expect no more than 3 points for class participation. For classes held in a computer lab, students who engage in web browsing, e-mail, instant messaging, or similar activity during class time should expect no more than 2 points.
The class participation score is a value from 0 to 5, and is added to the other grade components to determine the final grade.
Due Dates and Late Work:
Assignments are due at the beginning of class on the day they are due. By turning in assignments on time your work will be graded and returned in a timely manner (usually by the next class meeting), and with comments as appropriate.
Work turned in late will be subject to any or all of the following:
Honor Philosophy:
The Cedar Crest College Student Handbook, Honor Philosophy (pp. 10-12) part III, Community Standards for Academic Conduct, includes the following:
"As a student at Cedar Crest College, each student shall:
Unless specifically designated by the instructor, assignments for this course are individual assignments, not group projects. It is reasonable and appropriate for students to discuss an assignment outside of class, particularly for programming projects. However, the actual assignment work, whether programming or written, is to be one’s own. It is not appropriate to collaborate on programming assignments, nor is it appropriate to copy another student’s program (or other assignment), alter the program’s (or assignment’s) appearance (e.g. changing formatting, variable names, output text), and present it as your own individual work. Evidence of such behavior will be considered a violation of the Honor Philosophy and will result in a grade of zero for the assignment. A second offense will result in a grade of "F" for the course.
Attendance Policy:
Attendance will be taken for each class, however record of attendance does not directly affect the student’s grade. The student is responsible for all material covered in class. If a student has excessive absence and is not showing responsibility for the course material, an academic performance notice will be issued to the Advising Center. If a student will be absent on the day of a test, arrangements for a makeup must be made in advance of the test. Failure to do so will result in a grade of zero for the test.
Classroom Protocol:
Appropriate classroom behavior is implicit in the Cedar Crest Honor Code. Such behavior is defined and guided by complete protection for the rights of all students and faculty to a courteous, respectful classroom environment. That environment is free from distractions such as late arrivals, early departures, inappropriate conversations, and any other behaviors that might disrupt instruction and/or compromise students’ access to their Cedar Crest College education.
Students with Disabilities:
Students with documented disabilities who may need academic accommodations should discuss these needs with their professors during the first two weeks of class. Students with disabilities who wish to request accommodations should contact the Advising Center.
Computer Classrooms:
When classes are conducted in computer classrooms, the computers are to be used only for activities directly related to the class. Use of class computers for other activities, such as web browsing, e-mail, games, instant messaging, and so on, is not permitted. Be aware that such activity not only distracts you from the class, but distracts other students as well. Students who engage in such activity during class will receive a reduced class participation grade.
Network Account:
In order to access course resources you will need a network login account. The network login account will give you full access to resources available on the Cedar Crest College network as well as an Internet e-mail account. The network login application form, with instructions, is available at
http://www.cedarcrest.edu/helpdesk/forms. If you do not have a network login account, please obtain one before the second class meeting.Course Schedule:
The following is a tentative schedule for the course. It should be used as a guide for your reading prior to class. Also, dates on which assignments will be given and will be due are listed. This is provided so that you can plan your semester accordingly. This schedule is subject to change.
|
Tue |
Topic / Reading |
Assignment |
|
8/28 |
Course Intro / Overview Ch. 1 – Overview of Programming and Problem Solving |
|
|
9/4 |
Ch. 2 – C++ Syntax and Semantics, and the Program Development Process |
#1 Assigned |
|
9/11 |
Ch. 3 – Numeric Types, Expressions, and Output |
#1 Due #2 Assigned |
|
9/18 |
Ch. 4 – Program Input and the Software Design Process |
#2 Due |
|
9/25 |
Ch. 5 – Conditions, Logical Expressions, and Selection Control Structures |
#3 Assigned |
|
10/2 |
||
|
Test 1 |
||
|
10/16 |
Ch. 6 – Looping |
#3 Due #4 Assigned |
|
10/23 |
#4 Due #5 Assigned |
|
|
10/30 |
Ch. 7 – Functions |
|
|
11/6 |
Ch. 8 – Scope, Lifetime, and More on Functions |
#5 Due #6 Assigned |
|
11/13 |
Ch. 9 – Additional Control Structures |
|
|
Test 2 |
||
|
11/20 |
Ch. 10 – Simple Data Types: Built-In and User-Defined |
#6 Due #7 Assigned |
|
11/27 |
Ch. 12 – Arrays |
#7 Due #8 Assigned |
|
12/4 |
||
|
TBA |
Final Exam |
#8 Due |
Course Resources:
Resources for this course will be placed on the campus network in the following location:
T:\users\nlippinc\CSC133