Social Data Structures
Advisors: Bruce and
Paolo
Participants: Sarah Waterson and
Joe Atzberger
Start Date: Winter Quarter 1999
Project Status: Active
Index:
Abstract:
    Right now this project is just beginning to develop. Mostly based upon our findings from the
graphical sorting algorithm project, we've decided that
a complete overhall of the program structure was necessary - beginning with the core data structures
that the sorting algorithms were built upon. What we'd like to create is a set of data structures -
arrays, queues, trees, etc. - that broadcast their current state and certain state changes to the
any client who wants to know the information. In our application, we'd use these data structures (which
are for the moment going to be referred to as social data structures) in our sorting algorithm code.
By doing this, we hope to completely separate the code for the algorithm from the visualization code, as
the interesting information to visualize is all available in the state and changes of the data structure
and not in breaking down the algorithm code. While this may be confusing at the moment, these webpages
are serving more as a place for us to start recording ideas. Don't worry - we think we've got some good
ideas to start with, and once we've got some solid work to use as examples, it should be much clearer!
Calendar:
Winter 99:
Early in the quarter discussions with Bruce about how to move forward
with the graphical sorting algorithm project and we begin to formulate
ideas for a complete overhaul and software restructuring.
After over a month of not thinking about the project, we start to
refresh our minds and start some initial planning.
Spring 99:
to be continued...
Project Development:
    Ideas. Right now we just are working on thinning down our ideas into some recognizable goals.
Findings & Contributions:
    This could be a lot of work ahead.
Links & References:
Return to Europa
Sarah Waterson <waterson@cis.ohio-state.edu>
Last modified: Wed Mar 10 16:50:01 EST 1999