With regards to literature and material on flex, see the literature page. The tool flex is used in combination with the programming language C. If you have not programmed much in C before, then it would be a good idea to read about it and try to write a few small programs. References to material on C can be found via the literature page.
insert
, delete
, and lookup
.
The elements in the hash table are referred to as keys.
They are integers and they are
placed in an array. The size of the array must be a prime.
The hash function, which is used to decide where a given
key should be placed in the array, should be of the form
a * x mod "table size"
,
where a
is a different prime.
As a simplification compared with a normal hash table,
you can assume that no keys are placed in the same entry in the array.
The implementation should be made in ANSI-C
.
Use the compiler gcc
.
Make a few tests.
insert
, delete
, and lookup
.
You do not have to implement any kind of rebalancing.
The implementation should be made in ANSI-C
.
Use the compiler gcc
.
Make a few tests.
make
and explain the fundamental principles
and features. You do not have to go into detail with any advanced
applications. As a start, read the entire introductory section
and the section on syntax. Then
familiarize yourself with the remaining content,
e.g., by reading the introduction to each chapter.
C
and
make
, see the
literature page.