Consider the following incomplete StudentRecord class declaration. Each StudentRecord object stores a list of that student's scores and contains methods to compute that student’s final average. public class StudentRecord { private int[ scores; // contains scores.length values // scores.length > 1 // constructors and other data fields not shown // returns the average (arithmetic mean) of the values in scores // whose subscripts are between first and last, inclusive // precondition: 0 <= first <= last < scores.length private double average (int first, int last) { /* to be implemented in part (a) */ } // returns true if each successive value in scores is greater // than or equal to the previous value; // otherwise, returns false private boolean hasImproved () { /* to be implemented in part (b) */ } // if the values in scores have improved, returns the average // of the elements in scores with indexes greater than or equal // to scores.length/2; // otherwise, returns the average of all of the values in scores public double finalAverage() { /* to be implemented in part (c) */ }
Consider the following incomplete StudentRecord class declaration. Each StudentRecord object stores a list of that student's scores and contains methods to compute that student’s final average. public class StudentRecord { private int[ scores; // contains scores.length values // scores.length > 1 // constructors and other data fields not shown // returns the average (arithmetic mean) of the values in scores // whose subscripts are between first and last, inclusive // precondition: 0 <= first <= last < scores.length private double average (int first, int last) { /* to be implemented in part (a) */ } // returns true if each successive value in scores is greater // than or equal to the previous value; // otherwise, returns false private boolean hasImproved () { /* to be implemented in part (b) */ } // if the values in scores have improved, returns the average // of the elements in scores with indexes greater than or equal // to scores.length/2; // otherwise, returns the average of all of the values in scores public double finalAverage() { /* to be implemented in part (c) */ }
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
Transcribed Image Text:2005 AP° C OMPUTER SCIENCE A FREE-RESPONSE QUESTIONS
(a) Write the StudentRecord method average. This method returns the average of the values in
scores given a starting and an ending index.
Complete method average below.
// returns the average (arithmetic mean) of the values in scores
// whose subscripts are between first and last, inclusive
// precondition:
private double average (int first, int last)
0 <= first <= last < scores.length
(b) Write the StudentRecord method hasImproved.
Complete method hasImproved below.
// returns true if each successive value in scores is greater
// than or equal to the previous value;
// otherwise, returns false
private boolean hasImproved ( )
(c) Write the StudentRecord method finalAverage.
In writing finalAverage, you must call the methods defined in parts (a) and (b). Assume that these
methods work as specified, regardless of what you wrote in parts (a) and (b).
Complete method finalAverage below.
// if the values in scores have improved, returns the average
// of the elements in scores with indexes greater than or equal
// to scores.length/2;
// otherwise, returns the average of all of the values in scores
public double finalAverage()
![4. Consider a grade-averaging scheme in which the final average of a student's scores is computed differently from
the traditional average if the scores have "improved." Scores have improved if each score is greater than or equal
to the previous score. The final average of the scores is computed as follows.
A student has n scores indexed from 0 to n-1. If the scores have improved, only those scores with indexes
greater than or equal to n/2 are averaged. If the scores have not improved, all the scores are averaged.
The following table shows several lists of scores and how they would be averaged using the scheme described
above.
Student Scores
Improved?
Final Average
50, 50, 20, 80, 53
No
(50 + 50 + 20 + 80 + 53) / 5.0 = 50.6
20, 50, 50, 53, 80
Yes
(50 + 53 + 80)/ 3.0 = 61.0
20, 50, 50, 80
Yes
(50 + 80) / 2.0 = 65.0
Consider the following incomplete StudentRecord class declaration. Each StudentRecord object
stores a list of that student's scores and contains methods to compute that student’s final average.
public class StudentRecord
{
private int[] scores; // contains scores.length values
// scores.length > 1
// constructors and other data fields not shown
// returns the average (arithmetic mean) of the values in scores
// whose subscripts are between first and last, inclusive
// precondition:
private double average (int first, int last)
{ /* to be implemented in part (a) */ }
0 <= first <= last < scores.length
// returns true if each successive value in scores is greater
// than or equal to the previous value;
// otherwise, returns false
private boolean hasImproved()
{ /* to be implemented in part (b) */ }
// if the values in scores have improved, returns the average
// of the elements in scores with indexes greater than or equal
// to scores.length/2;
// otherwise, returns the average of all of the values in scores
public double finalAverage()
{ /* to be implemented in part (c) */ }
}](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F32f8e8cc-ebb5-40be-bdab-d283b8a6a88b%2F66678a41-1e49-4e4a-b1be-74f47826df9d%2Fhyf4ku_processed.jpeg&w=3840&q=75)
Transcribed Image Text:4. Consider a grade-averaging scheme in which the final average of a student's scores is computed differently from
the traditional average if the scores have "improved." Scores have improved if each score is greater than or equal
to the previous score. The final average of the scores is computed as follows.
A student has n scores indexed from 0 to n-1. If the scores have improved, only those scores with indexes
greater than or equal to n/2 are averaged. If the scores have not improved, all the scores are averaged.
The following table shows several lists of scores and how they would be averaged using the scheme described
above.
Student Scores
Improved?
Final Average
50, 50, 20, 80, 53
No
(50 + 50 + 20 + 80 + 53) / 5.0 = 50.6
20, 50, 50, 53, 80
Yes
(50 + 53 + 80)/ 3.0 = 61.0
20, 50, 50, 80
Yes
(50 + 80) / 2.0 = 65.0
Consider the following incomplete StudentRecord class declaration. Each StudentRecord object
stores a list of that student's scores and contains methods to compute that student’s final average.
public class StudentRecord
{
private int[] scores; // contains scores.length values
// scores.length > 1
// constructors and other data fields not shown
// returns the average (arithmetic mean) of the values in scores
// whose subscripts are between first and last, inclusive
// precondition:
private double average (int first, int last)
{ /* to be implemented in part (a) */ }
0 <= first <= last < scores.length
// returns true if each successive value in scores is greater
// than or equal to the previous value;
// otherwise, returns false
private boolean hasImproved()
{ /* to be implemented in part (b) */ }
// if the values in scores have improved, returns the average
// of the elements in scores with indexes greater than or equal
// to scores.length/2;
// otherwise, returns the average of all of the values in scores
public double finalAverage()
{ /* to be implemented in part (c) */ }
}
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 2 images
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