Open Access. Powered by Scholars. Published by Universities.®
- Discipline
Articles 1 - 2 of 2
Full-Text Articles in Data Storage Systems
Designing An Articulation-Agreement Database For The College Of Science And Engineering And Technology Advising Center, Stephanie Fasen, Susan Hendley, Tim Pham, Danish Zaman
Designing An Articulation-Agreement Database For The College Of Science And Engineering And Technology Advising Center, Stephanie Fasen, Susan Hendley, Tim Pham, Danish Zaman
Journal of Undergraduate Research at Minnesota State University, Mankato
During their academic careers, some college students transfer to different universities. To allow students to transfer seamlessly to other colleges, advisors at Minnesota universities create articulation agreements that list the classes that transfer between two universities. To use these documents, students and advisors must search through binders to find the correct articulation agreement and then manually review it. This is a time-consuming process for both students and advisors. To make this information more accessible, we created a web-based database that instantly produces a list of equivalent classes for majors offered at Minnesota St ate University, Mankato (MSU) and other Minnesota …
Verification Of Costless Merge Pairing Heaps, Joshua Vander Hook
Verification Of Costless Merge Pairing Heaps, Joshua Vander Hook
Journal of Undergraduate Research at Minnesota State University, Mankato
Most algorithms’ performance is limited by the data structures they use. Internal algorithms then decide the performance of the data structure. This cycle continues until fundamental results, verified by analysis and experiment, prevent further improvement. In this paper I examine one specific example of this. The focus of this work is primarily on a new variant of the pairing heap. I will review the new implementation, compare its theoretical performance, and discuss my original contribution: the first preliminary data on its experimental performance. It is instructive to provide some background information, followed by a formal definition of heaps in 1.1. …