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: 8 /
Q: 1
(Sum elements column by column) Write a method that returns the sum of all the elements in a specified column in a matrix using the following header:
Chapter: 8 /
Q: 2
(Sum the major diagonal in a matrix) Write a method that sums all the numbers in the major diagonal in an n * n matrix of double values using the following header:
Chapter: 8 /
Q: 3
(Sort students on grades) Rewrite Listing 8.2, GradeExam.java, to display the students in increasing order of the number of correct answers
Chapter: 8 /
Q: 4
(Compute the weekly hours for each employee) Suppose the weekly hours for all employees are stored in a two-dimensional array
Chapter: 8 /
Q: 6
(Algebra: multiply two matrices) Write a method to multiply two matrices. The header of the method is:
Chapter: 8 /
Q: 7
(Points nearest to each other) Listing 8.3 gives a program that finds two points in a two-dimensional space nearest to each other. Revise the program so that it finds two points in a three-dimensional space nearest to each other. Use a two-dimensional array to represent the points. Test the program
Chapter: 8 /
Q: 8
(All closest pairs of points) Revise Listing 8.3, FindNearestPoints.java, to display all closest pairs of points with the same minimum distance. Here is a sample run:
Chapter: 8 /
Q: 9
(Game: play a tic-tac-toe game) In a game of tic-tac-toe, two players take turns marking an available cell in a 3 * 3 grid with their respective tokens (either X or O)
Chapter: 8 /
Q: 10
(Largest row and column) Write a program that randomly fills in 0s and 1s into a 4-by-4 matrix, prints the matrix, and finds the first row and column with the most 1s. Here is a sample run of the program:
Chapter: 8 /
Q: 11
(Game: nine heads and tails) Nine coins are placed in a 3-by-3 matrix with some face up and some face down. You can represent the state of the coins using a 3-by-3 matrix with values 0 (heads) and 1 (tails). Here are some examples:
total questions:
772
Previous
21
22
23
24
25
Next
Questions
772
Views
Best Answers
299
Points
5
×
Close
add reason
reason