What is the keyword break for? What is the keyword continue for? Will the following programs terminate? If so, give the output.

int balance = 10;
while (true) {
    if (balance < 9)
       break;
    balance = balance - 9;
}
System.out.println("Balance is " + balance);

int balance = 10;
while (true) {
    if (balance < 9)
        continue;
    balance = balance - 9;
}
System.out.println("Balance is " + balance);

A cancellation error occurs when you are manipulating a very large number with a very small number. The large number may cancel out the smaller number. For example, the result of 100000000.0 + 0.000000001 is equal to 100000000.0. To avoid cancellation errors and obtain more accurate results, carefully select the order of computation. For example, in computing the following series, you will obtain more accurate results by computing from right to left rather than from left to right: $1+\frac{1}{2}+\frac{1}{3}+\ldots+\frac{1}{n}$ Write a program that compares the results of the summation of the preceding series, computing from left to right and from right to left with n = 50000.

Write a program that prompts the user to enter an integer from 1 to 15 and displays a pyramid.

How many times the loop body is executed for a decimal number 245 and how many times the loop body is executed for a decimal number 3245?

Will the program work if n1 and n2 are replaced by n1 / 2 and n2 / 2 in line 17 in Listing 5.9?

Can you always convert a while loop into a for loop? Convert the following while loop into a for loop int i = 1; int sum = 0; while (sum < 10000) { sum = sum + i; i++; }

Why is it wrong if you change the code (char)(hexValue + '0') to hexValue + '0' in line 21?

Write a program that reads an integer and displays all its smallest factors in increasing order. For example, if the input integer is 120, the output should be as follows: 2, 2, 2, 3, 5.

Another solution for Listing 5.9 to find the greatest common divisor of two integers n1 and n2 is as follows: First find d to be the minimum of n1 and n2, then check whether d, d-1, d-2, . . . , 2, or 1 is a divisor for both n1 and n2 in this order. The first such common divisor is the greatest common divisor for n1 and n2. Write a program that prompts the user to enter two positive integers and displays the gcd.

How many times is the println statement executed? for (int i = 0; i < 10; i++) for (int j = 0; j < i; j++) System.out.println(i * j)

(Find the largest n such that $n^{3}<12,000$) Use a while loop to find the largest integer n such that $n^{3}$ is less than 12,000.

Use nested loops that display the following patterns in four separate programs:

Pattern A       Pattern B        Pattern C       Pattern D
1               1 2 3 4 5 6               1     1 2 3 4 5 6
1 2             1 2 3 4 5               2 1     1 2 3 4 5
1 2 3           1 2 3 4               3 2 1     1 2 3 4
1 2 3 4         1 2 3               4 3 2 1     1 2 3
1 2 3 4 5       1 2               5 4 3 2 1     1 2
1 2 3 4 5 6     1               6 5 4 3 2 1     1

Can you convert a for loop to a while loop? List the advantages of using for loops.

(Find the smallest n such that $n^{2}>12,000$) Use a while loop to find the smallest integer n such that $\boldsymbol{n}^{2}$ is greater than 12,000.