General Programming Assessment
Scenario
There are eight cars in each team called Chevy and Ford. One car from each team races its opponent on the drag strip. Read in the racing times for the eight Chevy cars and then read in the times for the eight Ford cars. Store the times into arrays called Chevy[ ] and Ford[ ]. Then list the winner of each pair, giving the number of seconds the winner won by. At the end declare which team won based on which team had the most wins. Below is a sample match.
Enter the times for the Chevy cars: 5.4 7.2 4.0 9.1 5.8 3.9 6.2 8.1
Enter the times for the corresponding Ford cars: 5.8 6.9 3.9 9.2 5.8 3.8 6.0 8.5
And the winners are:
Chevy by 0.4 sec
Ford by 0.3 sec
Ford by 0.1 sec
Chevy by 0.1 sec
Tie !
Ford by 0.1 sec
Ford by 0.2 sec
Chevy by 0.4 sec
And the winning team is: F O R D !
- Accept the racing times for each of the Chevy cars into the array Chevy[ ].
- Accept the racing times for each of the Ford cars into the array Ford[ ].
- Then declare the wining car for each race, giving the winning time in seconds.
- If the times are identical, then declare the race was a tie.
- Finally, declare which team won the match, assuming a tie is possible.
Q1. Think about logic and design first, write the pseudo-code for it.
Q2. Draw a flowchart.
Q3. Write the program in any of the language given below:
a. C++
b. Java
c. C#
d. Visual Basic
e. Python
Q4. Draw an IPO chart for your test cases.