Engr 692-06: Special Topics in Engineering Science
Assignment #3, Due Midnight, Friday, 12 October 2007
This assignment requires that you use the small Divide-and-Conquer
framework described in Section 3 of the paper "Using Classic Problems to
Teach Java Framework Design," Note that the paper describes the
DivConqStrategy classes and
Solution interfaces) and a sample quicksort application
built using the framework.
- Implement the framework from the paper in Java, C++, or some
other reasonable object-oriented programming language.
- Reimplement the quicksort algorithm using the Strategy technique
as described in the paper.
- Generalize the given quicksort application to work for an array
of more general objects. You cannot assume that these objects are
builtin objects with predefined comparison operators, but you can
assume that a total ordering can be defined on the set of all the
objects that you need to sort in one execution of the program.
So you will need to work out a technique for defining the comparison
in a manner that is flexible and supports resuse of the quicksort
code. That is, it should not be necessary to modify the quicksort
classes to change the type of objects.
- Implement a binary search algorithm using the framework.
- Implement some other divide and conquer algorithm using the
framework--for example, mergesort or matrix multiplication.
- Test all implementations thoroughly.
- Document the code appropriately.
When this assignment is complete, submit the following items. Be
sure that all items submitted are clearly labeled with your name and
the assignment number.
- To the Blackboard site, electronic copies of:
- the source code files for your applications of the framework,
- instructions on how to run your programs,
- a copy of the input file you used for testing.
- To your instructor, a paper listing of your program source code
and the outputs from your testing of the program.
UP to ENGR 692 assignments document?
Copyright © 2007, H. Conrad Cunningham
Last modified: Wed 26 Sep 2007