The jungle is getting polluted due to human encroachment and the animals need your help to
gauge how long they can suffer before they finally start a war against the humans. You need to
help them with pollution statistics.
For this assignment, you shall be parsing the pollution data of a city provided in the form of a
CSV (comma separated value) file . Your job is to build a system that stores this pollution data
and is able to query it by date in near constant time. You shall do this by implementing a hash
table-based in-memory database using single linked chains for collision resolution. The
database will contain the following fields.
year month day hour pm2.5 TEMP
You will load the CSV file into the database and then make a query of a date. If the date is not
found in the database, your program will respond with a “not found” message. Otherwise, the
program will print out the minimum, maximum, and average pm2.5 and TEMP of that date. You
will also be asked to remove a date (a “year,” “month,” and “day” combination) from the
database. In that case you need to remove all the entries related to that particular date.
For a reminder of how hashed chaining works, watch this 5 minute video from Prof. Leo Porter
about hash tables
Last Completed Projects
| topic title | academic level | Writer | delivered |
|---|