The harder you work,
           the
luckier you seem to be.  

Text Box: Computer Science, 4 of 11

Section

 

www.MichaelDWelch.net                                                                                   MichaelDWelch@(no-spam)acm.org

www.linkedIn.com/in/MichaelDWelch                                                                 303-920-9749      remove (no-spam)

This project implements the “Composite”, “Abstract Factory” and “Iterator” design patters using the Java programming language.

This project demonstrates the creation, maintenance, and use of a B-Tree.  B-Trees are data structures with high base logarithmic seek times typically used for indexing disk data.