FILE ORGANIZATION and PROCESSING

There will be programming assignments every month. For all your projects, you are required to build the UNIX "ndbm" style libraries and use them to do your program. Read the man page !
Here's the first one due 3/27. (You should all know HASHING from DS !)

- given a file, you are required to perform the following tasks.
- find a record with a specific key, delete/insert a record using hashing.
- functions you should build are :

DBM *dbm_open(char *file, int flags, int mode);
void dbm_close(DBM *db);
datum dbm_fetch(DBM *db, datum key);
int dbm_delete (DBM *db, datum key);
int dbm_store(DBM *db, datum key, datum content, int flags);

- To begin with, key is about 10 characters long and content is 100.
- Insert 100, 1,000, 10,000 records and see how large the file grows.
- Can you do first_key and next_key ?
Second one's doing overlapped input/output/processing. Heapsort is a great algorithm to do just that. You should be able to handle "thread" to do the overlapping part. Again, read the man page and be prepared !