This project is divided into 4 parts.

Part 1
 * The first part of this project requires that you implement a class that will be used to simulate a disk drive. The disk drive will have numberofblocks many blocks where each block has blocksize many bytes. More info...

Part 2
 * The second part of this project requires that you implement a simple file system. In particular, you are going to write the software which which will handle dynamic file management. This part of the project will require you to implement the class Filesys along with member functions. In the description below, FAT refers to the File Allocation Table and ROOT refers to the Root Directory. More info...

Part 3
 * In this part of the project, you are going to create a database system with a single table which uses the file system from Project II. The input file will consist of records associated with Art History. More info...

Part 4
 * In the final part of the project, you are going to augment the search function from the last project with a function that searches the database using a B-Tree index file to search over the primary key (year) of the database. Of course, to implement such a search it is necessary to first build the B-Tree. This part of the project is not complete, there are some bugs that i have not gotten to fix yet. Bugs are being fixed in the revised version. More info...

To Compile
 * To compile the project, navigate to the directory where the header files and cpp files are at then run a g++ .cpp.