Question

Goals:

• Write your own class.
• Instantiate an object of your class.
• Interact with the object's public interface.

Requirements:

Design a class that has an array of floating-point numbers. The constructor should accept an integer argument and dynamically allocate the array to hold that many numbers. The destructor should free the memory held by the array. In addition, there should be member functions to perform the following operations:

• Store a number in any element of the array - accepts an integer and floating point number as it's only arguments. Uses the integer to select the array element to store the floating point number argument into.
• Retrieve a number from any element of the array - accepts an integer as it's only argument and uses this to select the element to return.
• Return the highest value stored in the array - accepts no arguments.
• Return the lowest value stored in the array - accepts no arguments.
• Return the average of all the numbers stored in the array - accepts no arguments.
  
  Demonstrate the class in a program. The class does not interact with the user in any way. All interactions with the user are done in the main function. Make sure all accessors are correctly marked const.

Implement your class according to this UML class diagram:

Sample Run:

Values in the Numbers object: 88.6 3.14 2.77 90.5

High Value in Numbers object: 90.5

Low Value in numbers object: 2.77

Average value in Numbers Object: 46.2525

Answer 1

Answer;

Program

#include <iostream>
#include <string>

using namespace std;

class FloatingProblem
{
private:
float * ar;//array pointer

public:
FloatingProblem(int size)
{
ar = new float[size];//initializing array
}

setElement(int index, float num)
{
ar[index-1] = num;//setting array elements
}

float getElement(int index)
{
return ar[index-1];//getting array elements
}

float highest()
{
float high = ar[0];
int n = sizeof(ar)+1;
for(int i=1; i<n; i++)
{
if(high<ar[i])//finding highest
{
high = ar[i];
}
}
return high;
}

float lowest()
{
float low = ar[0];
int n = sizeof(ar)+1;
for(int i=1; i<n; i++)
{
if(low>ar[i])//finding lowest
{
low = ar[i];
}
}
return low;
}

float average()
{
float sum = 0;
int n = sizeof(ar)+1;
for(int i=1; i<n; i++)
{
sum+= ar[i];
}
return sum/n;
}

~FloatingProblem()
{
delete[] ar;//deconstructor
}
};

int main()
{
FloatingProblem obj(5);

//loading the array
obj.setElement(1, 10.2);
obj.setElement(2, 20.4);
obj.setElement(3, 14.6);
obj.setElement(4, 15.8);
obj.setElement(5, 13.8);

//testing all functions
cout<<"Array value at index 3: "<<obj.getElement(3)<<endl;
cout<<"Highest: "<<obj.highest()<<endl;
cout<<"Lowest: "<<obj.lowest()<<endl;
cout<<"Average: "<<obj.average(