Calumet College of St.
Joseph
SYLLABUS FOR C
PROGRAMMING II
Term: Spring,
2001-2002 (012) (January 7 - April 20, 2002)
Course Number: CIS 317X
Instructor:
Mr. Darren Henderson
Office
Phone: (219) 473-4346
E-mail: dhenderson@ccsj.edu
Office
Hours: Monday
3:00 p.m.-
7:00 p.m.
Tuesday 3:00 p.m.- 7:00 p.m.
Friday
4:30 p.m.- 6:30 p.m.
Saturday
12:00 p.m.- 2:00 p.m.
Instructor
Background:
Darren Henderson earned a
B. S. in Engineering from Purdue University Calumet and a M. S. in Electrical
Engineering from Purdue University with a specialty in Communications and
Signal Processing. His undergraduate
curriculum was characterized by a strong emphasis in mathematics and physics
including courses in Advanced Calculus, Partial Differential Equations, Complex
Analysis, Advanced Analysis, Electromagnetic Field Theory, Optics, and Quantum
Mechanics. As his undergraduate senior
design team project, Darren worked on a prototype for a home security and
convenience system that provided a speech synthesis capability. His task was to write the assembly language
software for the Motorola HC11 microcontroller and to work with the Texas
Instruments speech synthesis chip.
Darren’s graduate coursework included courses in Digital Communications,
Digital Signal Processing, Image Processing, Computer Networks, and Estimation
Theory.
Darren joined the
Computer Information Systems Program at Calumet College of St. Joseph in
1995. He regularly teaches the courses
C Programming I and II, Hardware and Software Concepts, and Data Communications
and Networking Theory. In addition to
his teaching activities, Darren has worked for CCSJ's Computer Services
Department. He used his engineering
background and skills to help lay the groundwork for the school's existing
computer network and services. He was
responsible for initially creating the faculty and staff e-mail accounts and
for making the school's computers (faculty, staff, and 4th floor
computer labs) Internet accessible. His
duties involved Unix/Linux and Windows NT System Administration and TCP/IP
Network Administration in support of DNS, DHCP, WWW, and e-mail services. He was also responsible for implementing an
early firewall to protect the school's Univers database system from unauthorized
access. He currently is working on ways
of integrating the Blackboard 5 e-learning environment into his courses at
CCSJ.
Before
his tenure at CCSJ, Darren was an adjunct instructor in the Electronics
Technology Department at Ivy Tech State College in Valparaiso. He taught a multitude of courses including:
Circuits I and II, Solid State I and II, Digital Principals, Digital
Applications, and Electricity for HVAC.
His current research interests
are in C++ programming, software engineering for Internet applications, and
network security.
Course
Time: Mondays 7:00
p.m. - 10:00 p.m. Room 418
Course
Description (revised): This course reinforces and extends the structured
programming concepts introduced in CIS 312.
Students will continue their study of the C language by working with one-dimensional
and two-dimensional arrays. Students
will learn how to represent strings in C and how to process strings using ANSI
C functions. Students will refine their
understanding of the “pointer” data type introduced in CIS 312 and learn its
relationship to arrays and strings in C.
Students will be introduced to the “structure” data type since it serves
to implement database records. Students
will then use the ANSI C functions required to process both text and binary
files.
Learning
Outcomes/ Competencies:
Students in this
course will:
·
solidify the programming concepts introduced in C
programming I.
·
become familiar with C’s methods for handling
arrays and strings.
·
better understand the close relationships among
pointers, arrays, and strings.
·
demonstrate the use of some of the ANSI C string
functions.
·
be able to create and use structures.
·
be able to open, read, write, and close files.
Textbook:
The
Art of Programming: Computer Science with C, Lawlor, Steven
C., PWS Publishing Company, Boston, MA, 1996. (ISBN 0-314-06814-7)
Learning
Strategies:
Due to the technical
nature of the subject matter, the course material is presented mainly through
lecturing. Students are encouraged to
participate by asking questions.
Students demonstrate the course competencies in part by completing
periodic programming assignments and projects.
Assessment:
The student’s grade is computed using the weights
shown below:
Homework/Projects 50%
Midterm 25%
Final 25%
------
100%
Class
Policy for Assignments/Exams:
Homework problems will be assigned throughout the
duration of the term. Homework will be collected generally two weeks from the date assigned. Late homework is subject to an automatic deduction to be determined
by the instructor.
The official class policy is that there is NO MAKE-UP EXAMS, however in
recognition of the occasional personal and/or family emergency that may
occur during the semester, a make-up exam may
be granted provided all
the following conditions are met:
1)
The
instructor is notified of the make-up exam request by the student on or before the
scheduled exam date.
2)
A
suitable alternate time convenient to the instructor can be arranged.
3)
The
missed scheduled exam must be made-up within
one-week of the scheduled exam date.
The granting of make-up exams is NOT an entitlement
but is a courtesy granted to the student by the instructor. If this courtesy is abused by a particular
student or the class as a whole, then the privilege may be revoked.
A missed midterm or final exam will be
assigned a score of zero.
Exams are typically closed book and closed
notes. Although occasionally, a portion of an exam may be
administered open book and open notes.
The FINAL EXAM is comprehensive!
The function of
the homework problems and class/laboratory activities is that they serve as
exam preparation. The function of the
exams is to confirm that the student has achieved the required level of
proficiency.
Grading
Scale:
A: 93-100 A-: 90-92 B+: 87-89 B: 83-86 B-:
80-82 C+: 77-79
C: 73-76
C-: 70-72 D+: 67-69
D: 63-66 D-: 60-62
F: 59 & below
Class
Policy on Attendance:
Attendance will be taken for administrative
purposes. Although class attendance
does NOT account for a percentage of
the assigned semester grade, it is vital that students attend the class
lectures and laboratories on a regular basis in order to be informed of any
important class announcements, any deviations from the course outline below,
and of any supplemental material presented.
However, class/lab attendance and participation is
used as a factor in deciding borderline cases. (if applicable)
|
Class Dates: |
Topics/Assignments: |
|
|
WEEK
1 |
1/7/2002 |
Syllabus/Course Policies CIS 312 Review (Chapter 2 to 5) Programming Exercise #1 |
|
WEEK
2 |
1/14 |
CIS
312 Review (Chapter 6) Programming
Exercise #2 |
|
WEEK
3 |
1/21 |
Chapter
7 - Arrays |
|
WEEK
4 |
1/28 |
Chapter
7 - Arrays (cont.) Pointers
and Arrays - (Chapter 10 - page 420-427) |
|
WEEK
5 |
2/04 |
Chapter
8 - Strings |
|
WEEK
6 |
2/11 |
Chapter
8 - Strings (cont.) Pointers
and Strings - (Chapter 10 - page 427-434) |
|
WEEK
7 |
2/18 |
Chapter
9 - Files |
|
WEEK
8 |
2/25 |
Midterm
Exam Review |
|
WEEK
9 |
3/04 |
Midterm
Exam |
|
WEEK
10 |
3/11 |
Midterm
Exam Results Chapter
9 - Files (cont.) |
|
WEEK
11 |
3/18 |
Chapter
11 - Record-Based Data (i.e. Structures) |
|
WEEK
12 |
3/25 |
Chapter
9 - Files (cont.) Chapter
11 - Record-Based Data (cont.) |
|
WEEK
13 |
4/01 |
Selected
C Topics Final
Exam Review #1 |
|
WEEK
14 |
4/08 |
Final
Exam Review #2 |
|
WEEK
15 |
4/15 |
Final
Exam |
Class
Participation:
See "Class Policy on Attendance" above
Center
for Academic Excellence:
Tutoring
assistance is free to all students of Calumet College of St. Joseph. Call the
Center for Academic Excellence (CAE), to make an appointment at 473-4287. The
Center has experienced and well-trained tutors in most subject areas to help
students who are struggling in a course or who are doing well and would like to
do better. Regular weekly tutoring sessions are likely to improve your grade.
Statement
of Plagiarism:
If an instructor or other Calumet College of St.
Joseph personnel find that a student has plagiarized or been involved in
another form of academic dishonesty, the instructor or other personnel may
elect to bring the matter up for judicial review. The maximum penalty for any
form of academic dishonesty is dismissal from the College. The procedures for
judicial review are listed under the section of CCSJ handbook that addresses
student grievances. (Academic Planner 2001/2002 p.27)
Citation
Guidelines:
Calumet College
of St. Joseph adheres to citation guidelines as prescribed by the particular
discipline (i.e., MLA, APA, and Chicago Manual of Style or Turabian.). All of these guidelines are available in the
Calumet College of St. Joseph library or bookstore. These texts outline how to cite references from a variety of
sources, including electronic media.
Withdrawal
from Classes Policy:
After the last
day for class changes has passed (see College calendar), students may withdraw
from a course in which they are registered with permission from the faculty
member conducting the course. A written request detailing the reason(s) for the
withdrawal must be filed with the Registrar. Written request for withdrawal
must be received by the Registrar by the last day of classes prior to the final
examination dates specified in the catalogue. Written requests may be mailed to
the Registrar or faxed to the College fax number 219-473-4259. Students are to
make note of the refund schedule when withdrawing from courses. The request is
forwarded to the faculty member, who makes the final determination to accept or
deny the request. If the request is honored, the student will receive
notification of official withdrawal; if denied, the notification will indicate
why the withdrawal is disallowed. Note: Degree Completion Division (DCD)
students should consult the DCD Student Handbook for information on DCD
withdrawals.
An official
withdrawal is recorded as a "W" grade on the student's transcript.
Dropping a course without written permission automatically incurs an
"F" grade for the course (see Refund Schedule).