This file explains the contents of some of your data-structures when you use datafile data1.txt with 
pool-size = 100
num-recs = 5

===============================================================
After first 6 inserts, the record array will have something like this (note that Position is the offset from start of memory pool, its not the actual pointer. You can use either offset or pointer in your implementation)

Recnum   Position In Memory Pool
0        0
1        70
2        15
3        52
4        34

Free Block list will have only one node with (position, size) = (90, 10)

I won't list the contents of memory pool, but GATORS should have been kicked out by this time.
================================================================

After the end of all commands, the record array should be

Recnum   Position In Memory Pool
0        0
1        34
2        15
3        -1(invalid)
4        -1(invalid)

Free Block list will have only one node with (position, size) = (47, 53)

Again I won't list the contents of memory pool, but it should only have records with names HOKIES, BEAT, HURRICANES
(lets hope that this is the result we all get)
===============================================================
Also One of the print commands should fail

===============================================================