Back to DFS's Pascal Page


Dice Rolls Graph Problem

This problem will get you to create a graph which displays the frequencies of the sums for 300 rolls of two standard dice.

Use a case statement to keep track of how many times each sum occurs as you simulate 300 rolls of the pair of dice.

Then draw a graph which uses a line of asterisks to represent the frequency of each possible sum. At the right, using the WhereY procedure built into the CRT unit, provide a numeric total for how many times each sum was rolled.

Sample results of rolling two dice 300 times are as follows.

 2s: *********                                                               9
 3s: **********************                                                 22
 4s: ***********************                                                23
 5s: ************************************                                   36
 6s: ***********************************                                    35
 7s: ***************************************                                39
 8s: **************************************************                     50
 9s: *******************************                                        31
10s: ****************************                                           28
11s: *******************                                                    19
12s: ********                                                                8

Do not use arrays to solve this problem.


© DFStermole 2008
Created 16 Mar 08
Modified 16 Mar 08