Java: An Introduction to Problem Solving and Programming (7th Edition)
7th Edition
ISBN: 9780133766264
Author: Walter Savitch
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 1, Problem 16E
Suppose that you have a number x that is greater than 1. Write an
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Write an algorithm that reads 10 integer numbers and calculates the average for numbers that are divisible by 5.
A formula for finding the greatest common divisor (GCD) of two numbers was formulated by the mathematician Euclid around 300 BCE. The GCD of two numbers is the largest number that will divide into both numbers without any remainder. For example, the GCD of 12 and 16 is 4, the GCD of 18 and 12 is 6.The basic algorithm is as follows:Assume we are computing the GCD of two integers x and y. Follow the steps below:1. Replace the larger of x and y with the remainder after (integer) dividing the larger number by the smaller one.2. If x or y is zero, stop. The answer is the nonzero value.3 If neither x nor y is zero, go back to step 1.Here is an example listing the successive values of x and y:
x y135 20 %(135 / 20) = 15 15 20 %(20 / 15) = 5 15 5 %(15 / 5) = 0 0 5 GCD = 5
Write a recursive method that finds the GCD of two numbers using Euclid’s algorithm.
public class Arithmetic{ public static int gcd(int a, int…
You have N magical bags of candies in front of you. The ith bag has A; candies in it. It takes
you one minute to finish a bag of candies, no matter how many candies are in it. Every time you
finish a bag with X candies in it, the bag is magically replenished with X/2 (rounded down to
the nearest integer) more candies. Write an algorithm that determines the maximum number
of candies you can eat in K minutes. Also determine the time complexity of your algorithm in
the worst case situation.
The input is a sequence of integers. The first integer N is the number of bags. The next integer
K is the number of minutes you have. The next N integers is the number of candies in the
bags. The output of your program is a single integer which represents the maximum number
of candies you can eat.
If the input is 5 3 2 1 7 4 2. the output would be 14.
Chapter 1 Solutions
Java: An Introduction to Problem Solving and Programming (7th Edition)
Ch. 1.1 - What are the two kinds of memory in a computer?Ch. 1.1 - What is software?Ch. 1.1 - What data would you give to a program that...Ch. 1.1 - What data would you give to a program that...Ch. 1.1 - What is the difference between a program written...Ch. 1.1 - Is Java a high-level language or a low-level...Ch. 1.1 - Is Java bytecode a high-level language or a...Ch. 1.1 - What is a compiler?Ch. 1.1 - What is a source program?Ch. 1.1 - What do you call a program that translates Java...
Ch. 1.2 - What would the following statement, when used in a...Ch. 1.2 - Write a statement or statements that can be used...Ch. 1.2 - Prob. 13STQCh. 1.2 - What is the meaning of the following line in the...Ch. 1.2 - Write a complete Java program that uses system....Ch. 1.2 - Suppose you define a class named YourClass in a...Ch. 1.2 - Prob. 17STQCh. 1.3 - What is a method?Ch. 1.3 - Prob. 19STQCh. 1.3 - Do all objects of the same class have the same...Ch. 1.3 - Prob. 21STQCh. 1.3 - Prob. 22STQCh. 1.3 - Prob. 23STQCh. 1.3 - Prob. 24STQCh. 1.3 - What is an algorithm?Ch. 1.3 - What is pseudocode?Ch. 1.3 - Prob. 27STQCh. 1.3 - Prob. 28STQCh. 1.3 - Prob. 29STQCh. 1.3 - Prob. 30STQCh. 1.3 - Prob. 31STQCh. 1.3 - Suppose you write a program that is supposed to...Ch. 1.4 - Prob. 33STQCh. 1.4 - Prob. 34STQCh. 1 - How does a computers main memory differ from its...Ch. 1 - Prob. 2ECh. 1 - Prob. 3ECh. 1 - How does machine language differ from Java?Ch. 1 - What would the following statements, when used in...Ch. 1 - Write a statement or statements that can be used...Ch. 1 - Write statements that can be used in a Java...Ch. 1 - Given a persons year of birth, the Birthday Wizard...Ch. 1 - Write statements that can be used in a Java...Ch. 1 - Prob. 11ECh. 1 - Prob. 12ECh. 1 - Prob. 13ECh. 1 - Prob. 14ECh. 1 - What attributes and behaviors would an object...Ch. 1 - Suppose that you have a numberxthat is greater...Ch. 1 - Prob. 17ECh. 1 - Prob. 18ECh. 1 - Prob. 19ECh. 1 - Prob. 20ECh. 1 - Obtain a copy of the Java program shown in Listing...Ch. 1 - Modify the Java program described in Practice...Ch. 1 - Prob. 3PCh. 1 - The following program will compile but it has...Ch. 1 - Programming Projects require more problem-solving...Ch. 1 - Write a complete program for the problem described...Ch. 1 - Prob. 3PPCh. 1 - Prob. 4PPCh. 1 - Write an applet program for the problem described...Ch. 1 - Prob. 6PP
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
What is the difference between system software and application software?
Starting Out with C++: Early Objects
For each of the following numeric formats, identify the format string used as the input parameter when calling ...
Starting Out With Visual Basic (7th Edition)
Write a nested loop that displays 10 rows of # characters. There should be 15 # characters in each row.
Starting Out with C++: Early Objects (9th Edition)
Modify Program 7.14 so that the user can convert any number of integers. Make provision for the program to term...
Programming in C
Consider the adage Never ask a question for which you do not want the answer. a. Is following that adage ethica...
Experiencing MIS
The programs that translate high-level language programs into machine language are called.
Java How To Program (Early Objects)
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
- Write an algorithm that finds the m smallest numbers in a list of n numbers.arrow_forwardWrite an algorithm for a program that determines all composite numbers between 1 and 20.arrow_forwardA student spends a majority of his weekend playing and watching sports, thereby tiring him out and leading him to oversleep and often miss his Monday 8 AM math class. Suppose that the tuition per semester is $25,000 and the average semester consists of 15 units. If the math class meets three days a week, one hour each day for 15 weeks, and is a four-unit course, how much does each hour of math class cost the student? Design an algorithm that computes the cost of each math class.arrow_forward
- given k positive integer, if k is even we divide it by 2, if odd we multiply it by 3 and add 1. and we reach 1 eventually. and it stops after 1000 iterations. below is the code to this algorithm, find the errors from the pseudocode and correct them.arrow_forwardQ1: Write an algorithm for printing numbers less than a given number (n) that are divisibleby 5. Then show how many these numbers are?arrow_forwardYou 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")arrow_forward
- Your goal is to guess a secret integer between 1 and N. You repeatedly guess integers between 1 and N. After each guess you learn if your guess equals thesecret integer (and the game stops). Otherwise, you learn if the guess is hotter (closer to)or colder (farther from) the secret number than your previous guess. Design an algorithm that finds the secret number in at most ~2 lg N guesses. Then design an algorithmthat finds the secret number in at most ~ 1 lg N guesses.arrow_forwardWrite an algorithm that reads an unknown number of numbers and count how many of them are in the following ranges: [0-25], [26-50], [51-75] and [76- 100]. Data entry must end when a negative number is read. In Phyton3arrow_forwardCorrect answer will be upvoted else downvoted. number is called 2050-number if it is 2050, 20500, ..., (2050⋅10k for integer k≥0). Given a number n, you are asked to represent n as the sum of some (not necessarily distinct) 2050-numbers. Compute the minimum number of 2050-numbers required for that. Input The first line contains a single integer T (1≤T≤1000) denoting the number of test cases. The only line of each test case contains a single integer n (1≤n≤1018) denoting the number to be represented. Output For each test case, output the minimum number of 2050-numbers in one line. If n cannot be represented as the sum of 2050-numbers, output −1 instead.arrow_forward
- Euclid’s algorithm (or the Euclidean algorithm) is an algorithm that computes thegreatest common divisor, denoted by gcd, of two integers. Below are the original versions ofEuclid’s algorithm that uses repeated subtraction and another one that uses the remainder.int gcd_sub(int a, int b){ if (!a) return b; while (b) if (a > b) a = a – b; else b = b – a; return a;}int gcd_rem(int a, int b){ int t; while (b) { t = b; b = a % b; a = t; } return a;}1. Trace each of the above algorithm using specific values for a and b.2. Compare both algorithms.arrow_forwarduse JAVA to write the code. : Euclid’s algorithm for finding the greatest common divisor (gdc) of two numbers The algorithm: given two numbers, n1 and n2: Divide n1 by n2 and let r be the remainder. If the remainder r is 0, the algorithm is finished and the answer is n2. (If the remainder is 1, the numbers are mutually prime and we are done-see below.) Set n1 to the value of n2, set n2 to the value of r, and go back to step 1. Entering 0 for one of the values is bad. It should work for the other value, but you have to figure out which is OK and which is bad. Catch this problem as it happens and make the user enter another value until they enter an acceptable one. Give an appropriate error message if this happens.arrow_forward1. A runner targets herself to improve her time on a certain course by 3 seconds a day. If onday 0 she runs the course in 3 minutes, how fast must she run it on day 14 to stay ontarget?2. A certain computer algorithm executes twice as many operations when it is run with aninput of size k as when it is run with an input of size k − 1 (where k is an integer that isgreater than 1). When the algorithm is run with an input of size 1, it executes sevenoperations. How many operations does it execute when it is run with an input of size 25?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Java random numbers; Author: Bro code;https://www.youtube.com/watch?v=VMZLPl16P5c;License: Standard YouTube License, CC-BY