Question

c++


/*This is the starter file for your final proficiency test
This program has a function that will generate a list of integers using the rand function.
Your job is to fill the insertNum and oddCount functions.*/

#include <iostream>
#include <ctime>

using namespace std;

//constants and function prototypes
const int CAP = 100;
int buildList(int[], int size);
void printList(int[], int size);

//your functions to implement
/*This function finds even numbers in the list, and inserts a number before the even number 
such that the new number is one less than the even number.  Then return the new size.  
You do not need to worry about size going past CAP at this time.  
Please see my samples in the document and run the test a few times 
since my list is randomly generated.*/

int insertNum(int list[], int size);

/*This function counts the number of odd numbers in the list and returns to main.*/

int oddCount(int array[], int size);

int main()
{
        //DO NOT CHANGE MAIN
        int list[CAP], size = 0, count = 0;
        size = buildList(list, size);
        cout << "Original List!" << endl;
        printList(list, size);
        size = insertNum(list, size);
        cout << "List after inserts!" << endl;
        printList(list, size);
        count = oddCount(list, size);
        cout << "Number of odds = " << count << endl;
        return 0;
}

//function to build list.  DO NOT CHANGE THIS
int buildList(int list[], int size)
{
        srand(time(NULL));
        size = 10;
        for (int i = 0; i < size; i++)
        {
                list[i] = rand() % 100;
        }
        return size;
}

//function to print list.  DO NOT CHANGE THIS
void printList(int list[], int size)
{
        for (int i = 0; i < size; i++)
        {
                cout << list[i] << endl;
        }
}

//implement the missing functions here.

int insertNum(int list[], int size)
{
        return 0;
}

//deletes number at given position and returns new size.
int oddCount(int array[], int size)
{
        return 0;
}

Answer 1

// do comment if any problem arises

// code

#include <iostream>

#include <ctime>

using namespace std;

//constants and function prototypes

const int CAP = 100;

int buildList(int[], int size);

void printList(int[], int size);

//your functions to implement

/*This function finds even numbers in the list, and inserts a number before the even number

such that the new number is one less than the even number.  Then return the new size.  

You do not need to worry about size going past CAP at this time.  

Please see my samples in the document and run the test a few times

since my list is randomly generated.*/

int insertNum(int list[], int size);

/*This function counts the number of odd numbers in the list and returns to main.*/

int oddCount(int array[], int size);

int main()

{

    //DO NOT CHANGE MAIN

    int list[CAP], size = 0, count = 0;

    size = buildList(list, size);

    cout << "Original List!" << endl;

    printList(list, size);

    size = insertNum(list, size);

    cout << "List after inserts!" << endl;

    printList(list, size);

    count = oddCount(list, size);

    cout << "Number of odds = " << count << endl;

    return 0;

}

//function to build list.  DO NOT CHANGE THIS

int buildList(int list[], int size)

{

    srand(time(NULL));

    size = 10;

    for (int i = 0; i < size; i++)

    {

        list[i] = rand() % 100;

    }

    return size;

}

//function to print list.  DO NOT CHANGE THIS

void printList(int list[], int size)

{

    for (int i = 0; i < size; i++)

    {

        cout << list[i] << endl;

    }

}

//implement the missing functions here.

int insertNum(int list[], int size)

{

    // iterate over array

    for (int i = 0; i < size; i++)

    {

        // if odd found

        if (list[i] % 2 == 0)

        {

            // shift list to right

            for (int j = size; j > i; j--)

                list[j] = list[j - 1];

            size++;

            // add 1 less than even

            list[i] = list[i + 1] - 1;

            i++;

        }

    }

    return size;

}

//deletes number at given position and returns new size.

int oddCount(int array[], int size)

{

    int odd = 0;

    // iterate over array and count odd

    for (int i = 0; i < size; i++)

        if (array[i] % 2 != 0)

            odd++;

    return odd;

}

Output: