Flight Tracker
In the spring semester of 2024, during my sophomore year at the University of Rhode Island, I had the privilege of taking a course on Data Structures and Abstractions. For the final project, our class was given the task of researching and choosing a real-world problem that could be solved through the use and implementation of three or more data structures and/or algorithms. In groups of four, we were required to create a 15-minute presentation, a comprehensive, well-documented paper, detailed documentation, and an interactive microcosm.
My group decided to implement a flight tracker theme, where the user could input various pieces of information, and our program would find the most efficient routes to the selected destination. In addition, the program tracked fuel efficiency to minimize environmental impact and combat climate change. The three data structures we utilized for our project were a suffix tree, heap sort, and trie tree.
A user can text the main.cpp file using a g++ compiler with any of the following options:
1) Flights by Date
What to input:
Enter date (MM/DD/YYYY). Example: 05/27/2023
2) Flights by Carrier and Date
What to input:
Enter carrier code: AA
Enter date (MM/DD/YYYY). Example: 05/27/2023
3) Flights by Earliest Actual Departure Time and Carrier Code (Amount of Flights Requested)
What to input:
Enter carrier code: AA
Enter number of flights for earliest departure times: 7
4) Flights by Carrier Code (Amount of Flights Requested)
What to input:
Enter carrier code: AA
Enter number of flights: 8
5) Flights by Tail Number
What to input:
Enter tail number: N875RW
