CIS 365 Syllabus

Department of Computer and Information Sciences
Niagara University

COURSE TITLE: CIS 365 -- Computer Science II

Syllabus prepared by Dr. Laurence Boxer, January '06

Index

CATALOG DESCRIPTION

Prerequisite: CIS 265
This course continues CIS 265. Advanced techniques of object-oriented programming are introduced. Data structures and algorithms associated with arrays, several forms of linked lists, and trees are studied. Other topics include sorting and searching, and analysis of algorithms. Credit: one course unit -- three semester hours

To page index

INSTRUCTOR

Dr. Laurence Boxer
Office: House 2
OFFICE HOURS
Phone: (716) 286-8447
E-mail: boxer@niagara.edu
WWW: http://faculty.niagara.edu/boxer

To page index

COURSE OBJECTIVES

To page index

METHOD OF TEACHING: Lecture and discussion

Course Outline

To page index

TEXTS

N. Dale, C. Weems, and M. Headington, Programming and Problem Solving with C++, 4th ed., Jones and Bartlett, Sudbury, MA, 2005

R. Miller and L. Boxer, Algorithms Sequential and Parallel: a Unified Approach, 2nd ed., Charles River Media, Inc., Hingham, MA, 2005

To page index

Assignments and Evaluation of Grades

Final grades are based on examinations, homework problems, programming projects, attendance and contributions to discussion

A student's grade is determined by the student's percentage of possible points.

For example, if there are, say, 300 possible points on programming projects, and 2 exams each with 100 possible points, and if there are 150 possible points of quizzes and non-programming homework, and if there are 30 possible points for attendance and participation, there would be a total of 680 possible points; a student with 500 points would have a semester average of 500 / 680 = 74%.

Approximate grading standards:

88% - 100%: A- to A+
72% - 88%: B- to B+
55% - 72%: D+ to C+
45% - 55%: D
0% - 45%: F 		The instructor reserves the right to adjust these as required by the interests of justice.

See my Web page Remarks on Grading of Programs for information on how programming assignments are graded.

To page index

Grading Policies

Programs will be due at the START of class on the assigned date. Therefore, DO NOT skip class in the hope that during class you can finish your program on time. Late programs will be accepted, but the grade will be penalized -- the later, the greater the penalty (5 points for every "week" or fraction thereof, where a "week" is not counted during University holidays).

Written homework exercises will generally not be accepted late (except for compelling reason).  This is a matter of fairness, as we often will discuss exercises in class on the date they are due.

Exams/quizzes may be open- or closed-book. You may be asked to find errors (syntactic or logical) in, or analyze the execution of, or write a piece of code; offer a short essay; work with syntax diagrams; etc.

Academic Dishonesty Policy and Guidelines

To page index

ATTENDANCE: see http://www.niagara.edu/cis/announcement/policy.htm#att
Since we continually build on previously studied material, the wise student attempts to maintain perfect attendance.

To page index

STUDENTS WITH LEARNING DISABILITIES

The university will make reasonable accommodations for students with documented disabilities.  Students should notify the Coordinator of Specialized Support Services (located in Seton Hall) and their instructors of any special needs.  Instructors should be notified within the first two weeks of classes.

To page index

COUNSELING SERVICES

Students having trouble coping with the stresses of University life or related problems are encouraged to use the Niagara University Counseling Services.

To page index

BIBLIOGRAPHY

The NU library has a large collection of books on C and C++ filed (mostly) under
QA 76.73 .C153 or QA 76.64 or nearby,
including

Ellis, Margaret A., and Stroustrup, Bjarne, The Annotated C++ Reference Manual
QA76.73.C153 E35 1990

Faison, Edmund W., Borland C++ Object-Oriented Programming
QA76.64 .F34x 1994

Pohl, Ira, Object Oriented Programming using C++
QA76.64 .P64 1993

Stroustrup, Bjarne, The C++ Programming Language
QA76.73.C153 S77 1987 [Classic -- the author is the principal designer of C++]

Books on algorithms and data structures may be found under
QA 76.5 and QA 76.6
including

A.V. Aho, J.E. Hopcroft, & J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974 (classic)
QA/76.6/.A36

A.V. Aho, J.E. Hopcroft, & J.D. Ullman, Data Structures and Algorithms, Addison-Wesley, Reading, MA, 1983 (classic) J. Bentley, Programming Pearls, Addison-Wesley, Reading, MA, 1986
QA/76.6/.B453/1985

J. Bentley, More Programming Pearls, Addison-Wesley, Reading, MA, 1988
QA/76.6/.B452/1988 G.H. Gonnet, Handbook of Algorithms and Data Structures, Addison- Wesley, Reading, MA, 1984
QA/76.6/.G636/1984

E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms, Computer Science Press, Potomac, MD, 1978
QA/76.6/.H67

E. Horowitz and S. Sahni, Fundamentals of Data Structures in Pascal, Computer Science Press, New York, 1990
QA76.9.D35 H67 1990

D.E. Knuth, The Art of Computer Programming, vol. 1, Addison-Wesley, Reading, MA, 1968
QA/76.5/.K57/v.1 (classic)

D.E. Knuth, The Art of Computer Programming, vol. 3, Addison-Wesley, Reading, MA, 1973
QA/76.5/.K57/v.3 (classic)

L. Kronsjo, Algorithms: Their Complexity and Efficiency, John Wiley & Sons, New York, 1987
QA/76.6/.K76/1987

T.A. Reed, An Introduction to Algorithm Design and Structured Programming, Prentice Hall International (UK) Ltd, Herfordshire, 1988
QA/76.6/.R42/1988

R. Sedgewick, Algorithms, Addison-Wesley, Reading, MA, 1983
QA/76.6/.S435/1984

To page index

Back to Boxer's Home Page