Take 5 numbers from the user. Sum the first 4 numbers and subtract the last number from sum. Then, output both the answers (sum and subtraction). After output, take an average of all five numbers and output the average too. Then, check if average is greater than 7 then do a "postfix increment" in sum, otherwise do a "prefix decrement" in subtraction. Part-1: Draw the flowchart of the above written problem statement. Part-2: Write a C++ code according to the flowchart you have made in Part-1.

Take 5 numbers from the user. Sum the first 4 numbers and subtract the last number from sum. Then, output both the answers (sum and subtraction). After output, take an average of all five numbers and output the average too. Then, check if average is greater than 7 then do a "postfix increment" in sum, otherwise do a "prefix decrement" in subtraction. Part-1: Draw the flowchart of the above written problem statement. Part-2: Write a C++ code according to the flowchart you have made in Part-1.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 10PE

See similar textbooks

Similar questions

This Code print the first occurrences of x, Please Modify the code to print the last occurrences of x and print how many times it exists? ( with explanation for each line if possible) many thanks.
Q1 - write down an algorithm for each of the following problems:-1) Find the average of four numbers.2) Change the time in seconds to minutes.3) Find the product of two numbers (this means to multiply the two numbers),4) Find the difference between two numbers5) Change a volume in pints to litres (there are 2.2 pints in every litre).6) Find the average speed of a car given the journey time and the distancetravelled.7) Find the volume of a cube given the length of a side.8) Find the volume of a pyramid, given the length and width of its base and itsheight
int f(int &k){k++;return k * 2;}int main(){int i = 1, j = -1;int a, b, c;a = f(i) + i/2;b = j + f(j) + f(j);c = 2 * f(j);return 0;} What are the values of a, b and c id the operands in the expressions are evaluated from left to right and then what are the values when its evaluated right to left?
09. FizzBuzz problem:- Write a program which return "fizz" if the number is a multiplier of 3, return "buzz" if its multiplier of 5 and return "fizzbuzz" if the number is divisible by both 3 and 5. If the number is not divisible by either 3 or 5 then it should just return the number itself?.
Assume that start and end are integers.Return the average all of the numbers from start to end inclusive.For example,average(3, 5) returns 4.0, since (3 + 5) / 2 = 4
Find the numbers that can be expressed as the product of two nonnegative integers in succession and print them in increasing order. For each number found the program should check whether the number is a multiple of 5 and indicate this in the output. (For example, 30 is such a number as it can be written as the product of 5 and 6 (30=5x6), which are two numbers in succession.) The user should specify how many such numbers they want to print.
In C++, Write a program that asks the user to enter two numbers, obtains the two numbers from the user and prints the sum, product, difference, and quotient of the two numbers.
1. Write a an algorithm that asks the user to input a positive integer n and counts how many of the squares of the integers from 1 to n end in a 1.2. Write a an algorithm that asks the user to input a positive integer n and counts how many of the squares of the integers from 1 to n end in a 4 and how many end in a 9.
This Code print the first occurrences of x, Modify the code to print the last occurrences of x and print how many times it exists? ( with explanation for each line if possible) many thanks.
Twin primes are two primes that differ by 2 (e.g., 3 and 5, 101 and 103). Write a ++ program that outputs all twin primes less than 1000 and the total count.
Find the numbers that can be written as the product of two nonnegative odd integers in succession and print them in increasing order. For each number found the program should check whether the number is a factor of a number chosen by the user and indicate this in the output. (For example, 35 is such a number as it can be written as the product of 5 and 7 (35=5x7), which are two odd numbers in succession). The user should specify how many such numbers they want to print, starting from a minimum value
answer will always be 84, debug and fix the problem without altering the program.