Assignment 7 | Computer Science homework help

Assignment 7.1 [95 points]
This program will ask the user to answer a series of arithmetic problems and report on how the user performs. You will write this program in phases as specified below. Make sure that each phase works correctly and uses good style before progressing to the following phase.
Note that the purpose of this assignment is to give you lots of practice with parameter passing without making you write a huge program. For this reason I have provided a structure diagram at the end of this document. Make sure that you adhere to the structure diagram carefully.
Turn in only your final product.
Phase 1: Your main function for phase I must look exactly like this:
    int main()
    {
        srand(time(0));   
        doOneSet();
    }
You must write the function doOneSet which will, for now, write out 5 addition problems. All of the numbers printed should be between 0 and 100, inclusive. Here is a sample output for this phase:
    45 21 =
    0 100 =   
    54 23 =   
    4 19 =
    18 92 =
The numbers that are produced for these problems must be generated randomly by the computer. The numbers in the sample output are given only as an example. Refer to lesson 7.3 for more information about generating random numbers.
Phase 2: Change your doOneSet function so that instead of just writing out the problems it also allows the user to enter an answer, and then tells the user whether the answer was correct or not. Do not change your main function. Here is the sample output for this phase (user input is indicated here by using bold font. It won’t be bold in your own output):
    45 21 = 66
    correct
    0 100 = 100   
    correct  
    54 23 = 67
    incorrect
    4 19 = 13
    incorrect
    18 92 = 110
    correct
Before you move on to phase 3, refer to the structure diagram at the end of this document and make sure that you have adhered to it for all of the functions indicated there for phase 2. This will probably mean dividing your doOneSet function up into functions, if you haven’t done it already.
Phase 3: Now you will change your doOneSet function so that it will work for either addition, subtraction, or multiplication. For the purposes of this assignment, a set of problems is defined to be a group of problems that are all of the same type (all addition, all subtraction, or all multiplication). After completing this phase your program will give 5 addition problems, 5 subtraction problems, and 5 multiplication problems, for a total of 15 problems. Your main function must look exactly like this:
    int main()
    {
        srand(time(0));   
        doOneSet(‘ ’);
        doOneSet(‘-‘);
        doOneSet(‘*’);
    }
The parameter tells doOneSet whether to do addition, subtraction, or multiplication. Notice that there is exactly one doOneSet function definition, not three! Here is the sample output for this phase:
    45 21 = 66
    correct
    0 100 = 100   
    correct
    54 23 = 67
    incorrect
    4 19 = 13
    incorrect
    18 92 = 100   
    correct
    59 – 19 = 40
    correct
    19 – 84 = -29   
    incorrect
    0 – 65 = -65
    correct
    96 – 1 = 95
    correct
    94 – 14 = 80
    correct
    0 * 87 = 0
    correct
    45 * 84 = 398
    incorrect
    8 * 37 = 873
    incorrect
    34 * 83 = 831
    incorrect
    38 * 3 = 238
    incorrect
Phase 4: Now you are ready to let the user specify how many problems per set. (Recall that a set is a group of problems all of the same type. In this program we are doing three sets: one set of addition, one set of subtraction, and one set of multiplication. This means that, for example, if the problems per set is 7, there will be a total of 21 problems given.) Ask the user to enter the number of problems per set at the very beginning of the program, so that all three sets have the same number of problems per set. Now your main function will look exactly like this except that you may add variable declarations in the indicated location:
    int main()
    {
       
       
        srand(time(0));
        getProbsPerSet(probsPerSet);  
        doOneSet(‘ ’, probsPerSet);   
        doOneSet(‘-‘, probsPerSet);
        doOneSet(‘*’, probsPerSet);
    }
For this phase you should also add a header at the beginning of each set, as illustrated in the following sample output for this phase. For purposes of the header, you should assume that the addition problems will always be set