Department of Computer Science
CISY 254-51X – Data Structures
Course Syllabus
Room: Monday 5:30 – 10:20, Room W309
Text: Michael Main, Data
Structures & Other Objects Using Java, Addison-Wesley.
Hunterdon
313
email:
<first initial - w><last
name> at raritanval dot edu
Office Hours: Tuesday 2:00 – 5:00
Wednesday 4:30 – 5:30
If none of these hours work for you, talk to
me in class and I will arrange a time to meet.
Web Site: http://www.b-k-ind.com/rvcc/Data%20Structures/data%20structures%20main%20page.htm
This is my web site with links to material for this class. There you will find lecture notes, homework
assignments, and other useful information.
Students should visit this web site frequently and also routinely check
their college email.
Course Routine:
Classes
will be structured as either lecture or lab time. Lab time does not necessarily mean time at
the computer; it will be time for individual or group exercises. Lab time is not optional.
Attendance
will be taken and students are expected to be on time. If a student misses more than one-fifth of
the classes, it will result in the student being dropped from the course or an
“F” grade. This is in accordance with
the school attendance policy. A
student will not be permitted to enter the class after the class has
begun. An exception to this is if the
class only meets once a week, in which case a student may join after the
break. If a student leaves class before
class is over, they will be considered absent.
If you miss
a class, see the instructions on the class web site for what to do about the
lecture and homework. The link is “What
to do if you miss a class” under Resources.
I may begin
the class with a quiz. If you are late
and miss the quiz, there is no make-up, you will receive a 0.
Assigned
homework is due at the beginning of class.
It must be typed and stapled.
Cell phones
must be turned off in class.
I will use
email to student college accounts to send important information, such as clarifications
of assignments.
Plagiarism:
The
students’ work must be their own, period.
Any use of outside resources must be cited in the work. Violations will be reported to the Dean of
Academic Affairs and may result in a grade of F for the course.
Grading Policy:
Assignments
must be submitted on time. Late projects will not be accepted,
unless prior arrangements have been
made.
Exams must
be taken on days assigned. No make-up
exams will be given unless arrangements were made before the original exam date.
All quizzes
are averaged and will count as one exam.
Each
graded, in-class exercise will count as one homework.
No extra
credit opportunities will be provided.
Participation
is my evaluation of the student’s class participation.
Note:
students who use PC’s for other than class work (e.g. to IM, send email, or
surf the web), do not turn off their cell phones, or are otherwise disruptive
will lose one point off their final grade for each occurrence. Students may also be asked to leave the
class, be marked absent, and reported to the Dean of Academic Affairs.
This
syllabus is intended to help you understand how the class will be run, the
material to be covered, and my expectations of you. This syllabus may change at any time at my discretion.
Item |
Percent
|
Homework & Labs |
40 |
Exams & Quiz Ave. |
25 |
Final Exam |
25 |
Class Participation |
10 |
GRADES
|
|
A |
90-100 |
B+ |
87-89.9 |
B |
80-86.9 |
C+ |
77-79.9 |
C |
70-76.9 |
D |
60-69.9 |
F |
0-59.9 |
Outline
We will be covering the text through the
topics of searching and sorting. The
pace will typically be one chapter per week.
There will be topics, such as lists and trees, where we spend more than
one week covering the material. Homework
may be written questions, programming problems or both. Some homework assignments will require more
than one week to complete. The mid-term
exam will include material through stacks and queues. The final homework project will use material
you have created throughout the course and integrate them together. Students should not wait until the last
minute to do that or other programming assignments.
|
Topics |
|
|
|
Run time
analysis |
|
|
|
Review of
objects |
|
|
|
Arrays and
applets |
|
|
|
Linked lists |
|
|
|
Doubly
linked lists |
|
|
|
Stacks and Queues |
|
|
|
Exam
|
|
|
|
Recursion |
|
|
|
Binary
trees |
|
|
|
More binary
trees |
|
|
|
Graphs |
|
|
|
Searching |
|
|
|
Sorting |
|
|
|
Project
evaluations |
|
|
|
|
|
|
Tutor Help
The