$30
IPC144 Final Assignment Solved
Introduction
This is part-2 of the final assessment and has two sections:
1. Source code solution to a problem described further on in this document
- Worth (graded out of 3.0)
- This section may be done individually or in groups (no more than 3 students per group).
- If you plan to do this section as a group, you must receive authorization from your instructor before starting.
- If this section is done as a group, all members will receive the same grade (for this section)
2. Reflection containing answers to specific topics/concepts as directed in the reflection section described further on in this document
- Worth (graded out of 4.5)
- This part must be done by all students individually
Submission Policy
All work (including reflections) must be submitted to your instructor no later than:
Friday April 17th before NOON (11:59 AM)
Your Digital Signature
• Every file submitted (.c | .h | .txt) must contain at a minimum, your full name and Seneca email address
• If you are submitting as a group, each member’s information should be included
By stating your identity on each piece of work, you are authenticating you/your group are the author(s) of the material and that you have not plagiarized (copied) anyone else’s work
Note: You are responsible for backing-up your work regularly.
Your Task – Source Code (40%)
Download or clone the final assessment part-2 (Final-P2) from https://github.com/Seneca144100/Final-Part-2 The Bike Race
You have been tasked with developing a program to read the information about a bike race from a text file and produce a report on it. The race is a major event and could attract up to 5,000 participants. The potential of having such high volume of data will require you to be efficient in how the data is read, stored and processed. There are three timestamps recorded for each rider:
1. The start time
2. The time when the rider crested the top of a mountain pass that is on the route
3. The completion time (or the time at which the rider withdrew)
In the event that a rider does not complete the course, they are marked as having not completed and the time at which they withdrew is recorded but not used in any calculations and riders who do not finish are not eligible for any awards.
Riders are organized into categories based on age and the race length. Age groupings are determined by age ranges, where 16-20 are juniors, 21-34 are adults and 35 or older are seniors. There are three different races lengths, S (short, 50km), M (medium, 75 km), and L (long, 100 km). The race will have different start times for each category but this has no impact on the times it will take the riders to complete the course.
You cannot guarantee that enough riders will enter for each category to win all awards available and awards that are not awarded will be listed as “Not Awarded”.
For example:
1. If you request a report for the winners of each category and there is a category with no entrants, you would list it as “Not Awarded” rather than putting a rider’s name.
2. Likewise, if you request a report for the top 3 riders in each category and a category only has 2 entrants, then you just print the top 2 entrants.
The following is a sample of the file “data.txt” which will be read by the program. Each line of the file contains the name of the rider, age, race length (S, M, or L), the clock time of the race start, clock time of cresting the mountain and clock time of finishing the race. In the event that a rider withdraws, there is a “W” at the end of the line and the mountain time will be zero if they did not make it that far while the finish time will be when the rider withdrew. ====================== Sample “data.txt” File =====================
Eddy Mercx, 72 M 1:10 1:59 2:58
Jocelyn Lovell, 60 M 1:10 0:00 1:34 W
Jason Gaudet, 28 M 1:10 2:11 3:09
Claude Van Gogh, 20 M 1:10 2:25 3:24
Lance Armstrong, 40 M 1:10 2:02 3:05
Arlenis Sierra, 26 L 1:00 1:51 2:41
Billy F. Gibbons, 62 S 1:20 2:42 4:28
Charlie Watt, 66 S 1:20 3:08 5:39
Cecilie Ledwig, 23 L 1:00 1:49 2:38
Nikki Sixx, 48 S 1:20 2:59 4:58
Kirsten Wild, 34 L 1:00 1:55 2:54
Eddie Van Halen, 63 S 1:20 2:10 3:55
Rachel McKinnon, 37 L 1:00 1:39 2:41
Angus Young, 61 S 1:20 2:02 3:10
======================= End Sample Data File =======================
NOTE: Remember this data file could likely contain a maximum 5,000 records
• The above sample “data.txt” file is included and should be used in your development.
• You should take a backup of this file so you can modify it with different data to thoroughly test your reporting logic (not all scenario’s are demonstrated in the example)
File Helper Module
A “file_helper” module has been provided for you and your code must use the provided readFileRecord() function in order to read each line of the data file.
The code requires the use of a RiderInfo structure. The RiderInfo structure members are purposely missing and will require you to define them based on the code in the readFileRecord() function.
NOTE: You are not to modify the “file_helper” module files with the exception of completing the RiderInfo structure members in the “file_helper.h” file.
Additional Module’s
You are free to design your solution as you see fit, however, your solution design should implement additional modularity if/when possible.
Application Main Entry Point (main)
You will be required to develop the main function (application entry point) in the file “main.c” that will launch your solution.
Menu & Reporting Options
The following menu/reporting options must be offered:
• “Display the best 3 riders in a category”
Note: “best” means the fastest completed times (lowest duration)
• “Display all riders in a category”
• “Display the worst 3 riders in a category”
Note: “worst” means the slowest completed times (highest duration)
• “Display the winners in all categories”
• “Exit the application”
The following two pages, is an example output execution of the minimum expected behaviour of how your solution should work.
Note
• You are encouraged to improve on the menu in a way you think would be more user-friendly
• Your solution should closely (if not exactly) match the tabular format used in the example reporting output/display parts
• The example does not show all possible data output scenario’s described in the requirements such as the scenario for “Not Awarded”. However, it is expected your solution will work and behave as required in all possible cases.
Example Execution
Highlighted text represents user input.
******************** Seneca Cycling Race Results ********************
What would you like to do?
0 – Exit
1 – Print top 3 riders in a category
2 – Print all riders in a category
3 – Print last 3 riders in a category
4 – Print winners in all categories
: 1
Which category (S, M, L): s
Rider Age Group Time
---------------------------------------
Angus Young Senior 1:50
Eddie Van Halen Senior 2:35
Billy F. Gibbons Senior 3:08
What would you like to do?
0 – Exit
1 – Print top 3 riders in a category
2 – Print all riders in a category
3 – Print last 3 riders in a category
4 – Print winners in all categories
: 2
Which category (S, M, L): S
Rider Age Group Time Withdrew
------------------------------------------------
Angus Young Senior 1:50 No
Eddie Van Halen Senior 2:35 No
Billy F. Gibbons Senior 3:08 No
Nikki Sixx Senior 3:38 No
Charlie Watt Senior 4:19 No
Jocelyn Lovell Senior N/A Yes
What would you like to do?
0 – Exit
1 – Print top 3 riders in a category
2 – Print all riders in a category
3 – Print last 3 riders in a category
4 – Print winners in all categories
: 3
Which category (S, M, L): S
Rider Age Group Time
---------------------------------------
Billy F. Gibbons Senior 3:08
Nikki Sixx Senior 3:38
Charlie Watt Senior 4:19
What would you like to do?
0 – Exit
1 – Print top 3 riders in a category
2 – Print all riders in a category
3 – Print last 3 riders in a category
4 – Print winners in all categories
: 4
Rider Age Group Category Time
------------------------------------------------
Angus Young Senior 50 km 1:50
Eddy Mercx Senior 75 km 1:48
Cecilie Ledwig Adult 100 km 1:38
What would you like to do?
0 – Exit
1 – Print top 3 riders in a category
2 – Print all riders in a category
3 – Print last 3 riders in a category
4 – Print winners in all categories
: 0
Keep on Riding!
Reflection
Each student must submit a reflection and will be independently graded (if you are working in a group, only the source code portion will be a shared grade). Please provide answers to the following in a text file named reflect.txt. Remember, include your DIGITAL SIGNATURE as described on page one of this document.
Your reflection answers should be detailed and accurate. A suitable response should be at least 100 words for each reflection question. This implies your overall reflection must be a minimum of 300 words (not including the question if you repeat it in the answer).
• This program can greatly benefit from modular programming. Describe how you decided to make your program more modular. For each function you created, describe you decided to make the function and why its contents should be in one function.
• The text for the categories is repeated a lot. Describe how you stored this efficiently to reduce wasting memory. Why is the technique you used more space efficient than other techniques? Pick one other technique that is less efficient than your method and describe why your method is superior (better).
• Reading the data from the file presented some challenges. Explain how the readFileRecord() function determined when the end of line (record) had been reached, given that some of the riders might have withdrawn and would have a different number of fields on the line. Describe another technique you could use to handle the differing number of fields on each line (record).
