CS3114 Data Structures and Algorithms
Assignments
3:30 PM Section
All programming projects must contain this pledge.
Programming Assignments
- Project 1
- Project 1 Spec Document (Last updated: 09/02/2014)
- Project 1 sample input
- Project 1 sample output when run with hash table initial size 10 and (memory manager) block size 32
- String hash function
- Grader's reference test with output
- Project 2
- Project 2 Spec Document (Last updated: 09/23/2014)
- KVPair class (Last updated: 10/08/2014)
- 2-3+ tree visualization slideshow
- Direct link to Galles' B+-tree visualization. Beware that this does not handle duplicate keys in the way that you must for the project, but it will give you a general idea for how 2-3+ trees work.
- OpenDSA B+ tree page. Galles' visualization should appear toward the bottom of the page.
- Project 2 sample input (Last updated: 10/11/2014)
- Project 2 sample output when run with hash table initial size 10 and (memory manager) block size 32 (Last updated: 10/11/2014)
- Project 2 sample output with annotations for input (Last updated: 10/11/2014)
- Project 2 reference tests
- Project 3
- Project 3 Spec Document (Last updated: 10/27/2014)
- Test file generator program (Last updated: 10/16/2014)
- Check if a file is sorted (Last updated: 10/19/2014)
- Sample statistics file (Last updated: 10/27/2014)
- Project 4
- Project 4 Spec Document (Last updated: 11/07/2014)
- Project 4 sample input (Last updated: 11/11/2014)
- Project 4 sample output when run with hash table initial size 10, (memory manager) block size 32, and 10 buffers (Last updated: 11/11/2014)
- Project 4 sample output (annotated) when run with hash table initial size 10, (memory manager) block size 32, and 10 buffers (Last updated: 11/11/2014)
- Memory pool file (binary file) (Last updated: 11/19/2014)