Coding in C programming language

Concurrent Key-Value Database

Implement a non-persistent, concurrent key-value database using the Reader/Writers algorithm.

- Use a hashmap as the underlying data structure. Inspiration is ok, however, the implementation must be yours. The hashmap must be able to grow to fit new elements, but it does not need to reduce its size.

- Keys and values are strings (char *)

- Operations are: get, put

- The put operation will replace existing values

TBD: database header and testing routines to be provided