Flight Delay Project
I wrote a programs for processing text (csv) files. You can download it the following link.
“https://drive.google.com/open?id=1RPlfZKW83M3FQbylulXxN6DPiF8daJ7z“ The flight delays zipped file downloaded from Kaggle contains three files; airlines.csv, airports.csv
and flights.csv.
Works done in this project:
Sanitization
Eliminate repeating entries in Flights.csv, remove entries with missing values and errors in the file. Program should report the total processing time, # of eliminated entries and # of good entries.
To solve this part, I’ve separated the file line by line, or I’ve separated each line followed by column by column, and I’ve determined that any column is empty or full.
User will pick a date interval (start and end dates are included) and program will show a summary report for the entries between these dates, listing each flight (Airline and Flight Number), total number of entries, minimum departure delay, maksimum departure delay, average departure delay ordered by number of entries descending.
In this part, I first determined the day intervals. I then put the desired values that contain these ranges into HashMap. The key value in HashMap is Airline and Flight Number. The value value saves the departure delays (This section is made as a list).
This list is required to get the desired values. Before this, HashMap was assigned to TreeMap and sorted according to decreasing. Benchmarking method was used in order of decreasing order.