Algorithms and data examples to be written:Problem 1: (Hint: Use a sequential structure)How do you calculate the miles you are getting per gallon of gasoline if you record the mileage readingsfrom your car's odometer each time you fill up the gas tank? Two odometer readings should beinputted, one reading is before you fill up the gas tank, and the second reading is when you refill the gastank. The third input is the quantity of gallons of gasoline purchased when the gas tank is refilled. Afterinputting these 3 values, calculate and output:The miles traveled between gas refillsThe average miles per gallon based on the miles traveled and the amount of gasoline purchasedafter the time the gas tank is refilleda.b.Algorithm:Data Example:Problem 2: (Hint: Use a sequential structure)How do you calculate the price you would pay for an item if it is on sale and you have an additionaldiscount coupon? To calculate the final price paid, 3 inputs are needed: the original price of the item,the percent off because the item is on sale, and the discount percent of the discount coupon. Determineand output all of the following:The amount deducted from the original price of the item due to the item being on saleThe price of the item after the sales percent discount is subtractedThe amount of additional discount based on the discount couponThe final price paid after the discount from the coupon is subtracted from the sale pricea.b.с.d.Algorithm:C.

The given problem is related to alrogithm development where the user will provide the inputs to the…

Algorithms and data examples to be written: Problem 1: (Hint: Use a sequential structure) How do you calculate the miles you are getting per gallon of gasoline if you record the mileage readings from your car's odometer each time you fill up the gas tank? Two odometer readings should be inputted, one reading is before you fill up the gas tank, and the second reading is when you refill the gas tank. The third input is the quantity of gallons of gasoline purchased when the gas tank is refilled. After inputting these 3 values, calculate and output: The miles traveled between gas refills The average miles per gallon based on the miles traveled and the amount of gasoline purchased after the time the gas tank is refilled a. b. Algorithm: Data Example: C.

Algorithms and data examples to be written: Problem 1: (Hint: Use a sequential structure) How do you calculate the miles you are getting per gallon of gasoline if you record the mileage readings from your car's odometer each time you fill up the gas tank? Two odometer readings should be inputted, one reading is before you fill up the gas tank, and the second reading is when you refill the gas tank. The third input is the quantity of gallons of gasoline purchased when the gas tank is refilled. After inputting these 3 values, calculate and output: The miles traveled between gas refills The average miles per gallon based on the miles traveled and the amount of gasoline purchased after the time the gas tank is refilled a. b. Algorithm: Data Example: C.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter5: Control Structures Ii (repetition)

Section: Chapter Questions

Problem 27PE

See similar textbooks

Similar questions

