CSci 433: Algorithm and Data Structure Analysis
Spring Semester 1999
Assignments

Preparing Assignments

All homework and programming exercises must be prepared in accordance with the instructions given in the Professional Conduct and Assignments sections of the Syllabus . Each assignment must be submitted to your instructor by its stated deadline.

Homework Assignments

1. Assignment #1 -- Due Thursday, 28 January
2. Assignment #2 -- Due Tuesday, 9 February
3. Assignment #3 -- Due Tuesday, 23 February
4. Assignment #4 -- Due Thursday, 25 March
5. Assignment #5 -- Due Thursday, 8 April
6. Assignment #6 -- Due Thursday, 22 April
7. Assignment #7 -- Due Friday, 30 April, Noon

Programming Exercise Options

Remember that students taking this course for credit toward a B.S. or B.A. degree are required to complete two programming exercises during the semester. Students taking this course as a condition for full admission into the M.S. or Ph.D. program in computer science are required to complete three programs. Note that a program must be submitted by the deadline for that particular exercise.

1. Program #1 -- Word Unscrambling -- Due Thursday, 4 February
2. Program #2 -- Sequence ADT Using Circular Arrays -- Due Thursday, 18 February
3. Program #3 -- Dictionary ADT -- Due Tuesday, 16 March
4. Program #4 -- Sorting Algorithm Benchmark -- Due Thursday, 25 March
5. Program #5 -- Set ADT -- Due Thursday, 1 April
6. Program #6 -- Undirected Graph ADT -- Due Tuesday, 13 April
   Program #6B -- Graph Traversal -- Due Tuesday, 13 April
7. Program #7 -- Animation of Dijkstra's Algorithm -- Due Tuesday, 20 April
8. Program #8 -- Minimum Spanning Tree Experiment -- Due Tuesday, 20 April
9. Program #9 -- Big Integer -- Due Tuesday, 27 April
10. Program #10 -- Second Chance -- Due Thursday, 29 April

UP to CSCI 433 root document?