Discover
Questions library
Collections library
Find online teacher
login
Discover
questions library
Find online teacher
login
Introduction to Java Programming, Comprehensive Version (10th Edition)
by
Y. Danial liang
Edition:
10th edition
ISBN13:
978-0133761313
ISBN10:
0133761312
772
Java programming
Home
Books
Introduction to Java Programming, Comprehensive Version (10th Edition)
Similar Books
No books found
Title
Chapter: 18 /
Q: 28
(Nonrecursive directory size) Rewrite Listing 18.7, DirectorySize.java, without using recursion
Chapter: 18 /
Q: 29
Number of files in a directory) Write a program that prompts the user to enter a directory and displays the number of the files in the directory
Chapter: 18 /
Q: 30
(Find words) Write a program that finds all occurrences of a word in all the files under a directory, recursively. Pass the parameters from the command line as follows:
Chapter: 18 /
Q: 31
(Replace words) Write a program that replaces all occurrences of a word with a new word in all the files under a directory, recursively. Pass the parameters from the command line as follows:
Chapter: 18 /
Q: 32
(Game: Knight’s Tour) The Knight’s Tour is an ancient puzzle. The objective is to move a knight, starting from any square on a chessboard, to every other square once, as shown in Figure 18.15a
Chapter: 18 /
Q: 33
(Game: Knight’s Tour animation) Write a program for the Knight’s Tour problem. Your program should let the user move a knight to any starting square and click the Solve button to animate a knight moving along the path, as shown in Figure 18.16
Chapter: 18 /
Q: 34
(Game: Eight Queens) The Eight Queens problem is to find a solution to place a queen in each row on a chessboard such that no two queens can attack each other. Write a program to solve the Eight Queens problem using recursion and display the result as shown in Figure 18.17
Chapter: 18 /
Q: 35
(H-tree fractal) An H-tree (introduced at the beginning of this chapter in Figure 18.1) is a fractal defined as follows:
Chapter: 18 /
Q: 36
(Sierpinski triangle) Write a program that lets the user to enter the order and display the filled Sierpinski triangles as shown in Figure 18.18
Chapter: 18 /
Q: 37
(Hilbert curve) The Hilbert curve, first described by German mathematician David Hilbert in 1891, is a space-filling curve that visits every point in a square grid with a size of 2 * 2, 4 * 4, 8 * 8, 16 * 16, or any other power of 2. Write a program that displays a Hilbert curve for the specified
total questions:
772
Previous
50
51
52
53
54
Next
Questions
772
Views
Best Answers
299
Points
5
×
Close
add reason
reason