Instructions The program in the Programming Example: Fibonacci Number does not check: Whether the first number entered by the user is less than or equal to the second number and whether both the numbers are nonnegative. Whether the user entered a valid value for the position of the desired number in the Fibonacci sequence. Rewrite that program so that it checks for these things. NOTES: If an invalid number is entered for case 1 above, prompt the user to enter both numbers again. If an invalid number is entered for case 2, prompt the user to enter a value until a valid value is entered. the code: #include <iostream> using namespace std; int main() { //Declare variables int previous1; int previous2; int current; int counter; int nthFibonacci; cout << "Enter the first two Fibonacci numbers: "; //Step 1 cin >> previous1 >> previous2; //Step 2 cout << endl; //verify the first two values if(previous1<0 && previous2>0)…
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.
Standard Voltage Classification The Philippine Grid Code and Philippine Distribution Code define the following voltage levels: Low Voltage: a voltage level not exceeding 1kV Medium Voltage: exceeding 1 kV up to 34.5 kv High Voltage: exceeding 34.5 kV up to 230 kV Extra High Voltage: exceeding 230 kV up to 765 kv Ultra High Voltage: exceeding 765 kV (assumed) Make a Matlab program that will ask the user to input a voltage value in kV and the program will classify it according to the standard voltage classification Sample Output: >>voltlvl Input a voltage value in kV: 138 138 kV is a high voltage level
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
Problem Statement for Picture Frame Program A piece of wire is to be bent in the form of a rectangle to put around a picture frame. The length of the picture frame is 1.5 times the width. Write a program that asks the user to enter the length of the wire and outputs the length and width of the picture frame. Part 1. Understand the ProblemThe problem gets the length of the wire for the frame from the user. The ratio of length to width of the frame is a constant (1.5). The length and width of the picture frame that are to be calculated and displayed. The length of wire represents the perimeter of the rectangular picture frame. The equation for the perimeter of a rectangle is: Perimeter = 2 * (length + width) This is an equation with two unknowns, but the ratio of the lengthto the width (length = ratio * width) so substitute for length in the perimeter equation and solve for width: Perimeter = 2 * (ratio * width + width) ratio * width + width = Perimeter / 2 width * (ratio + 1) =…
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
Problem 2: Multiple stages There are only two rest days in the Tour de France. You will now write a program to calculate the remaining distance before the rest day after each stage. Riders will rest after they finish the fifth stage.Your program will read five distances AS INTEGERS, one for each stage in order. After, you will read the total time of all five days. You will then print how many kilometres are left after each stage and the rider's average speed (in km/h) after all inputed stages, according to the example below.InputYou will read from the use the following (in order):• 5 distances one of each stage• The rider's total time across all stagesOutputEnd of first stage, {distance}km left until rest dayEnd of second stage, {distance}km left until rest dayEnd of third stage, {distance}km left until rest dayEnd of fourth stage, {distance}km left until rest day--REST--Average speed across the five days: {speed} km/hExample:Input Output…
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
Text Book: Starting Out with Programing Logic & Design 5 edition Write a program that will take in basic information from a student, including student name, degree name, number of credits taken so far, and the total number of credits required in the degree program. The program will then calculate how many credits are needed to graduate. Display should include the student name, the degree name, and credits left to graduate. Step 1: Examine the following algorithm. (Reference: Designing a Program, page 31). Get the student name. Get the degree program name. Subtract the number of credits taken so far from the required credits for the degree. Get the number of credits required for the degree program. Get the number of credits the student has taken so far. Display the input information in Step 1 and 2. Display the calculated information. Step 2: What logic error do you spot and how would you fix it? Step 3: What steps require user interaction (Ex: user must type in some…
Text Book: Starting Out with Programing Logic & Design 5 edition Write a program that will take in basic information from a student, including student name, degree name, number of credits taken so far, and the total number of credits required in the degree program. The program will then calculate how many credits are needed to graduate. Display should include the student name, the degree name, and credits left to graduate. Step 1: Examine the following algorithm. (Reference: Designing a Program, page 31). Get the student name. Get the degree program name. Subtract the number of credits taken so far from the required credits for the degree. Get the number of credits required for the degree program. Get the number of credits the student has taken so far. Display the input information in Step 1 and 2. Display the calculated information. Step 3: What steps require user interaction (Ex: user must type in some input)?
Question-1 Using Python 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 difficult task to select a place which is nearest for everyone. They all decided to take advantage of Computer Science to solve this problem. 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. 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. In above directed graph G. You are required to devise an…
Background: Game Rules The rules to the (dice) game of Pig:  You will need 2 dice.  To Play: a. The players each take turns rolling two die. b. A player scores the sum of the two dice thrown (unless the roll contains a 1): If a single number 1 is thrown on either die, the score for that whole turn is lost (referred to as “Pigged Out”). A 1 on both dice is scored as 25. c. During a single turn, a player may roll the dice as many times as they desire. The score for a single turn is the sum of the individual scores for each dice roll. d. The first player to reach the goal score wins unless a player scores higher subsequently in the same round. Therefore, everyone in the game must have the same number of turns. Execution and User Input This program is quite interactive with the user(s) and will take in the following information; please review the sample input / output sessions for details; we describe them again here emphasizing input. The program will prompt for the number of…