Welcome
Welcome to a more advanced study of data structures
and algorithms for information storage and retrieval applications.
The design and implementation of data structures and algorithms can be
considered both an art and a science. One of the primary goals of
this course is to develop the critical thinking skills needed to
design sophisticated and robust software for the creation and management
of on-line document collections. This course is conducted
according to departmental policy which is observed by all professors and
graduate teaching assistants who participate in it. Please note that under
no circumstances will cheating be tolerated.
Deadlines
There will be no make-up exams
throughout the semester. All homework assignments
are due on the specified dates (posted on this page and announced in class).
Late homework will not be accepted - no exceptions.
|
Attendance
Attendance at lectures is mandatory in order to
succeed in this class and hence attendance will be taken every lecture.
There is no specified laboratory period for this course so students
will be expected to use either the CS Department Cetus or Hydra
Labs (or perhaps other UTK facilities) when they are available. Be sure
to set your clocks each night - class starts at 8:10am.
Grading
Points are awarded throughout the term for
performance on selected homework problems (20%), the midterm (25%),
the course project (30%), and the final exam (25%). Percentages
denote portion of final grade attributed to each item.
Click on Garfield the cat for the posting of final grades. Have
a good summer!
Assigned Homework/Labwork
| Assign. No. |
Page/Desc |
Points |
Due Date |
| 1 |
K-16 |
25 |
1/21 |
| 2 |
Perl
Ex1
Ex2
|
100 |
2/16 |
| 3 |
K-48(11) |
20 |
2/4 |
| 4 |
K-49(13)
|
20 |
2/9 |
| 5 |
Perl
Ex3
|
100 |
2/25 |
| 6 |
CGI/Perl
Ex4
|
150 |
3/12 |
| 7 |
Term Weighting |
50 |
4/6 |
|