Big Java Late Objects
2nd Edition
ISBN: 9781119330455
Author: Horstmann
Publisher: WILEY
expand_more
expand_more
format_list_bulleted
Concept explainers
Expert Solution & Answer
Chapter 4, Problem 23RE
Explanation of Solution
An example of “for” loop where symmetrical bounds are more natural:
An example of a for loop where symmetric bounds are more natural would be in the c...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
for (k = 1; k <= N; k=k+1)
for (t = 0; t <= k; t = t+9)
printf ("C");
for-t: TCiter(
dependent / independent of loop variable
Change of var:
E / repetitions
Closed form:
for-k: TCiter(.
dependent / independent of loop variable
Change of var:
E / repetitions
Closed form:
O(
Consider the following two sum functions:
def sum_iter(x: int) -> int:
result: int
while x >= 0:
result += x
x -- 1
return result
versus
def sum_recur(x: int) -> int:
if x < 0:
return 0
else:
return x + sum_recur(x - 1)
Q2/ Simplify using K- map for the following :
Simplify the Boolean function
F(A, B, C, D, E) = (0, 2, 4, 6, 9, 13, 21, 23, 25, 29, 31)
%3D
1 Add file
Chapter 4 Solutions
Big Java Late Objects
Ch. 4.1 - How many years does it take for the investment to...Ch. 4.1 - If the interest rate is 10 percent per year, how...Ch. 4.1 - Modify the program so that the balance after each...Ch. 4.1 - Suppose we change the program so that the...Ch. 4.1 - What does the following loop print? int n = 1;...Ch. 4.2 - Hand-trace the following code, showing the value...Ch. 4.2 - Hand-trace the following code, showing the value...Ch. 4.2 - Hand-trace the following code, assuming that a is...Ch. 4.2 - Trace the following code. What error do you...Ch. 4.2 - Prob. 10SC
Ch. 4.3 - Write the for loop of the InvestmentTable.java...Ch. 4.3 - How many numbers does this loop print? for (int n...Ch. 4.3 - Write a for loop that prints all even numbers...Ch. 4.3 - Write a for loop that computes the sum of the...Ch. 4.3 - How would you modify the for loop of the...Ch. 4.4 - Prob. 16SCCh. 4.4 - Rewrite the input check do loop using a while loop...Ch. 4.4 - Suppose Java didnt have a do loop. Could you...Ch. 4.4 - Write a do loop that reads integers and computes...Ch. 4.4 - Write a do loop that reads integers and computes...Ch. 4.5 - What does the SentinelDemo.java program print when...Ch. 4.5 - Why does the SentinelDemo.java program have to...Ch. 4.5 - What would happen if the declaration of the salary...Ch. 4.5 - In the last example of this section, we prompt the...Ch. 4.5 - Prob. 25SCCh. 4.6 - Prob. 26SCCh. 4.6 - Google has a simple interface for converting...Ch. 4.6 - Consider a modification of the program in Self...Ch. 4.6 - Prob. 29SCCh. 4.6 - Produce a storyboard for a program that compares...Ch. 4.7 - What total is computed when no user input is...Ch. 4.7 - Prob. 32SCCh. 4.7 - What are the values of position and ch when no...Ch. 4.7 - Prob. 34SCCh. 4.7 - Prob. 35SCCh. 4.7 - Prob. 36SCCh. 4.8 - Why is there a statement System.out.println(); in...Ch. 4.8 - How would you change the program to display all...Ch. 4.8 - Prob. 39SCCh. 4.8 - What do the following nested loops display? for...Ch. 4.8 - Prob. 41SCCh. 4.9 - Prob. 42SCCh. 4.9 - You need to write a program for DNA analysis that...Ch. 4.9 - Prob. 44SCCh. 4.9 - Consider the task of finding numbers in a string....Ch. 4.10 - How do you simulate a coin toss with the...Ch. 4.10 - How do you simulate the picking of a random...Ch. 4.10 - Why does the loop body in Dice.java call...Ch. 4.10 - Prob. 49SCCh. 4.10 - Prob. 50SCCh. 4 - Given the variables String stars = ""; String...Ch. 4 - What do these loops print? a. int i = 0; int j =...Ch. 4 - What do these code snippets print? a. int result =...Ch. 4 - Write awhile loop that prints a. All squares less...Ch. 4 - Write a loop that computes a. The sum of all even...Ch. 4 - Provide trace tables for these loops. a. int i =...Ch. 4 - What do these loops print? a. for (int i = 1; i ...Ch. 4 - What is an infinite loop? On your computer, how...Ch. 4 - Write a program trace for the pseudocode in...Ch. 4 - What is an off-by-one error? Give an example from...Ch. 4 - What is a sentinel value? Give a simple rule when...Ch. 4 - Which loop statements does Java support? Give...Ch. 4 - How many iterations do the following loops carry...Ch. 4 - Write pseudocode for a program that prints a...Ch. 4 - Prob. 15RECh. 4 - Write pseudocode for a program that reads a...Ch. 4 - Write pseudocode for a program that reads a...Ch. 4 - Rewrite the following for loop into a while loop....Ch. 4 - Rewrite the following do loop into a while loop....Ch. 4 - Provide trace tables of the following loops. a....Ch. 4 - What do the following loops print? Work out the...Ch. 4 - What do the following program segments print? Find...Ch. 4 - Prob. 23RECh. 4 - Add a storyboard panel for the conversion program...Ch. 4 - In Section 4.6, we decided to show users a list of...Ch. 4 - Change the storyboards in Section 4.6 to support a...Ch. 4 - Draw a flowchart for a program that carries out...Ch. 4 - In Section 4.7.5, the code for finding the largest...Ch. 4 - What are nested loops? Give an example where a...Ch. 4 - The nested loops for (int 1 = 1; 1 = height; i++)...Ch. 4 - Suppose you design an educational game to teach...Ch. 4 - In a travel simulation, Harry will visit one of...Ch. 4 - Write programs with loops that compute a. The sum...Ch. 4 - Write programs that read a sequence of integer...Ch. 4 - Write programs that read a line of input as a...Ch. 4 - Complete the program in How To 4.1 on page 171....Ch. 4 - Write a program that reads a set of floating-point...Ch. 4 - Translate the following pseudocode for finding the...Ch. 4 - Translate the following pseudocode for randomly...Ch. 4 - Write a program that reads a word and prints each...Ch. 4 - Write a program that reads a word and prints the...Ch. 4 - Write a program that reads a word and prints the...Ch. 4 - Write a program that reads a word and prints the...Ch. 4 - Write a program that reads a word and prints all...Ch. 4 - Write a program that reads a string and prints the...Ch. 4 - Write a program that reads a sequence of words and...Ch. 4 - Write a program that prints all powers of 2 from...Ch. 4 - Write a program that reads a number and prints all...Ch. 4 - Prob. 18PECh. 4 - Write a program that reads an integer and...Ch. 4 - Write a program that reads an integer and...Ch. 4 - Write a program to plot the following face.Ch. 4 - Write a graphical application that displays a...Ch. 4 - Enhance Worked Example 4.1 to check that the...Ch. 4 - Mean and standard deviation. Write a program that...Ch. 4 - The Fibonacci numbers are defined by the sequence...Ch. 4 - Factoring of integers. Write a program that asks...Ch. 4 - Prime numbers. Write a program that prompts the...Ch. 4 - The game of Nim. This is a well-known game with a...Ch. 4 - The Drunkards Walk. A drunkard in a grid of...Ch. 4 - The Monty Hall Paradox. Marilyn vos Savant...Ch. 4 - A simple random generator is obtained by the...Ch. 4 - The Buffon Needle Experiment. The following...Ch. 4 - In the 17th century, the discipline of probability...Ch. 4 - Write a program that reads an initial investment...Ch. 4 - Currency conversion. Write a program that first...Ch. 4 - Write a program that first asks the user to type...Ch. 4 - Your company has shares of stock it would like to...Ch. 4 - Write an application to pre-sell a limited number...Ch. 4 - You need to control the number of people who can...Ch. 4 - Credit Card Number Check. The last digit of a...Ch. 4 - In a predator-prey simulation, you compute the...Ch. 4 - Projectile flight. Suppose a cannonball is...Ch. 4 - Radioactive decay of radioactive materials can be...Ch. 4 - The photo at left shows an electric device called...Ch. 4 - Write a graphical application that draws a spiral,...Ch. 4 - Prob. 28PPCh. 4 - Draw a picture of the four-leaved rose whose...
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
- Make sure the loop invariant tells something about the function of the code (the functionality of the code is that it computed for the gcd of two positive integers)arrow_forwardcode present a loop invariant and prove it. Assume n >= 1arrow_forwardIN PYTHON A tridiagonal matrix is one where the only nonzero elements are the ones on the main diagonal and the ones immediately above and below it.Write a function that solves a linear system whose coefficient matrix is tridiag- onal. In this case, Gauss elimination can be made much more efficient because most elements are already zero and don't need to be modified or added. As an example, consider a linear system Ax = b with 100,000 unknowns and the same number of equations. The coefficient matrix A is tridiagonal, with all elements on the main diagonal equal to 3 and all elements on the diagonals above and below it equal to 1. The vector of constant terms b contains all ones, except that the first and last elements are zero. You can use td to find that x1= −0.10557. The following code format should help: def td(l, m, u, b): '''Solve a linear system Ax = b where A is tridiagonal Inputs: l, lower diagonal of A, n-1 vector m, main diagonal of A, n vector u,…arrow_forward
- Write a complete C++ program that implements the Breadth First Search (BFS) Algorithm (Chapter 22). Your final submitted code and report should include some sample results that demonstrate that your code is successfully and correctly working. You need to present 3 samples. - You must ask the user to enter the number of vertices n for your graph, and go over the source vertices or nodes in numerical or alphabetical order. - Based on the number of vertices, randomly generate the edges. - Assume you are using the Adjacency Matrix to represent your graph. Assume you have an un-directed graph. Make sure that you ask the user to enter the number of vertices, Fixed number of vertices is not accepted. Use numeric numbers to name the vertices. Based on the number of vertices entered by the user, randomly generate the edges connected the vertices. Assume that you only allow undirected edges or undirected graph. Apply the BFS algorithm on the generated graph. Organize the resulted BFS…arrow_forwardWrite a complete C++ program that implements the Breadth First Search (BFS) Algorithm (Chapter 22). Your final submitted code and report should include some sample results that demonstrate that your code is successfully and correctly working. You need to present 3 samples. - You must ask the user to enter the number of vertices n for your graph, and go over the source vertices or nodes in numerical or alphabetical order. - Based on the number of vertices, randomly generate the edges. - Assume you are using the Adjacency Matrix to represent your graph. Assume you have an un-directed graph. Make sure that you ask the user to enter the number of vertices, Fixed number of vertices is not accepted. Use numeric numbers to name the vertices. Based on the number of vertices entered by the user, randomly generate the edges connected the vertices. Assume that you only allow undirected edges or undirected graph. Apply the BFS algorithm on the generated graph. Organize the resulted BFS Tree in a…arrow_forwardWrite a complete C++ program that implements the Breadth First Search (BFS) Algorithm (Chapter 22). Your final submitted code and report should include some sample results that demonstrate that your code is successfully and correctly working. You need to present 3 samples. - You must ask the user to enter the number of vertices n for your graph, and go over the source vertices or nodes in numerical or alphabetical order. - Based on the number of vertices, randomly generate the edges. - Assume you are using the Adjacency Matrix to represent your graph. Assume you have an un-directed graph. Make sure that you ask the user to enter the number of vertices, Fixed number of vertices is not accepted. Use numeric numbers to name the vertices. Based on the number of vertices entered by the user, randomly generate the edges connected the vertices. Assume that you only allow undirected edges or undirected graph. Apply the BFS algorithm on the generated graph. Organize the resulted BFS Tree in a…arrow_forward
- Write a complete C++ program that implements the Breadth First Search (BFS) Algorithm (Chapter 22). Your final submitted code and report should include some sample results that demonstrate that your code is successfully and correctly working. You need to present 3 samples. - You must ask the user to enter the number of vertices n for your graph, and go over the source vertices or nodes in numerical or alphabetical order. - Based on the number of vertices, randomly generate the edges. - Assume you are using the Adjacency Matrix to represent your graph. Assume you have an un-directed graph. Make sure that you ask the user to enter the number of vertices, Fixed number of vertices is not accepted. Use numeric numbers to name the vertices. Based on the number of vertices entered by the user, randomly generate the edges connected the vertices. Assume that you only allow undirected edges or undirected graph. Apply the BFS algorithm on the generated graph. Organize the resulted BFS…arrow_forwardWrite a complete C++ program that implements the Breadth First Search (BFS) Algorithm (Chapter 22). Your final submitted code and report should include some sample results that demonstrate that your code is successfully and correctly working. You need to present 3 samples. - You must ask the user to enter the number of vertices n for your graph, and go over the source vertices or nodes in numerical or alphabetical order. - Based on the number of vertices, randomly generate the edges. - Assume you are using the Adjacency Matrix to represent your graph. Assume you have an un-directed graph. Make sure that you ask the user to enter the number of vertices, Fixed number of vertices is not accepted. Use numeric numbers to name the vertices. Based on the number of vertices entered by the user, randomly generate the edges connected the vertices. Assume that you only allow undirected edges or undirected graph. Apply the BFS algorithm on the generated graph. Organize the resulted BFS…arrow_forwardPlease show all work. Thank youarrow_forward
- Using the C Programming language, write a program that sums an array of 50 elements. Next,optimize the code using loop unrolling. Loop unrolling is a program transformation that reduces thenumber of iterations for a loop by increasing the number of elements computed on each iteration.Generate a graph of performance improvement.arrow_forwardSuppose that we are given a divisor and a target count, and we need to find the range of numbers from 1 that will have the target count of numbers divisible by the divisor. For example. If the divisor is 3 and the target count is 4, the range is 1 to 12, as in this range there are 4 numbers divisible by 3, viz. 3, 6, 9, and 12. Use a while loop to find the ending number of the range within which we will have the target count of numbers that are divisible by the divisor and print the result. Test the code with divisor = 13 and target count = 5. The printed result should be “Between 1 and 65 there are 5 numbers divisible by 13.” In rstudioarrow_forwardPYTHON /JUPYTER NOTEBOOKS Program a backward solver (i.e. write your code) for an upper triangular system Ux=b. The algorithm is attached below for Numpy and Python with offset 1. Recall that NumPy and Python have offset 0 for their sequence data types.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education