CS451 Software Engineering
Assignment 3
Using the 3 data structures you developed for the first homework, namely:
1. Sorted linked list
2. Binary search tree
3. Binary heap
create two fault tolerant versions of the data structures. Both fault tolerant versions must support
following operations:
1. Insert
2. Find
3. Remove
4. Report (in sorted order)
One fault tolerant version of the data structures must be implemented using recovery blocks, and the
other one using N-version programming. You must create the acceptance tests, consistency checks,
and backward/forward recovery mechanisms required by each fault tolerance technique.
Implementation
The data structures and fault tolerant code must be implemented using the Java programming
language. You must use the structures you developed for the first homework.
Submission Guidelines:
1. Assignments must be submitted via the submit command located on the
queen.cs.drexel.edu Unix machine. Type “submit” at the command prompt, and
follow the menu options.
2. Submit all source code.
3. Submit all documentation (HTML of PDF formats preferred)
4. Your program will be run by the TA.
5. Submit a Makefile (optional but appreciated).
6. If you cannot present a soft copy of the formal specification the clearly handwritten hard
copy can be submitted in class on the due day.
