Write a class "Dog" with a private int field called months and two public member functions setAge and GetStage. setAge takes as
argument monthsToSet and sets the member field months. setAge returns void. getStage is a const member function that takes no argument and returns a string "Puppy" if the dog is less than 9 months old, "Adolescence" if more than 9 and less than 13 months, "Adulthood" if more than 13 and less than 60 months and "Senior" otherwise. The main should create a Dog called Buddy, set its age to 14 and cout the string returned by GetStage.
1 answer:
Answer:
see explaination
Explanation:
#include <iostream>
using namespace std;
class Dog {
int months;
public:
void SetAge(int mnths);
string GetStage() const;
//FIXME: Add declarations of member functions and fields
};
//FIXME: Add definitions of member functions
void Dog::SetAge(int mnths)
{
months = mnths;
}
string Dog::GetStage() const
{
if(months<9)
return string("Puppy");
else if(months<13)
return string("Adolescence");
else if(months<60)
return string("Adulthood");
else
return string("Senior");
}
int main() {
Dog buddy;
buddy.SetAge(14);
cout << buddy.GetStage();
return 0;
}
See attachment for screenshot and output.
You might be interested in
The recursive function would work like this: the n-th odd number is 2n-1. With each iteration, we return the sum of 2n-1 and the sum of the first n-1 odd numbers. The break case is when we have the sum of the first odd number, which is 1, and we return 1.
int recursiveOddSum(int n) {
if(2n-1==1) return 1;
return (2n-1) + recursiveOddSum(n-1);
}
To prove the correctness of this algorithm by induction, we start from the base case as usual:
by definition of the break case, and 1 is indeed the sum of the first odd number (it is a degenerate sum of only one term).
Now we can assume that returns indeed the sum of the first n-1 odd numbers, and we have to proof that
returns the sum of the first n odd numbers. By the recursive logic, we have
and by induction, is the sum of the first n-1 odd numbers, and 2n-1 is the n-th odd number. So,
is the sum of the first n odd numbers, as required: