C++ output payroll report

Repeatedly prompt the user to determine whether or not there is data pertaining to an employee to be input. (Program should work for 0 or more employees.) If the user responds in the affirmative, the program prompts for each of the input data items for a single employee; the user responds in the negative when there is no more employee data to be processed. For each employee you are to compute the number of overtime hours worked by that employee, the salary, and the overtime pay. An employee earns straight time for the first forty hours of work, time-and-a-half for up to the first 10 hours in excess of 40 hours, and double-time for any additional hours. One report detail line should... click for more

Thory Computation Consider a vending machine that accepts nickels, dimes and quarters. 1. Give an implicit definition of the set of all strings whose value mod 30 = 0. 2. Give recursive definition of the set of all strings whose value = 30 cents.

Problem: Consider a vending machine that accepts nickels, dimes and quarters. 1. Give an implicit definition of the set of all strings whose value mod 30 = 0. 2. Give recursive definition of the set of all strings whose value = 30 cents.

Consider a vending machine that accepts nickels, dimes and quarters. Propose a regular expression for 0, 1, 5, ...

see attached file

This C++ program reads in information about a list of books from the keyboard, stores the information in an array of structure, displays it on the screen, count the number of books that cost less than $10, sort all books by Code, and search the list for a book given its code. The information about a book includes its code (an integer value) and price (a floating point value). Code 9999 serves as a sentinel value indicating the end of input.

see attached file

Among other things, a binary search tree can be used for sorting data elements. This project is to randomly generate a sequence of integer numbers, insert the first 20 distinct numbers into a binary search tree, and finally produce an in-order listing of the tree.

Among other things, a binary search tree can be used for sorting data elements. This project is to randomly generate a sequence of integer numbers, insert the first 20 distinct numbers into a binary search tree, and finally produce an in-order listing of the tree. You are provided with the declarations and two functions for binary search trees (see the appended). One of the functions is Insert that adds a new element to a binary search tree. And the other is a lookup which checks if a given element is already in a binary search tree. In this project, you need to define a print function that prints tree elements in in-order as well as a count function that counts and returns the number of tr... click for more