CSCI 203 Data Structures CRN 818
Spring Semester, 2011

Instructor - Higgins
Phone: 3552
Class meets MWF11-11:50am in Fitz 300

Required text:

Prerequisite: Grade of C or better in CS 201 (A course in object-oriented programming using Java or C++).

Catalog Description: Covers the representation of complex information in computer memory.  Considers such structures as graphs, trees, stacks, strings, lists, and queues, with implementation of algorithms using a current programming language.

About our course/objectives We will learn more formally about ADTs, abstraction and data hiding, object design, and study various data structures as well as algorithms for hashing, and sorting. We will look at space and time complexity of algorithms. We will improve our programming skills by working in object oriented design and implementation using java jdk1.4.X. Will will learn also learn something about the java collections framework as a basis for
implementing data structures, but we will not be tied to this way of doing things.

Student projects:
We will use Java to implement 4 or 5 moderate size projects.

Exam dates: TBA
Exams: There will be two in-class exams as well as a final. There is no "make-up" provision for missed midterm exams. Your final exam grade will be used instead if these tests are missed.
Your grade: 40% projects + 50% exams + 10%class
Other remarks:
Program assignments, like papers in an English or History class, are to be completed by individuals. They are NOT group effort. There are severe penalties for copying programs or exams. Consult your student handbook to familiarize yourself with college policy on academic dishonesty. Note that all college policies regarding classroom behaviour and attendance apply. In particular, excessive absenteeism will result in a WI or E grade. An incomplete (I) will be given only for catastrophic illness or calamity and then, only to passing students.