Time Off Program plan: source.cpp Include the required header files to the program. Define the “main()” function. Create an object for the “TimeOff” class and pass an input value to the function. Retrieving the outputs from the “TimeOff” class and print it. TimeOff.cpp Include the required header files to the program. Define the default constructor for the “TimeOff” class. Set the name, if the string is not an empty. Set the employee ID. Set the maximum sick days and days of sick leave taken by an employee. Check the max vacation hours is greater than 240. If so, set the max vacation as 240. Otherwise, set the max vacation as given hours. Set the max unpaid leave, unpaid leave hours and vacation taken by an employee. TimeOff.h Include the required header files to the program. In private, declare the required variables. In public, create the constructor. Create a mutator functions and accessor functions for setting and returning the value. NumDays.cpp Include the required header files to the program. The function definition of overloaded binary “+” operator. Create an object for the “NumDays” class. Add the objects. Return the object to the function. The function definition of overloaded binary “-” operator. Create an object for the “NumDays” class. Subtract the objects. Return the object to the function. The function definition of overloaded prefix “++” operator. Increment the hours. Calculate the days by dividing hours by 8. Return the object to the function. The function definition of overloaded postfix “++” operator. Create an object for the “NumDays” class. Increment the hours. Calculate the days by dividing hours by 8. Return the object to the function. The function definition of overloaded prefix “--” operator. Decrement the hours. Calculate the days by dividing hours by 8. Return the object to the function. The function definition of overloaded postfix “--” operator. Create an object for the “NumDays” class. Decrement the hours. Calculate the days by dividing hours by 8. Return the object to the function. NumDays.h Include the required header files to the program. In private, declare the required variables. In public, create the constructor. Set the days and hours. Create a mutator and accessor function for the days and hours. Call the required overloaded operator functions.

Question

Want to see the full answer?

Answer 1

Question

Chapter 14, Problem 5PC

Program Plan Intro

Time Off

Program plan:

source.cpp

Include the required header files to the program.

Define the “main()” function.

Create an object for the “TimeOff” class and pass an input value to the function.

Retrieving the outputs from the “TimeOff” class and print it.

TimeOff.cpp

Include the required header files to the program.

Define the default constructor for the “TimeOff” class.

Set the name, if the string is not an empty.

Set the employee ID.

Set the maximum sick days and days of sick leave taken by an employee.

Check the max vacation hours is greater than 240.

If so, set the max vacation as 240.

Otherwise, set the max vacation as given hours.

Set the max unpaid leave, unpaid leave hours and vacation taken by an employee.

TimeOff.h

Include the required header files to the program.

In private, declare the required variables.

In public, create the constructor.

Create a mutator functions and accessor functions for setting and returning the value.

NumDays.cpp

Include the required header files to the program.

The function definition of overloaded binary “+” operator.

Create an object for the “NumDays” class.

Add the objects.

Return the object to the function.

The function definition of overloaded binary “-” operator.

Create an object for the “NumDays” class.

Subtract the objects.

Return the object to the function.

The function definition of overloaded prefix “++” operator.

Increment the hours.

Calculate the days by dividing hours by 8.

Return the object to the function.

The function definition of overloaded postfix “++” operator.

Create an object for the “NumDays” class.

Increment the hours.

Calculate the days by dividing hours by 8.

Return the object to the function.

The function definition of overloaded prefix “--” operator.

Decrement the hours.

Calculate the days by dividing hours by 8.

Return the object to the function.

The function definition of overloaded postfix “--” operator.

Create an object for the “NumDays” class.

Decrement the hours.

Calculate the days by dividing hours by 8.

Return the object to the function.

NumDays.h

Include the required header files to the program.

In private, declare the required variables.

In public, create the constructor.

Set the days and hours.

Create a mutator and accessor function for the days and hours.

Call the required overloaded operator functions.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Design a dynamic programming algorithm for the Longest Alternating Subsequence problem described below: Input: A sequence of n integers Output: The length of the longest subsequence where the numbers alternate between being larger and smaller than their predecessor The algorithm must take O(n²) time. You must also write and explain the recurrence. Example 1: Input: [3, 5, 4, 1, 3, 6, 5, 7, 3, 4] Output: 8 ([3, 5, 4, 6, 5, 7, 3, 4]) Example 2: Input: [4,7,2,5,8, 3, 8, 0, 4, 7, 8] Output: 8 ([4, 7, 2, 5, 3, 8, 0,4]) (Take your time with this for the subproblem for this one)

Design a dynamic programming algorithm for the Coin-change problem described below: Input: An amount of money C and a set of n possible coin values with an unlimited supply of each kind of coin. Output: The smallest number of coins that add up to C exactly, or output that no such set exists. The algorithm must take O(n C) time. You must also write and explain the recurrence. Example 1: Input: C24, Coin values = = [1, 5, 10, 25, 50] Output: 6 (since 24 = 10+ 10+1+1 +1 + 1) Example 2: Input: C = 86, Coin values = [1, 5, 6, 23, 35, 46, 50] Output: 2 (since 86 = 46+35+5)

Design a dynamic programming algorithm for the Longest Common Subsequence problem de- scribed below Input: Two strings x = x1x2 xm and y = Y1Y2... Yn Output: The length of the longest subsequence that is common to both x and y. . The algorithm must take O(m n) time. You must also write and explain the recurrence. (I want the largest k such that there are 1 ≤ i₁ < ... < ik ≤ m and 1 ≤ j₁ < ... < jk ≤ n such that Xi₁ Xi2 Xik = Yj1Yj2 ··· Yjk) Example 1: Input: x = 'abcdefghijklmnopqrst' and y = 'ygrhnodsh ftw' Output: 6 ('ghnost' is the longest common subsequence to both strings) Example 2: Input: x = 'ahshku' and y = ‘asu' Output: 3 ('asu' is the longest common subsequence to both strings)