6.10 (Sales Commissions) Use a single-subscripted array to solve the following problem: A pharmaceutical company pays its medical representatives (MRs) on a commission basis. The MRs receive a fixed salary of $1000 per month plus 6% of their gross sales for that month. For example, a MR who grosses $15,000 in sales in a month receives $1000 plus 6% of $15,000, or a total of $1900. Write a C program (using an array of counters) that determines how many of the MRs earned commissions in each of the following ranges (assume that each MR's commission is truncated to an integer amount):

6.10 (Sales Commissions) Use a single-subscripted array to solve the following problem: A pharmaceutical company pays its medical representatives (MRs) on a commission basis. The MRs receive a fixed salary of $1000 per month plus 6% of their gross sales for that month. For example, a MR who grosses $15,000 in sales in a month receives $1000 plus 6% of $15,000, or a total of $1900. Write a C program (using an array of counters) that determines how many of the MRs earned commissions in each of the following ranges (assume that each MR's commission is truncated to an integer amount):

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter9: Records (struct)

Section: Chapter Questions

Problem 12SA

See similar textbooks

Similar questions

14.12 NVCC Lab: Count number of subsets of a graph A graph is made up of a set of nodes called vertices and a set of lines called edges that connect the nodes. Informally, a connected component of a graph is a subset in which each pair of nodes is connected with each other via a path. For example, the following graph consists of two connected components (subsets). For this assignment, you are required to find out the number of connected components in a graph as specified below: implement the following method: public static int countConnectedComponents(String fileName): where fileName is the input data file representing a graph: each line in the data file contains two numbers representing a pair of vertices that are connected (an edge between these two nodes exists). For example, given the following data file: 1 2 1 3 2 3 4 5 6 8 6 7 *Code must be written in JAVA
May I get the solution of the attached exercise, I am stuck
Java script
5.16 LAB: Cryptographic Hashing Algorithms Encryption methods, such as the Caesar Cipher encryption, allow us to encrypt and decrypt text using a special key. Another method of encrypting text / passwords is called hashing. Hashing uses special algorithms to 'scramble' the text, which is tougher to be hacked. The hash function can take numbers, letters, and symbols as input, then the function applies one of the special algorithms to output the scrambled text. The longer the output string is, the harder to hack the hashed data. The difference between hashing and the Caesar Cipher encryption is that one cannot 'decrypt' a hashed data to its original text. Since a hashed data cannot be decrypted, a user must enter the original text, which will be hashed by the program. Then the program compares the hashed value with the hashed data stored previously for the original text. A salt is used, at times, to create a random sequence that is added to the original text before using the hashing…
5.15 LAB: Hacking Ciphers The Caesar Cipher Algorithm was introduced in Week #1. Encryption is the act of encoding a message with the intent of allowing only authorized people the knowledge of how to read that message. An encrypted message can be decoded, allowing the secured content to be read after decryption. Recall that the Caesar Cipher uses alphabets as the primary source of information but shifted a certain number of letters to the left or right as a key to create the encrypted data. The Caesar Cipher is easily hacked because of the simple technique used to build the key that encrypts and decrypts the data. In this lab, the key is the number of alphabets shifted, and the direction is always toward the increasing alphabetical order. This provides 26 ways of encrypting a message and therefore makes it easier to be hacked by guessing the key within the range of 0 - 25. Write the function caesar_hack( ) that takes three parameters: a Caesar Cipher encrypted message, an alphabet…
5.3 Simultaneous Equations III Write the following sets of simultaneous equations in matrix form and solve the new equations (if possible): 3x₁ + 1x2 + 5x3 a. 2x₁ + 3x2 − 1x3 b. C. = 6x₁ + 2x2 + 8x3 X₁ + 3x2 + 4x3 = -1x₁ + 4x₂ = = = 5x1 + 6x2 + 2x3 4y1 + 2y2 + Y3 + 5y4 3y₁ + y2 + 4y3 + 7y4 2y₁ + 3y2 + y3 + 6y4 3y1 + y2 + Y3 + 3y4 20, 5, 7. 14, 5, = 7. = = = = 52.9 74.2, 58.3, 34.2.
I've been stuck on this for over an hour. Please, can I get some help with this?
6.19 LAB: Leap year - functions A common year in the modern Gregorian Calendar consists of 365 days. In reality, Earth takes longer to rotate around the sun. To account for the difference in time, every 4 years, a leap year takes place. A leap year is when a year has 366 days. An extra day, February 29th. The requirements for a given year to be a leap year are 1) The year must be divisible by 4 2) If the year is a century year (1700, 1800, etc.), the year must be evenly divisible by 400, therefore, both 1700 and 1800 are not leap years Some example leap years are 1600, 1712, and 2016. Write a program that takes in a year and determines the number of days in February for that year Ex. If the input is 1712 the output is 1712 has 29 days in February. Ex If the input is 1913 the output is 1913 has 28 days in February. Your program must define and call the following function. The function should return the number of days in February for the input year. def days in feb(user_year)
6.23 LAB: Leap year - functions A year in the modern Gregorian Calendar consists of 365 days. In reality, the earth takes longer to rotate around the sun. To account for the difference in time, every 4 years, a leap year takes place. A leap year is when a year has 366 days: An extra day, February 29th. The requirements for a given year to be a leap year are: 1) The year must be divisible by 4 2) If the year is a century year (1700, 1800, etc.), the year must be evenly divisible by 400 Some example leap years are 1600, 1712, and 2016. Write a program that takes in a year and determines whether that year is a leap year. Ex: If the input is: 1712 the output is: 1712 is a leap year. Ex: If the input is: 1913 the output is: 1913 is not a leap year. Your program must define and call the following function. The function should return True if the input year is a leap year or False otherwise.def is_leap_year(user_year) Use Python, please.
3.6 LAB: Number pattern Write a recursive function called print_num_pattern() to output the following number pattern. Given a positive integer as input (Ex: 12), subtract another positive integer (Ex: 3) continually until 0 or a negative value is reached, and then continually add the second integer until the first integer is again reached. For coding simplicity, output a space after every integer, including the last. Do not end output with a newline. Ex. If the input is: 12 3 the output is: 12 9 6 3 0 3 6 9 12
3.6 LAB: Number pattern Write a recursive function called print_num_pattern() to output the following number pattern. Given a positive integer as input (Ex: 12), subtract another positive integer (Ex: 3) continually until 0 or a negative value is reached, and then continually add the second integer until the first integer is again reached. For coding simplicity, output a space after every integer, including the last. Do not end output with a newline Ex. If the input is: 12 3 the output is 12 9 6 3 0 3 6 9 12 0/10 LAB ACTIVITY 3.6.1: LAB: Number pattern main.py Load default template 1. TODO: Write recursive print_num_pattern() function 2 3 if name "main": 4 numi int(input()) 5 num2 int(input()) print_num_pattern(num, num2)
8.13 LAB: Library book sorting Two sorted lists have been created, one implemented using a linked list (LinkedListLibrary linkedListLibrary) and the other implemented using the built-in Vector class (VectorLibrary vectorLibrary). Each list contains 100 books (title, ISBN number, author), sorted in ascending order by ISBN number. Complete main() by inserting a new book into each list using the respective LinkedListLibrary and VectorLibrary InsertSorted() methods and outputting the number of operations the computer must perform to insert the new book. Each InsertSorted() returns the number of operations the computer performs. Ex: If the input is: The Catcher in the Rye 9787543321724 J.D. Salinger the output is: Number of linked list operations: 1 Number of vector operations: 1 Which list do you think will require the most operations? Why? Main.cpp: #include "LinkedListLibrary.h"#include "VectorLibrary.h"#include "BookNode.h"#include "Book.h"#include <fstream>#include…