DIVVY Data Hashing

DIVVY Data Hashing

Description:

The project was divided into two separate parts. The first incorporated the development of a hashmap class for storing (key,value) pairs into a hash table that handles collisions due to the assumption of imperfect hashing. The second part of the project was to use the hashmap class and apply it to the provided DIVVY data.

Commands within program:
  • Lookup by ID
  • Lookup by Abbreviation (e.g. "63rd Beach")
  • Lookup a bike trip by trip ID (e.g. "Tr10406575")
  • Lookup bike use by bike ID (e.g. "B5116")
  • Find nearby stations from given latitude/longitude
  • Find similar trips from given latitude/longitude
Data Structure: Hashmap, Vector, Set
Leveraged Knowledge:
  • Dividing programming into units allowing for abstraction (made possible by pass by reference)
  • Developing hashing functions for separate user inputs
  • Accommodating for collisions
  • Use of string stream for parsing strings and obtaining data from .csv files
  • Linking various .cpp and .h files
  • Keeping track of variables
  • Creating instances of a struct

Download Code Here