top nge public int findScore(int[]0 scores) { int r, c; int i, j = 0; for (r = 0; r < scores.length; r++) { for (c = 0; c < scores[0].length; c++) { i = scores[r][c]; if (i > j) j = i; } return j; }
top nge public int findScore(int[]0 scores) { int r, c; int i, j = 0; for (r = 0; r < scores.length; r++) { for (c = 0; c < scores[0].length; c++) { i = scores[r][c]; if (i > j) j = i; } return j; }
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
java homework
![Assume that you have a 2D array, holds players and their ten top scores. The scores can range from 0 to 100. What does the below code segment do?
public int findScore(int [] [] scores) {
int r, c;
int i, j = 0;
for (r = 0; r < scores.length; r++) {
for (c = 0; c < scores[Ø].length; c++) {
i = scores[r][c];
if (i > j)
j = i;
}
}
return j;
}
Your answer:
O The sum of the total score values of the array
The most frequent score value in the array
O The maximum score value for all players in the array
The row with the greatest score sum
O The column with the greatest score sum](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F91f99aeb-bcbf-4d18-ac7a-038811a57af5%2F6fe65997-a867-4218-83e6-1ce47d6188c8%2Ft5wsv8_processed.png&w=3840&q=75)
Transcribed Image Text:Assume that you have a 2D array, holds players and their ten top scores. The scores can range from 0 to 100. What does the below code segment do?
public int findScore(int [] [] scores) {
int r, c;
int i, j = 0;
for (r = 0; r < scores.length; r++) {
for (c = 0; c < scores[Ø].length; c++) {
i = scores[r][c];
if (i > j)
j = i;
}
}
return j;
}
Your answer:
O The sum of the total score values of the array
The most frequent score value in the array
O The maximum score value for all players in the array
The row with the greatest score sum
O The column with the greatest score sum
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY