Fall 2005
Joseph Fuller Herbert Tesser x2696
Room: GH 205 Science 326
Email: fullerj@marshall.edu tesser@marshall.edu
Office hrs. TBA Mondays 3:15 – 5:00
Tuesday 4:00 – 5:30
Wed. 3:15 – 4:00
Other times by appointment
CS 210, Data Structures, introduces the study of abstract data types (ADTs) and algorithms. The course builds on previous courses in programming. In this course we will:
The course introduces students to the design and implementation of data structures, including stacks, arrays, queues, linked lists, heaps, trees and some work on graphs. We will also discuss analysis of algorithms for a number of problems.
Students will be able to apply techniques learned in this course to solving programming problems. Such problems include recursion, sorting and searching, and time analysis
Students will also be able to combine algorithms and data structures to design and support efficient software systems.
Students who successfully complete the course will:
· understand and have experience implementing several common data types
Text: Data Structures - Objects, Abstraction, and Design Using Java, by Koffman, E.B. and Wolfgang, P. A., Wiley, ISBN 0-471-69264-6
Supporting Texts (not required but recommended)
and the old standby – it might be out of print:
ISBN: 0-914894020-X
· This course is designed to be a three-credit course with three lecture hours per week and includes laboratory experience.
· The course will meet on MW from 2:00 p.m.-3:15 p.m.
· Several short quizzes and a midterm will be given during class. Graded material will be returned during class hours.
Do!
This is a course dense with information content. It is necessary to come to class. If you can learn it on your own, go ahead and save the money for tuition. I’m not a stickler about taking attendance, but students should recognize that their performance and attitude in school will reflect their attitude and performance in the work place. This will be especially important when you seek letters of recommendation for employment and graduate school.
Homework and Assignments
Homework and assignments may be submitted in JAVA (must be pure JAVA). Be certain that programs and media submitted are virus free. You should submit source code with any special compiler options noted. In general, try to use ANSI standards when applicable.
All work must be handed in before the end of class on the day it is due. At our discretion, late assignments will be penalized 10% of the maximum for each day late.
In extraordinary circumstances, we may accept late work without penalty. We will want documentation for the reason for lateness. The decision whether to assess a penalty rests with the instructors
The graded elements of the course are:
Homework and Assignments 25%
Term exam(s) 40%
Final exam 35%
The final grade may involve a “curve”. We expect a grade above 90% will earn an “A”, between 80 and 90, a “B”, between 70 and 80, a “C”. Below 70% will earn an “F”.
There won’t be any makeup for exams. If you miss an exam you must have a verifiable, well-documented excuse. If we accept the excuse one of two things will happen:
· you will get an incomplete and be given an extra project which will have to be completed within a month of the end of class, or
· Your grade will be computed without the exam and scaled based on all your other work.
The instructor will choose which option applies.
If the excuse is not accepted, you will get a zero grade for the missed exam.
You know what you shouldn’t do. Don’t do it! If you are in doubt, check with us beforehand. Also, read the university guide on collaboration.
Sharing ideas is one of the benefits of the educational setting. You are encouraged to work with one or two classmates on homework and assignments. However, each participant must sign the document submitted. It is expected that all participants have contributed (approximately) equally to the collaboration.
All work on exams must be the product of individual effort.