Randy Appleton's Data Structures Syllabus
Randy Appleton
NSF 1131
227-1593
rappleto@nmu.edu
What
This class covers data structures and their associated
algorithms. Basically, when one wants to store data there are
many way to do so. Some of there ways are more effecient on
various operations, and take more or less time to program.
Therefore it is important to know what operations you wish to perform
on the data, and how much programmer time you can devote. With
this knowledge, you can chose the right way to store the data, and th
right way to perform the operations on the data. A topic list can
be found at here.
Grades
Grades are assigned from programs/labs (40%), a midterm or two (20%),
and
a final(20%), and quizes (20%). There will be a quiz every Friday, so
plan
on that. Hopefully the quizes will let you know how you are doing
while there is still time to change it, and let me know what subject
areas
I need to review. About 1/3 of you will get an 'A', one third a
'B',
and the rest 'C's. I reserve the right to fudge the percentages
above.
No one will pass the class if that person has failed to turn in more
than
one program. No one will get better than a C- if they
failed
to turn in any program.
Late Policy
I hate late assignments!!! However, it is much better to turn something
in late rather than not at all. Each program will have a late penalty
assigned to it. If there was some unavoidable reason you could not turn
a project in on time (i.e. car crash, snow day, etc.) just ask me to
waive
the penalty. I'm pretty lenient.
The Class Web Page
You can find the main page for the class at
http://euclid.nmu.edu/~randy/Classes/CS222.
This site contains class notes and sample code.