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++).
Course syllabus
Final
Exam Schedule
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. We will learn some design patterns. We will learn also learn a little about the
java collections framework as a basis for implementing data structures, but we
will not be tied to this way of doing things.
Note: for fall 09 these exam and project dates and links may be changed
· Project one link tba
· Project2 link tba
· Project 3: tba
· Project 4: 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. Sample exam links
First in-class exam: Feb 19, 2009 Sample first
Exam
Second in-class exam: April 2, 2007 Sample
second exam
final exam: as scheduled usual room
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. There will be no make-up exams. In this respect, in-class exams may be regarded as optional. If you miss an exam a zero is recorded. For all students, your final exam score will replace any lower test scores.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 may result in your being involuntarily withdrawn from the class(WI) up to the withdrawal date and being assigned an E if it occurs after that date. An incomplete (I) will be given only for catastrophic illness or calalmity and then, only to passing students. Save yourself the embarrassment of asking.
Link to binarysearchtree example
Link to sort routine applets and code
Links to some of the text ppt