Wrap-Up

Answers to Self Review Exercises

5.1

a) for, while. b) after. c) switch. d) continue. e) && (conditional AND). f) false. g) static.

5.2

a) False. The default case is optional. If no default action is needed, then there is no need for a default case. b) False. The break statement is used to exit the switch statement. The break statement is not required for the last case in a switch statement. c) False. Both of the relational expressions must be true for the entire expression to be true when using the && operator. d) True. e) True. f) False. The switch statement does not provide a mechanism for testing ranges of values, so every value that must be tested should be listed in a separate case label. g) True.

5.3
  1. sum = 0; for ( count = 1; count <= 99; count += 2 ) sum += count;
  2. double result = Math.pow( 2.5, 3 ) ;
  3. i = 1; while ( i <= 20 ) { System.out.print( i ); if ( i % 5 == 0 ) System.out.println(); else System.out.print( ' ' ); ++i; }
  4. for ( i = 1 ; i <= 20; i++ ) { System.out.print( i ); if ( i % 5 == 0 ) System.out.println(); else System.out.print( ' ' ); }
5.4
  1. Error: The semicolon after the while header causes an infinite loop, and there is a missing left brace.

    Correction: Replace the semicolon by a {, or remove both the ; and the }.

  2. Error: Using a floating-point number to control a for statement may not work, because floating-point numbers are represented only approximately by most computers.

    Correction: Use an integer, and perform the proper calculation in order to get the values you desire:

     for ( k = 1; k != 10; k++ )
     System.out.println( (double) k / 10 );
    
  3. Error: The missing code is the break statement in the statements for the first case.

    Correction: Add a break statement at the end of the statements for the first case. Note that this omission is not necessarily an error if the programmer wants the statement of case 2: to execute every time the case 1: statement executes.

  4. Error: An improper relational operator is used in the while repetition-continuation condition.

    Correction: Use <= rather than <, or change 10 to 11.

Exercises

5.5

Describe the four basic elements of counter-controlled repetition.

5.6

Compare and contrast the while and for repetition statements.

5.7

Discuss a situation in which it would be more appropriate to use a do...while statement than a while statement. Explain why.

5.8

Compare and contrast the break and continue statements.

5.9

Find and correct the error(s) in each of the following segments of code:

  1. for ( i = 100, i >= 1, i++ ) System.out.println( i );
  2. The following code should print whether integer value is odd or even:

     switch ( value % 2 )
     {
     case 0:
     System.out.println( "Even integer" );
    
     case 1:
     System.out.println( "Odd integer" );
     }
    
  3. The following code should output the odd integers from 19 to 1:

     for ( i = 19; i >= 1; i += 2 )
     System.out.println( i );
    
  4. The following code should output the even integers from 2 to 100:

     counter = 2;
    
     do
     {
     System.out.println( counter );
     counter += 2 ;
     } While ( counter < 100 );
    
5.10

What does the following program do?

 1 public class Printing
 2 {
 3 public static void main( String args[] )
 4 {
 5 for ( int i = 1; i <= 10; i++ )
 6 {
 7 for ( int j = 1; j <= 5; j++ )
 8 System.out.print( '@' );
 9
10 System.out.println();
11 } // end outer for
12 } // end main
13 } // end class Printing
5.11

Write an application that finds the smallest of several integers. Assume that the first value read specifies the number of values to input from the user.

5.12

Write an application that calculates the product of the odd integers from 1 to 15.

5.13

Factorials are used frequently in probability problems. The factorial of a positive integer n (written n! and pronounced " n factorial") is equal to the product of the positive integers from 1 to n. Write an application that evaluates the factorials of the integers from 1 to 5. Display the results in tabular format. What difficulty might prevent you from calculating the factorial of 20?

5.14

Modify the compound-interest application of Fig. 5.6 to repeat its steps for interest rates of 5, 6, 7, 8, 9 and 10%. Use a for loop to vary the interest rate.

5.15

Write an application that displays the following patterns separately, one below the other. Use for loops to generate the patterns. All asterisks (*) should be printed by a single statement of the form System.out.print( '*' ); which causes the asterisks to print side by side. A statement of the form System.out.println(); can be used to move to the next line. A statement of the form System.out.print( ' ' ); can be used to display a space for the last two patterns. There should be no other output statements in the program. [Hint: The last two patterns require that each line begin with an appropriate number of blank spaces.]

  1. * ** *** **** ***** ****** ******* ******** ********* **********
  2. ********** ********* ******** ******* ****** ***** **** *** ** *
  3. ********** ********* ******** ******* ****** ***** **** *** ** *
  4. * ** *** **** ***** ****** ******* ******** ********* **********
 
5.16

One interesting application of computers is to display graphs and bar charts. Write an application that reads five numbers between 1 and 30. For each number that is read, your program should display the same number of adjacent asterisks. For example, if your program reads the number 7, it should display *******.

5.17

A mail-order house sells five products whose retail prices are as follows: Product 1, $2.98; product 2, $4.50; product 3, $9.98; product 4, $4.49 and product 5, $6.87. Write an application that reads a series of pairs of numbers as follows:

  1. product number
  2. quantity sold

Your program should use a switch statement to determine the retail price for each product. It should calculate and display the total retail value of all products sold. Use a sentinel-controlled loop to determine when the program should stop looping and display the final results.

5.18

Modify the application in Fig. 5.6 to use only integers to calculate the compound interest. [Hint: Treat all monetary amounts as integral numbers of pennies. Then break the result into its dollars and cents portions by using the division and remainder operations, respectively. Insert a period between the dollars and the cents portions.]

5.19

