diff options
| author | mo khan <mo@mokhan.ca> | 2019-08-03 14:19:33 -0600 |
|---|---|---|
| committer | mo khan <mo@mokhan.ca> | 2019-08-03 14:19:33 -0600 |
| commit | 8e7b0d4991149313db31b0e6fba84d3e90990eac (patch) | |
| tree | c8286ee1dfc5ecfa041bc19eef071d47a838e28a /src/Q8/README.md | |
| parent | c8e6bf08e92e8d6e020c2bbb83a6babecf8ebb23 (diff) | |
add learning profile for assignment 8
Diffstat (limited to 'src/Q8/README.md')
| -rw-r--r-- | src/Q8/README.md | 43 |
1 files changed, 43 insertions, 0 deletions
diff --git a/src/Q8/README.md b/src/Q8/README.md new file mode 100644 index 0000000..cd80cfa --- /dev/null +++ b/src/Q8/README.md @@ -0,0 +1,43 @@ +# Learning Profile for Assignment #2 Question #8 + +## Name: Mo Khan +### Student ID: 3431709 + +1. Problem Statement + + The following is a score of a single game in badminton. + The top row is the score for Player 1. + The second row is the score for Player 2. + Represent this data in an ArrayList in a class called `BadmintonScoring`. + + | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | + | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | + | 0 | 1 | 2 | | | | | | 3 | 4 | | | | | | | | | | | 5 | | | | | | | + | 0 | | | 1 | 2 | 3 | 4 | 5 | | | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | | 16 | 17 | 18 | 19 | 20 | 21 | + + 1. Compute the maximum points scored by Player 1 and Player 2. + 1. Compute the maximum number of points scored in a continuous sequence by Player 1 and Player 2. + Hint: Player 1 scored the sequence 0-1-2, which implies s/he scored 2 points in a continuous sequence. + Similarly, for Player 2, 16-17-18-19-20-21 implies that s/he scored 5 points in a continuous sequence. + 1. Extend `BadmintonScoring` to associate each point scored by a player with a particular stroke that earned that point, using the notion of association list. + You can represent each point as an object and store the score of a player in an association list. + For example, when Player 1 scored his/her first point, instead of just 1, it could have been {1, slice}. + Thus, each point is augmented with the type of stroke from the following list: + a. slice + b. drive + c. smash + d. drop + e. net-shot + 1. Store the following score of a single game using the modified `BadmintonScoring` class. + + | 01 | 02 | 03 | 04 | 05 | 06 | 07 | 08 | 09 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | + | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | + | 00 | 1a | 2c | | | | | | 3a | 4c | | | | | | | | | | | 5c | | | | | | | + | 00 | | | 1d | 2e | 3d | 4e | 5d | | | 6e | 7e | 8a | 9d | 10e | 11e | 12e | 13e | 14e | 15e | | 16e | 17e | 18e | 19e | 20e | 21a | + + 1. Identify the type of stroke that earned most points for each player. + +1. Description of the Code +1. Errors and Warnings +1. Sample Input and Output +1. Discussion |
