This is a repository for the lab assignment #1, which consists of implementation of a B-Tree, for the course CSD307, Advanced Data Management Systems, Shiv Nadar University. The B-Tree algorithm has been implemented in Java v1.7.

This algorithm is implemented on the disk, that is each node is stored as a serialized object file in the disk. At a time the there are atmost only 3 nodes loaded into the Memory.

This implementation has been successfully tested for up to 1000000 elements.

Inputs : Choice of manual entry or randomized number insertion into the tree. Outputs : Results of Traversal, Search.

Atish Majumdar : 1410110081
Prasanna Natarajan : 1410110298
Vedant Chakravarthy : 1410110489

The algorithm for the code was inspired from "Introduction to Algorithms" by Leiserson, Stein, Rivest and Cormen.