Employee Payroll Program Plan: Include required header files. Initializes value for pay rate, social security tax, federal income tax, state income tax, union dues, over time rate and health insurance cost using “const” modifier. Define main function. Declare “double” variables for hours worked, gross pay, overtime amount, social security amount, federal income tax amount, state income tax amount, union dues amount and net pay amount. Declare “int” variables for number of hours worked and number of dependents. Declare “char” variable for user option. Insert the function for display all output in two decimal places. Performs “do-while” loop. In this loop, repeat the below steps until the character is not “y” or “Y”. If the hours worked is less than or equal to “40”, then compute the amount for gross pay. Otherwise, compute overtime amount and gross pay amount. Compute the amount for social security tax, income tax, state tax, and net. If the number of dependents is greater than or equal to “3”, the compute the new net pay amount. Display the hours worked and its regular pay rate. If the hours worked greater than “40”, then display the overtime amount. Display the workers gross pay, social security tax withheld amount, federal income tax withheld amount, and state income tax withheld amount. If the number of dependents are greater than or equal to “3”, then display the health insurance withheld amount, union dues amount and net take-home pay. Create the prompt statement for user repeat calculation and read the user option.

Question

Want to see the full answer?

Answer 1

Question

Chapter 2, Problem 6PP

Program Plan Intro

Employee Payroll

Program Plan:

Include required header files.

Initializes value for pay rate, social security tax, federal income tax, state income tax, union dues, over time rate and health insurance cost using “const” modifier.

Define main function.

Declare “double” variables for hours worked, gross pay, overtime amount, social security amount, federal income tax amount, state income tax amount, union dues amount and net pay amount.

Declare “int” variables for number of hours worked and number of dependents.

Declare “char” variable for user option.

Insert the function for display all output in two decimal places.

Performs “do-while” loop. In this loop, repeat the below steps until the character is not “y” or “Y”.

If the hours worked is less than or equal to “40”, then compute the amount for gross pay.

Otherwise, compute overtime amount and gross pay amount.

Compute the amount for social security tax, income tax, state tax, and net.

If the number of dependents is greater than or equal to “3”, the compute the new net pay amount.

Display the hours worked and its regular pay rate.

If the hours worked greater than “40”, then display the overtime amount.

Display the workers gross pay, social security tax withheld amount, federal income tax withheld amount, and state income tax withheld amount.

If the number of dependents are greater than or equal to “3”, then display the health insurance withheld amount, union dues amount and net take-home pay.

Create the prompt statement for user repeat calculation and read the user option.

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)