Write an algorithm that reads from the user several lines of input. Each line includes a student's name and his/her GPA (as a real number). The algorithm should calculate and print the highest GPA and name of the student who has achieved it. Hints: · You could assume that the user will insert valid data and at least one student. · You could assume that all students have distinct GPAS. · User could stop the program via entering the word "stop" as a student's name. · The input and output of your program should be exactly as in the sample below. Sample Input and Output: In each line, insert a student's name and his/her GPA To halt the algorithm, insert "stop" as a student's name Output from the program Areej 3.11 Soha 2.50 Maher 3.68 Input from the user Taher 2.93 stop Maher has the highest GPA, which is 3.68 Output from the program

Write an algorithm that reads from the user several lines of input. Each line includes a student's name and his/her GPA (as a real number). The algorithm should calculate and print the highest GPA and name of the student who has achieved it. Hints: · You could assume that the user will insert valid data and at least one student. · You could assume that all students have distinct GPAS. · User could stop the program via entering the word "stop" as a student's name. · The input and output of your program should be exactly as in the sample below. Sample Input and Output: In each line, insert a student's name and his/her GPA To halt the algorithm, insert "stop" as a student's name Output from the program Areej 3.11 Soha 2.50 Maher 3.68 Input from the user Taher 2.93 stop Maher has the highest GPA, which is 3.68 Output from the program

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 11PE: The program in the Programming Example: Fibonacci Number does not check whether the first number...

See similar textbooks

Similar questions

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 non-negative. Also, the program does not check 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.
Write an algorithm that lets the user enter several items prices (number of items is unknown)(when the user finishes he must enter - 1)then this algorithm computes and prints the following: -- Average price -- Highest and lowest price How many prices are above 100 -- How many prices are between 50 and 150
Write and implement an algorithm that gets the amount of electricity used in kilowatt-hours and the cost of electricity per kilowatt-hour. Its output is the total amount of the electric bill, including an 8% sales tax. Write your answer to the following as multiple line comments at the beginning of your program.1. What are the data requirements of your program?2. Outline your algorithm using a pseudocode.
odify the guessing-game program so that the user thinks of a number that the computer must guess. The computer must make no more than the minimum number of guesses, and it must prevent the user from cheating by entering misleading hints. Use I'm out of guesses, and you cheated and Hooray, I've got it in X tries as your final output. (Hint: Use the math.log function to compute the minimum number of guesses needed after the lower and upper bounds are entered.) this is what I got so far: ============================================ import random import math smaller = int(input("Enter the smaller number: ")) larger = int(input("Enter the larger number: ")) maxattempt = math.ceil(math.log(larger - smaller)) count = 0 while count != maxattempt: count += 1 guess = int((smaller + larger) / 2) print(smaller, larger) print("Your number is: ", guess) hlp = input("Enter =, <, or >: ") if hlp == '>': smaller = guess + 1 elif hlp == '<':…
Homework write a program that will add the terms of an infinite geometric series. The program should read the first term (a) and the common ratio (r) for the series. It should the compute the sum in two ways: by formula (s=a/1-r), and by adding the individual terms until the answer agrees with the formula to 7 significant digits. The print the formula answer, the answer found by adding terms, and the number of terms that were added. Print the sums to at least ten places. Verify input with a while loop. Two real values are equal to n significant digits if the following condition is true: |a-b|<|a*10^-n| Wrong test - this won't work if r is very near one. Try a=2, r=.99999 With smaller values of r, it is asking for too much precision. With a=2,r=.99, it is getting 10 significant digits. HELP ME FIX CODE. PLEASE USE MY CODE FIX #include <iostream>#include <cmath>using namespace std; int main(){ //declare variables int terms; double a, r, number, sumbyformula, sum2;…
Homework write a program that will add the terms of an infinite geometric series. The program should read the first term (a) and the common ratio (r) for the series. It should the compute the sum in two ways: by formula (s=a/1-r), and by adding the individual terms until the answer agrees with the formula to 7 significant digits. The print the formula answer, the answer found by adding terms, and the number of terms that were added. Print the sums to at least ten places. Verify input with a while loop. Two real values are equal to n significant digits if the following condition is true: |a-b|<|a*10^-n| HELP ME FIX MY CODE comment in the picture. #include <iostream>#include <cmath>using namespace std; int main(){ int i = 1;double a, b, r, number, sumbyformula, sum2;cout<<"Enter a value of first term a: ";cin>>a;cout<<"Enter a value of ratio r: ";cin>>r;// Loop -1<r<1while(r>=1 and r<=-1){cout<< "Enter the number between -1 and 1…
The following pseudocode works, but it performs a case-sensitive validation of the user’s input. How could the algorithm be improved so the user does not have to pay attention to capitalization when entering a name? // This program asks the user to enter a string // and validates the input. Declare String choice // Get the user's response. Display "Cast your vote for Chess Team Captain." Display "Would you like to nominate Lisa or Tim?" Input choice // Validate the input. While choice != "Lisa" AND choice != "Tim" Display "Please enter Lisa or Tim." Display "Cast your vote for Chess Team Captain." Display "Would you like to nominate Lisa or Tim?" Input response End While
Write an algorithm that accepts a 2-digit number ranging from 20 to 99 and display all pair of 2-digit combinations that will sum up to your input.For example, let's assume that the user entered a 25, the algorithm should be able to display the following:15+10, 14+11, 13+12the positioning of these numbers doesn't make a difference so, if 15+10 is displayed, you don't have to display 10+15.HINT: There is a pattern on how the left digit is decremented and the right digit is incremented by 1.
Write an algorithm that asks the user to enter 10 test scores and do the following:(a) Print out the highest and lowest scores.(b) Print out the average of the scores.(c) Print out the second largest score.(d) If any of the scores is greater than 100, then after all the scores have been entered, print a message warning the user that a value over 100 has been entered.(e) Drop the two lowest scores and print out the average of the rest of them.
Please assist me with these questions.(for the 1st part just complete the bolded area. All other areas have been completed. Then complete the 2nd part 1. Devise an algorithm to receive a positive number, n, and output all prime numbers that are smaller than n and have the digit 5. For example, if n is 100, the program should output 5, 53 and 59. Your solution should have a main algorithm and two sub-algorithms, let's call them prime(num) and has5(num). Trace your algorithm and sub-sub-algorithm for the input 15. You should provide pre- and post-conditions for all your 3 (sub)algorithms. Now, let's trace this algorithm for the input n = 15: For i = 2 to 14, we check if i is prime and if i contains the digit 5. The prime numbers less than 15 are 2, 3, 5, 7, 11, 13. Among these, only 5 contains the digit 5. So, the output for n = 15 is [5]. 2. I also need help with creating JavaScript code for the flowchart provided below. Note: You will have to implement several functions that…
Write a program that consists of the following algorithm: num1 =4, num2= 4* 5-11, sale = 0.02 * 1000, first =‘D’, str = “It is a sunny day”. .Your program has to display the results for num1, num2, sale, first and string.
Write a program that invites the user to enter two numbers: a dividend (the top number in a division) and a divisor (the bottom number). It then calculates quotient and remainder using / and % operator and displays the result. After one iteration it asks user whether he/she wants to do more (Y/N). (C++ show input and output as well)