Programming and Problem Solving With C++
6th Edition
ISBN: 9781449694265
Author: Nell Dale
Publisher: Jones & Bartlett Learning
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 1, Problem 5CSF
Program Plan Intro
To modify the leap year
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
The greatest common divisor of two positive integers, A and B, is the largest number that can be evenly divided into both of them. Euclid's algorithm can be used to find the greatest common divisor (GCD) of two positive integers. You can use this algorithm in the following manner:
1. Compute the remainder of dividing the larger number by the smaller number.
2. Replace the larger number with the smaller number and the smaller number with the
remainder.
3. Repeat this process until the smaller number is zero.
The larger number at this point is the GCD of A and B. Write a program that lets the user enter two integers and then prints each step in the process of using the Euclidean algorithm to find their
GCD.
An example of the program input and output is shown below:
Enter the smaller number: 5
Enter the larger number: 15
The greatest common divisor is 5
Max Jones belongs to a CD (compact disc) club that allows him to buy CDs at a much lower price than his local music store charges. He wants to know how much he saves by buying all of his CDs through the club rather than through the music store. The output is the savings. The input is the number of CDs purchased, the club CD price, and thestore CD price. The algorithm should use two processing items: one for the cost of buying the CDs through the club, and the other for the cost of buying the CDs through the store. Write the algorithm using pseudocode.
You have two numbers ABCD and WXYZ (ex: 2345 and 7965). Write an algorithm using Pseudocode that decides whether ABCD is the inverse of WXYZ. (For example, if ABCD is 2356 and WXYZ is 6532 then the algorithm prints "Inverse" otherwise it will print "Not Invers")
Chapter 1 Solutions
Programming and Problem Solving With C++
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- The larger number at this point is the GCD of A and B. Write a program that lets the user enter two integers and then prints each step in the process of using the Euclidean algorithm to find their GCD.arrow_forwardWrite an algorithm that takes in two numbers and swaps their values without using a third variable.arrow_forwardFind the first 10 square numbers that are greater than Long.MAX_VALUE. A square number is a number in the form of n2. For example, 4, 9,and 16 are square numbers. Find an efficient approach to run your program fast.arrow_forward
- The area A of a Hemisphere is computed using the following equation. A = 4TTr2 %3D where n=3.14159265 and r is the radius. Write an algorithm (Step 4 of problem solving methodology) that reads a radius r from a user then computes the area A using the above-mentioned formula. The algorithm repeats the same process for five positive radius values. [Hint: use any repetition structure]arrow_forwardالسؤال الثاني 5 نقاط Q2/ Write an algorithm to which generates even numbers between 1030 and 3300 and then prints them in the standard output. It should also print total sum and ?averagearrow_forwardWrite an Algorithm that will read the student name and student id, the algorithm will Print the student name and student id, each in separate line. print the count of number of characters in student name (The space is calculated as character) Check the student ID last two digit, if last two digits are even numbers or odd numbers for the student ID which categorized as even, print the summation of odd number inside the student id, and print the count for the even number inside the entered student ID. The student ID which have an odd number in last two digit, print “the last two digits in student ID is odd numbers”. print the summation of even number inside the student id print the count for the odd numbers inside the enter student ID. Example Mohammed Ali Abdullah 1135728 Student Name: Mohammed Ali Abdullah Student ID: 1135728 number of characters: 21 The last two digits in student ID are even numbers The summation of odd numbers is 17 The count of odd numbers is 5arrow_forward
- Which one of the following can NOT be used as the basic operation? Assignment Comparison Division Function callarrow_forwardThe course grades of 75 students from 5 courses are given in the form of a table. Write an algorithm that writes "cannot be entered" for those with an average of less than 40 course grades, and "can be entered" for 40 and above. (Please explain everything the program in details and please check whether the program runs or not by using q-basic64. 01:44arrow_forwardEulers number e is used as the base of natural logarithm. It may be approximated using the formula e=1/0!+1/1!+1/2!…1/(n-1)!+1/n! When n is sufficiently large. Write a program that approximates e using a loop that terminates when the difference between the two successive values of e is less than 0.0000001.arrow_forward
- Re-write the algorithm below so that it correctly solves the problem. Briefly explain the error and the correction. Problem Create an algorithm that will calculate the average of a group of numbers that are input and print the average. Calculate_Average 1 Get num1, num2, num32 sum = num1 - num2 + num33 average = sum/44 print averagearrow_forwardDescription Xiao Zhang is often distressed because there are too many things to arrange. Now he has n tasks at hand, and each task has a starting times, and an ending time e;. To complete a task, he must do it from the starting time to the ending time, and Xiao Zhang can only perform one task at the same time. Xiao Zhang wants to know how many tasks he can accomplish at most. Input The first line is an integer n (1sns300000), indicating the number of tasks Xiao Zhang has at hand. In the next n lines, each line contains two integers s₁, e¡ (1≤s;arrow_forwardCalculate the number of ways to get from A to B moving right and down only.arrow_forwardarrow_back_iosSEE MORE QUESTIONSarrow_forward_ios
Recommended textbooks for you
- C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage LearningC++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology PtrEBK JAVA PROGRAMMINGComputer ScienceISBN:9781337671385Author:FARRELLPublisher:CENGAGE LEARNING - CONSIGNMENT
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Computational Software for Intelligent System Design; Author: Cadence Design Systems;https://www.youtube.com/watch?v=dLXZ6bM--j0;License: Standard Youtube License