Basically a Hash table project to be implemented in C++, not complex code, easy to maintain and to extend.
The Hash table implementation is slightly different from normal Hash Tables but it should not be too
complex to code.
I may have to port the code to a Kernel Driver model.
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request.
3) Complete ownership and distribution copyrights to all work purchased.
ok here we go.
This is a personal project that I need to acomplish within a few days.
I need to implement a solution to a
query project using Hash tables. I want the
code to be done in C++. I don't want complex
code, easy to maintain and perhaps to
The project is as follows...
I want to maintain 2 Hash tables which
will be pointing to the same object
consisting of the following entries:
a 16-byte value
a Pointer to an object
a Next pointer
a Next Pointer
The Pointer to an object I want to
use it in such a way that sometimes
that object may be an Int or sometimes
a 16-byte value. I think overloading it
will work here.
The Next pointer is added twice because
we will be having 2 Hash tables pointing
to the same object so we may have
to use these 2 pointers.
Each entry in the Hash table must be of
this type and it must be done as a link
list, meaning it must grow as demands
The size of each of the 2 Hash tables
is of 256 entries each. So We will
have 2 arrays of 256 entries each.
The reason I thought of having 2 Hash
tables pointing to the same object is
that sometimes I need to do a query
using an 8-bit value and sometimes
I am using an integer value, which in
this case I will have to just use the
first 8 bits of the value and discard
The project should be able to
distinguish between a 8-bit value and
an integer so that it queries the
appropriate table and then it does
a match from there.
The project must be able to do the
1.- Add a relation between an 8bit
value and a 32 bit value.
This will be the function that
adds data to the tables.
Using the 8bit value, I get a
location in the table, it then
adds the 8 bit value and the
32 bit value and sets the
appropriate links in the Next
It will also do the same for the
second table where we index by the
We should end up with 2 entries
one for each table..
2.- Query the Tables whenever we
pass a 8-bit value, return
true if we found a match
whenever we use the 8-bit value
and the integer value.
here we use the 8bit value as
an index to figure out the location
and then we use it to find a match
along with the int value in the
object structure or class.
query_by_8bit(8bit value, int value)
3.- Query the Tables whenever we
pass an integer value, similar
as above, but querying by the int
4.- Delete an existing object
This fnction searches the objects
by using the 8bit value as index
and as soon it finds a match
it deletes the link.
5.- Edit an existing object when we
want to change a old integer field
with a new one.
Windows NT 4.0
I am using Visual Studio 6.0
## Deadline information
Well, in all fairness I need the
project within a week, meaning by Nov 11. I am hoping this is not too complicated of a project for some C++ gurus.