data structure in c++

Implement the dictionary ADT for a large file stored on disk by means of the B+-tree. Assume that disk blocks are 1024 bytes, and thus both leaf nodes and internal nodes are also 1024 bytes. Records should store a 4-byte(int)key value and a 60-byte data field. Internal nodes should store key value/pointer pairs where the "pointer" is actually the block number on disk for the child node. Both internal nodes and leaf nodes will need room to store various information such as a count of the record stored on that node, a pointer to the next node on that level, and so forth. Thus, leaf node will store 15 records, and internal nodes will have room to store about 120 to 125 children depending on how you implement them . Use a bufferpool to manage access to the nodes stored on disk.

## Deliverables

1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.

2) Deliverables must be in ready-to-run condition, as follows (depending on the nature of the deliverables):

a) For web sites or other server-side deliverables intended to only ever exist in one place in the Buyer's environment--Deliverables must be installed by the Seller in ready-to-run condition in the Buyer's environment.

b) For all others including desktop software or software the buyer intends to distribute: A software installation package that will install the software in ready-to-run condition on the platform(s) specified in this bid request.

3) All deliverables will be considered "work made for hire" under U.S. Copyright law. Buyer will receive exclusive and complete copyrights to all work purchased. (No GPL, GNU, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site per the coder's Seller Legal Agreement).

## Platform

c++ and be able to run in unix

Skills: C Programming, Engineering, Linux, MySQL, PHP, Software Architecture, Software Testing, UNIX

See more: web programming in c, use of tree data structure, use of data structure in programming, use of data structure, unix programming environment, tree structure programming, tree structure in c, tree programming, tree program in data structure, tree of data structure, tree node, tree in data structure, tree data structure in c, tree data structure c, the unix programming environment, programming tree, programming structure, programming in data structure, programming for children, programming dictionary, programming data structure, programming and data structure, pointer programming, pointer in data structure, pointer data structure

About the Employer:
( 8 reviews ) United States

Project ID: #3184208

Awarded to:


See private message.

$29.75 USD in 3 days
(16 Reviews)

3 freelancers are bidding on average $38 for this job


See private message.

$42.5 USD in 3 days
(6 Reviews)

See private message.

$42.5 USD in 3 days
(7 Reviews)