11. Study the algorithm shown in Figure 1-14 and then answer the questions. repeat 5 times: get the salesperson's name and sales amount calculate the bonus amount by multiplying the sales amount by 3% print the salesperson's name and bonus amount end repeat Figure 1-14 Algorithm for Exercise 11 e Cengage Learning 2013 a. Which control structures are used in the algorithm? b. What will the algorithm print when the user enters Jake Harrington and 5500 as the salesperson's name and sales amount, respectively? c. How would you modify the algorithm to also print the salesperson's sales amount? d. How would you modify the algorithm so that it can be used for any number of salespeople? e. How would you modify the algorithm to allow the user to enter the bonus rate? The algorithm should then use that rate to calculate the bonus amount.

11. Study the algorithm shown in Figure 1-14 and then answer the questions. repeat 5 times: get the salesperson's name and sales amount calculate the bonus amount by multiplying the sales amount by 3% print the salesperson's name and bonus amount end repeat Figure 1-14 Algorithm for Exercise 11 e Cengage Learning 2013 a. Which control structures are used in the algorithm? b. What will the algorithm print when the user enters Jake Harrington and 5500 as the salesperson's name and sales amount, respectively? c. How would you modify the algorithm to also print the salesperson's sales amount? d. How would you modify the algorithm so that it can be used for any number of salespeople? e. How would you modify the algorithm to allow the user to enter the bonus rate? The algorithm should then use that rate to calculate the bonus amount.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter1: An Overview Of Computers And Programming Languages

Section: Chapter Questions

Problem 18SA: 18. Tom and Jerry opened a new lawn service. They provide three types of services: mowing,...

See similar textbooks

Similar questions

Question-1 Friend's Party Circle: There are a few friends living in the same area. They have a party every weekend and the place of party change each week. It is always a lifficult task to select a place which is nearest for everyone. They advantage of Computer Science to solve this problem. all decided to take Names of friends are Ahmed, Rehman, Careem, Basit, Dawood, Ghani, and Farid. Ahmed lives at 5 minutes' walk from rehman and at 10 minutes' walk from Careem. Careem lives at 3 minutes' walk from Dawood. Rehman lives at 4 minutes' walk from Basit and 2 minutes' walk from Dawood. Dawood lives at two minutes' walk from Farid. Ghani lives at 2 minutes' walk from Basit. a. If we represent a graph G = V (V, E) in which set of vertices are home of each Friend and an edge represents a path between two homes. Provide the adjacency matrix of directed graph of the graph G. b. In above directed graph G. You are required to devise an algorithm to find all possible paths.
Correct answer will be appreciated else downvoted multiple times
Question 4 - Algorithm Design Imagine you are a treasure hunter standing at one side of the river. There are n (a positive integer) stones on the river. They are aligned on a straight line and at the nth stone, there is treasure waiting for you. Your target is to reach the nth stone. For each move, you have the choice of either walking (move one stone ahead) or leaping (move two stones ahead). Also, you are not allowed to travel backwards. Design an algorithm that calculates the number of ways (sequences of walks/leaps) that get you to the treasure stone. You should clearly explain the algorithm and demonstrate the correctness of the algorithm with a complete proof. Here is an example. For n = 1 5, there are 8 ways: Method 1: walk → walk → walk → walk → walk Method 2: walk → walk → walk → leap Method 3: walk → walk → leap → walk Method 4: walk → leap → walk → walk walk Method 5: leap → walk → walk → Method 6: leap → leap walk Method 7: leap → walk → leap Method 8: walk → leap leap
10. The algorithm shown in Figure 1-13 should calculate and print the gross pay for five workers; however, some of the instructions are missing from the algorithm. Complete the algorithm. If an employee works more than 40 hours, he or she should receive time and one-half for the hours worked over 40. read the employee's name, hours worked, and pay rate calculate gross pay = hours worked times pay rate otherwise, do this: calculate regular pay = pay rate times 40 calculate overtime hours = hours worked minus 40 calculate overtime pay = calculate gross pay = end if print the employee's name and gross pay end repeat
Transcribed Image Text A student took four quizzes in a term and would like to compute their average. He also would like to know what will be the remarks. Follow the range of grades and its equivalent remarks, and then fill-up the table below: 100-95 - Excellent 94-90 – Very Satisfactory 89-85 - Satisfactory 84-80 - Fine 79-75 - Fair 74 and below - Poor
Only correct answer will be appreciated else downvoted.
Both Questions 1 and 2 refer to the following algorithm: x = 0 y = 0 DOWHILE x < 2 DOWHILE y < 2 y = y + 1 Print y ENDDO x = x + 1 Print x ENDDO 1/ how many numbers will be printed out aftre executing the above diagram? 2/ what is the fourth number to be printed
Exercise 7 Print out if a number is prime or not from 1 to 10. Challenge (if finished) Take any number and figure out if it is prime or not another challenge on top (if finished). Keep repeating the program until the user says 'q'. I # print out if a number is prime or not from 1 to 10 # Challenge (if finished) # take any number # and figure out if it is prime or not # keep repeating the program until you say q
This problem strategy begins with the result and applies a set of mathematical operations in reverse order to arrive at the answer Trial and error Working backwords Searching for patterns Guess and check
Logic Desgin Take your time in answering the questions. I want to solve questions ( f ) correctly please.
Question 3: Write an algorithm that computes the Body Mass Index (BMI) given the heights and weights of students. The algorithm should first read the total number of students and then read the height and weight of each student to calculate and print the BMI category. A student is considered Underweight if the BMI is less than or equal to 18.5; Normal Weight if between 18.5 and 24.9; Overweight if between 25 and 29.9; and Obese if greater than or equal to 30.
LAB/ Tutorial Chapter 2: Problem Solving Technique Problem statement : Apply the critical steps in problem development in problem solving technique. Find the area of the shaded area (blue) based on the figure below. Length A Length B Width A Width B