Questions and Answers of Java Software Solutions

SR 11.8 How would the result of the Propagation program change if the following code fragment was placed in the leve 12 method just before the call to the level3 method? int num=10, den = 0; int res
SR 11.9 How would the result of the Propagation program change if the following code fragment was placed in the leve 12 method just after the call to the level3 method? int num = 10, den = 0; int res
SR 11.10 What is a checked exception?
SR 11.11 True or False? Explain. a. An ArithmeticException is an Exception. b. An ArithmeticException is Throwable. c. An ArithmeticException is a checked exception. d. A NoSuchMethodException is a
SR 11.12 What happens if the input to the CreatingExceptions program is 42? What if it is -3?
SR 11.13 What is a stream?
SR 11.14 What are the standard I/O streams?
SR 11.15 What Stream class object have we been using explicitly throughout this book?
SR 11.16 An I/O exception, the InputMismatchException, will occur during the main method of the CreatingExceptions program (see Listing 11.5) if the user enters an alphabetic character. Why doesn't
SR 11.17 An I/O exception, the FileNotFoundException, will occur during the main method of the TestData program if the test.txt is not writable. Why doesn't the main method definition include a
SR 11.18 What is the purpose of the close method of the PrintWriter class?
SR 11.19 What is a tool tip?
SR 11.20 Why might you want to disable a control?
SR 11.21 What does a scroll pane do?
SR 11.22 What are the three ways the user can change the knob position on a scroll bar?
SR 11.23 What does the scroll bar policy determine?
SR 11.24 Describe the role of the divider bar on a split pane.
SR 11.25 What is the difference between a choice box and a list view?
SR 11.26 What happens if more than two nodes are added to a split pane?
SR 12.1 What is recursion?
SR 12.2 How many times is the recursive part of the definition of a List used to define a list of 10 numbers? How many times is the base case used?
SR 12.3 What is infinite recursion?
SR 12.4 When is a base case needed for recursive processing?
SR 12.5 Write a recursive definition of 5* n (integer multiplication), where n > 0. Define the multiplication process in terms of integer addition. For example, 5* 7 is equal to 5 added to itself 7
SR 12.6 Is recursion necessary?
SR 12.7 When should recursion be avoided?
SR 12.8 Describe what is returned by the following recursive method. } public int exercise (int n) if (n < 0) return -1; else if (n < 10) return 1; else return 1 + exercise (n/10);
SR 12.9 Write a recursive method that returns the value of 5 n, where n > 0. See Self-Review Question 12.5. Explain why you would not normally use recursion to solve this problem.
SR 12.10 What is indirect recursion?
SR 12.11 Under what conditions does the recursion stop in the MazeSearch program?
SR 12.12 Identify where in the Mazesearch program each of the following is provided. a. The original maze is defined. b. A test to see if we have arrived at the goal occurs. c. A location is marked
SR 12.13 Trace the Mazesearch program to determine the series of calls to the method valid (including the values of the parameters that are passed) that would occur if the original maze is as shown.
SR 12.14 Explain the general approach to solving the Towers of Hanoi puzzle. How does it relate to recursion?
SR 12.15 Trace the solveTowers code for an initial stack of 1 disk. How many calls to the move Tower method are made? How many calls are made for an initial stack of 2 disks? How many for 3 disks?
SR 12.16 Where does recursion occur in the TiledImages program? What does it accomplish?
SR 12.17 How many Image objects are created in the Tiled Images program? How many ImageView objects?
SR 12.18 What is the base case of the recursion in the Tiled Images program?
SR 12.19 What is a fractal? What does it have to do with recursion?
SR 12.20 Why does the program impose an upper limit on the order of the Koch snowflake fractal?
SR 12.21 Describe how each line segment of a Koch snowflake is changed when going to the next higher order fractal.
Explain the underlying concepts of recursion.
Explore examples that promote recursive thinking.
Examine recursive methods and unravel their processing steps.
Define infinite recursion and discuss ways to avoid it.
Explain when recursion should and should not be used.
Demonstrate the use of recursion to solve problems.
Explore the use of recursion in graphics-based programs.
Explore fractals and their relationship to recursion.
Discuss the purpose of exceptions.
Examine exception messages and the call stack trace.
Examine the try-catch statement for handling exceptions.
Explore the concept of exception propagation.
Describe the exception class hierarchy in the Java standard class library.
Explore I/O exceptions and the ability to write text files.
Enhance GUIs using tool tips and disabled components
Explore additional GUI controls and containers.
Explore the concept of a collection.
Stress the importance of separating the interface from the implementation.
Examine the difference between fixed and dynamic implementations.
Define and use dynamically linked lists.
Introduce classic linear data such as queues and stacks.
Introduce classic non-linear data structures such as trees and graphs.
Discuss the Java Collections API.
Define the use of generic types and their use in collection classes.
SR 13.1 What is a collection?
SR 13.2 What's the difference between a collection and a data structure?
SR 13.3 Why are objects particularly well suited for implementing abstract data types?
SR 13.4 What is a dynamic data structure?
SR 13.5 Describe the steps depicted in Figure 13.2 to insert a node into a list. What special cases exist?
SR 13.6 Describe the steps depicted in Figure 13.3 to delete a node from a list. What special cases exist?
SR 13.7 Suppose first is a reference to a Node object, and that it refers to the first node in a linked list. Show, in pseudocode, the steps that would count and return the number of nodes on the
SR 13.8 What is a doubly linked list?
SR 13.9 What is a header node for a linked list?
SR 13.10 How is a queue different from a list?
SR 13.11 Show the contents of a queue after the following operations are performed. Assume the queue is initially empty. enqueue (5) ; enqueue (21); dequeue(); enqueue (72); enqueue (37); enqueue
SR 13.12 What is a stack?
SR 13.13 Show the contents of a stack after the following operations are performed. Assume the stack is initially empty. push (5); push (21); pop(); push (72); push (37); push (15); pop();
SR 13.14 What is the stack class?
SR 13.15 What do trees and graphs have in common?
SR 13.16 Which structure (a tree or a graph) would be a good choice to represent each of the following. a. The directories and files on a computer system. b. Airplane routes. c. An "is a friend of
SR 13.17 What is the Java Collections API?
SR 13.18 What is a generic type, and how does it relate to the Java Collections API?
EX 13.1 Suppose current is a reference to a Node object and that it currently refers to a specific node in a linked list. Show, in pseudocode, the steps that would delete the node following current
EX 13.2 Modify your answer to Exercise 13.1 assuming that the list was set up as a doubly linked list, with both next and prev references.
EX 13.3 Suppose current and newNode are references to Node objects. Assume current currently refers to a specific node in a linked list and newNode refers to an unattached Node object. Show, in
EX 13.4 Modify your answer to Exercise 13.3 Dassuming that the list was set up as a doubly linked list, with both next and prev references.
EX 13.5 Would the front and rear references in the header node of a linked list ever refer to the same node? Would they ever both be null? Would one ever be null if the other was not? Explain your
EX 13.6 Show the contents of a queue after the following operations are performed. Assume the queue is initially empty. enqueue (45); enqueue (12); enqueue (28); dequeue(); dequeue(); enqueue (69);
EX 13.7 In terms of the final state of a queue, does it matter how dequeue operations are intermixed with enqueue operations? Does it matter how the enqueue operations are intermixed among
EX 13.8 Show the contents of a stack after the following operations are performed. Assume the stack is initially empty. push (45); push (12);
EX 13.9 In terms of the final state of a stack, does it matter how the pop operations are intermixed with the push operations? Does it matter how the push operations are intermixed among themselves?
EX 13.10 Would a tree data structure be a good choice to represent a family tree that shows lineage? Why or why not? Would a binary tree be a better choice? Why or why not?
EX 13.11 What data structure would be a good choice to represent the links between various Web sites? Give an example.
PP 13.1 Consistent with the example from Chapter 8, design and implement an application that maintains a collection of DVDs using a linked list. In the main method of the driver class, add various
PP 13.2 Modify the Magazine Rack program presented in this chapter by adding delete and insert operations into the MagazineList class. Have the Magazine class implement the Comparable interface, and
PP 13.3 Design and implement a version of selection sort (from Chapter 10) that operates on a linked list of nodes that each contain an integer.
PP 13.4 Design and implement a version of insertion sort (from Chapter 10) that operates on a linked list of nodes that each contain an integer.
PP 13.5 Design and implement an application that simulates the customers waiting in line at a bank. Use a queue data structure to represent the line. As customers arrive at the bank, customer objects
PP 13.6 Modify the solution to the PP 13.5 so that it represents eight tellers and therefore eight customer queues. Have new customers go to the shortest queue. Determine which queue had the shortest
PP 13.7 Design and implement an application that evaluates a postfix expression that operates on integer operands using the arithmetic operators +, -, *, /, and %. We are already familiar with infix

Showing 1 - 100 of 978