Exercise 9 - Due at 11:59:00 PM EDT on Sunday, 03/20/2022

You may solve all problems in the same program.

1. In order to calculate the address of a particulat element of an array, we use the following formula:

Address = Base_Address + size_of_one_element * index

Calulate the following addresses. You may write the solution as a comment on the file with the solutions for the other problems.

(i): Array of doubles. Base address = 2000, index = 34, sizeof(double) = 8 bytes
(ii): Array of shorts. Base address = 10504, index = 120, sizeof(short) = 2 bytes
(iii): Array of chars. Base address = 45906, index = 219, sizeof(char) = 1 byte

2. Write a program to read in 10 numbers from the user. Store them in an array. Find the sums of the odd and even numbers. 

Sample Run:

Enter the numbers:
1 23 90 -3 6 -130 82 0 -54 19

Odd number sum: 40
Even Number sum: -6

3. Write a C++ function that accepts an array of integers and its sze as parameters and returns the count of odd numbers in the array.

Sample Run:

Assume the array is 

1 3 19 24 32 0 21 -7 16 8

The count of odd numbers is : 5

4. Write a C++ function to accept an array of doubles and its size as parameters and return the number of negative numbers in the array.

Sample Run:

Assume the array is 

5 16 -7 21 19 -567 47 0 -456 -12 9 -8

The count of negative numbers is : 5

5. Write a C++ program that declares an array of size 1000. Then, get a number 'N' from the user, N being less than 1000 and fill out the array with the first N Fibonacci numkbers.

Sample Run: 

Enter the count required: 10

The array contents are:
0	1	1	2	3	5	8	13	21	34