Assume that i = 1, j = 2, k = 3 and m = 2. What does each of the following statements print?

  1. System.out.println( i == 1 );
  2. System.out.println( j == 3 );
  3. System.out.println( ( i >= 1 ) && ( j < 4 ) );
  4. System.out.println( ( m <= 99 ) & ( k < m ) );
  5. System.out.println( ( j >= i ) || ( k == m ) );
  6. System.out.println( ( k + m < j ) | ( 3 - j >= k ) );
  7. System.out.println( !( k > m ) );
5.20

Calculate the value of p from the infinite series

 

Print a table that shows the value of p approximated by computing one term of this series, by two terms, by three terms, and so on. How many terms of this series do you have to use before you first get 3.14? 3.141? 3.1415? 3.14159?

5.21

(Pythagorean Triples) A right triangle can have sides whose lengths are all integers. The set of three integer values for the lengths of the sides of a right triangle is called a Pythagorean triple. The lengths of the three sides must satisfy the relationship that the sum of the squares of two of the sides is equal to the square of the hypotenuse. Write an application to find all Pythagorean triples for side1, side2 and the hypotenuse, all no larger than 500. Use a triple-nested for loop that tries all possibilities. This method is an example of "brute-force" computing. You will learn in more advanced computer science courses that there are large numbers of interesting problems for which there is no known algorithmic approach other than using sheer brute force.

5.22

Modify Exercise 5.15 to combine your code from the four separate triangles of asterisks such that all four patterns print side by side. Make clever use of nested for loops.

5.23

(De Morgan's Laws) In this chapter, we have discussed the logical operators &&, &, ||, |, ^ and !. DeMorgan's Laws can sometimes make it more convenient for us to express a logical expression. These laws state that the expression !(condition1 && condition2) is logically equivalent to the expression (!condition1 || ! condition2). Also, the expression !(condition1 || condition2) is logically equivalent to the expression (!condition1 && ! condition2). Use De Morgan's Laws to write equivalent expressions for each of the following, then write an application to show that both the original expression and the new expression in each case produce the same value:

  1. !( x < 5 ) && !( y >= 7 )
  2. !( a == b ) || !( g != 5 )
  3. !( ( x <= 8 ) && ( y > 4 ) )
  4. !( ( i > 4 ) || ( j <= 6 ) )
5.24

Write an application that prints the following diamond shape. You may use output statements that print a single asterisk (*), a single space or a single newline character. Maximize your use of repetition (with nested for statements), and minimize the number of output statements.

 *
 ***
 *****
 *******
*********
 *******
 *****
 ***
 *
 
5.25

Modify the application you wrote in Exercise 5.24 to read an odd number in the range 1 to 19 to specify the number of rows in the diamond. Your program should then display a diamond of the appropriate size.

5.26

A criticism of the break statement and the continue statement is that each is unstructured. Actually, break statements and continue statements can always be replaced by structured statements, although doing so can be awkward. Describe in general how you would remove any break statement from a loop in a program and replace that statement with some structured equivalent. [Hint: The break statement exits a loop from the body of the loop. The other way to exit is by failing the loop-continuation test. Consider using in the loop-continuation test a second test that indicates "early exit because of a'break' condition."] Use the technique you develop here to remove the break statement from the application in Fig 5.12.

5.27

What does the following program segment do?

for ( i = 1; i <= 5; i++ )
{
 for ( j = 1; j <= 3; j++ )
 { 
 for ( k = 1; k <= 4; k++ )
 System.out.print( '*' );

 System.out.println();
 } // end inner for

 System.out.println();
} // end outer for
5.28

Describe in general how you would remove any continue statement from a loop in a program and replace it with some structured equivalent. Use the technique you develop here to remove the continue statement from the program in Fig. 5.13.

5.29

("The Twelve Days of Christmas" Song) Write an application that uses repetition and switch statements to print the song "The Twelve Days of Christmas." One switch statement should be used to print the day (i.e., "First," "Second," etc.). A separate switch statement should be used to print the remainder of each verse. Visit the Web site www.12days.com/library/carols/12daysofxmas.htm for the complete lyrics of the song.

Introduction to Computers, the Internet and the World Wide Web

Introduction to Java Applications

Introduction to Classes and Objects

Control Statements: Part I

Control Statements: Part 2

Methods: A Deeper Look

Arrays

Classes and Objects: A Deeper Look

Object-Oriented Programming: Inheritance

Object-Oriented Programming: Polymorphism

GUI Components: Part 1

Graphics and Java 2D™

Exception Handling

Files and Streams

Recursion

Searching and Sorting

Data Structures

Generics

Collections

Introduction to Java Applets

Multimedia: Applets and Applications

GUI Components: Part 2

Multithreading

Networking

Accessing Databases with JDBC

Servlets

JavaServer Pages (JSP)

Formatted Output

Strings, Characters and Regular Expressions

Appendix A. Operator Precedence Chart

Appendix B. ASCII Character Set

Appendix C. Keywords and Reserved Words

Appendix D. Primitive Types

Appendix E. (On CD) Number Systems

Appendix F. (On CD) Unicode®

Appendix G. Using the Java API Documentation

Appendix H. (On CD) Creating Documentation with javadoc

Appendix I. (On CD) Bit Manipulation

Appendix J. (On CD) ATM Case Study Code

Appendix K. (On CD) Labeled break and continue Statements

Appendix L. (On CD) UML 2: Additional Diagram Types

Appendix M. (On CD) Design Patterns

Appendix N. Using the Debugger

Inside Back Cover



Java(c) How to Program
Java How to Program (6th Edition) (How to Program (Deitel))
ISBN: 0131483986
EAN: 2147483647
Year: 2003
Pages: 615

Similar book on Amazon

Flylib.com © 2008-2017.
If you may any questions please contact us: flylib@qtcs.net