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

1.) Consider the problem of determining whether a DFA and a regular expression are equivalent. Express this problem as a language and show that it is decidable. ii) Let ALLDFA = {(A)| A is a DFA and L(A) = "}. Show that ALLDFA is decidable. iii) Let AECFG = {(G)| G is a CFG that generates &}. Show that AECFG is decidable. iv) Let ETM {(M)| M is a TM and L(M) = 0}. Show that ETM, the complement of Erm, is Turing-recognizable. Let X be the set {1, 2, 3, 4, 5} and Y be the set {6, 7, 8, 9, 10). We describe the functions f: XY and g: XY in the following tables. Answer each part and give a reason for each negative answer. n f(n) n g(n) 1 6 1 10 2 7 2 9 3 6 3 8 4 7 4 7 5 6 5 6 Aa. Is f one-to-one? b. Is fonto? c. Is fa correspondence? Ad. Is g one-to-one? e. Is g onto? f. Is g a correspondence? vi) Let B be the set of all infinite sequences over {0,1}. Show that B is uncountable using a proof by diagonalization.

Can you find the least amount of different numbers to pick from positive numbers (integers) that are at most 100 to confirm two numbers that add up to 101 when each number can be picked at most two times?

Can you find the formula for an that satisfies the provided recursive definition? Please show all steps and justification