CS 1132 Comuter Science II
Data Structures and Software Engineering
Spring 2003 Course Policies
Instructor: Robert Pastel
Office: 227 Fisher
Phone: 7-1639
Email: rpastel@mtu.edu
Class Schedule: Monday, Wednesday, Thursday, Friday at 10:05-10:551
in Fisher 133
Text: Data Structures and Algorithms in Java by Goodrich
and Tamassia, Willey, ISBN 0-471-38367-8
Goals: This course has two primary goals:
-
Proficiency in data structures including containers, trees, priority queues,
hash tables and graphs. Competence in implementing the structures
as well as knowledge in both cost and space requirements of the implementations.
-
Introductory knowledge of software engineering.
Perquisite: You (the student) must have expertise in Java, so CS1131
is a prerequisite. Basic java language syntax and practices will not be
taught.
Homework: Will consist of
-
approximately 4 programming assignments. These are non-trivial
programming assignments. Programs are expected to compile and run
correctly. Submitted programs that do not compile receive
no
credit. Running programs are graded on correctness of the output and programing
style. Programing style includes algorithms, formatting and comments.
-
A single project with several assignments. The project simulates
a client-programmer relationship and consequently includes documents and
programs. The project is significant and concurrent with the data
structure programs, so please start the assignments early.
You may not discuss the programs among yourselves. Any kind
of code sharing is grounds for misconduct. All the programs will
be compared and evaluated for similarities. I encourage discussing
the programs and homework in class. Start work early on the programs so
that the in-class discussions are meaningful to you. For some programing
assignments I may give you code to use, otherwise submission of program
or homework states the work is
all your own. You may use any
code in the assigned text. Programs are to be submitted before
the due date. NO EXTENSIONS WILL BE GIVEN, except for
excused absences (as
defined in the Student Handbook) that prevent the student from submitting
the program assignment early.
You are to implement the data structures yourselves so you should not
import java.util in any of the data structure assignment programs.
Exams: There will be a midterm and final covering data
structure topics that are not explored in the programming assignments,
for example appropriate choice of data structures, their cost etc.
Course Grade: The course grade consists of three parts
You
must past all parts to pass the course:
-
Programs are equal weight and are worth 40% of the total grade
-
Software engineering project is worth 25% of the total grade
-
The midterm exam is worth 15% and the final exam is worth 20% of
the total grade
Disabilities: Please let me know if you have a disability that requires
special arrangements.