Question: Write a menu driven C++ program that prints the day number of the year, given the date in the form of month-day-year. For example, if

 Write a menu driven C++ program that prints the day number
of the year, given the date in the form of month-day-year. For
example, if the input is 1-1-2006 then the day number is 1.
If the input is 12-25-2006, the day number is 359. The program
should check for a leap year. A year is leap if it

Write a menu driven C++ program that prints the day number of the year, given the date in the form of month-day-year. For example, if the input is 1-1-2006 then the day number is 1. If the input is 12-25-2006, the day number is 359. The program should check for a leap year. A year is leap if it is divisible by 4 but not divisible by 100. For example, 1992, and 2008 are divisible by 4 and not divisible by 400. A year that is divisible by 100 is a leap year if it is also divisible by 400. For example, 1600 and 2000 are divisible by 400, however, 1800 is not a leap year because 1800 is not divisible by 400. Program terminates when the user type in n or N Note : Your program must contain the following 7 functions 1. A function that returns a Boolean value indicating whether or not the day entered is between 1 and 31. 2. A function that returns a Boolean value indicating whether or not the month entered is between 1 and 12 3. A function that returns a Boolean value indicating whether or not the year entered is greater than 0 and less than or equal to current year. 4. A function that returns a Boolean value indicating whether or not the year entered is a leap year. 5. A function that returns a integer value indicating the number of days in a month 6. A function that returns a string value indicating the name of the month. 7. A function that returns a integer value indicating actual number of day that is equivalent to day, month, and year that is entered

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!