63Building Java Programs 3rd Edition Reges Test Bank pdf download
63Building Java Programs 3rd Edition Reges Test Bank pdf download
Bank download
https://testbankdeal.com/product/building-java-programs-3rd-
edition-reges-test-bank/
https://testbankdeal.com/product/building-java-programs-a-back-to-
basics-approach-4th-edition-reges-test-bank/
https://testbankdeal.com/product/building-java-programs-a-back-to-
basics-approach-4th-edition-reges-solutions-manual/
https://testbankdeal.com/product/juvenile-justice-policies-programs-
and-practices-3rd-edition-taylor-test-bank/
https://testbankdeal.com/product/managing-performance-through-
training-and-development-6th-edition-saks-solutions-manual/
Statistics for Business Decision Making and Analysis 1st
Edition Stine Solutions Manual
https://testbankdeal.com/product/statistics-for-business-decision-
making-and-analysis-1st-edition-stine-solutions-manual/
https://testbankdeal.com/product/introductory-chemistry-1st-edition-
revell-test-bank/
https://testbankdeal.com/product/introduction-to-quantum-
mechanics-3rd-edition-griffiths-solutions-manual/
https://testbankdeal.com/product/i-never-knew-i-had-a-choice-
explorations-in-personal-growth-10th-edition-corey-test-bank/
https://testbankdeal.com/product/modern-portfolio-theory-and-
investment-analysis-9th-edition-elton-test-bank/
Trigonometry A Unit Circle Approach 10th Edition Sullivan
Solutions Manual
https://testbankdeal.com/product/trigonometry-a-unit-circle-
approach-10th-edition-sullivan-solutions-manual/
Sample Final Exam #8
(Summer 2009; thanks to Victoria Kirst)
1. Array Mystery
Consider the following method:
public static void arrayMystery(int[] a) {
for (int i = 1; i < a.length - 1; i++) {
a[i] = a[i + 1] + a[i - 1];
}
}
Indicate in the right-hand column what values would be stored in the array after the method arrayMystery executes
if the integer array in the left-hand column is passed as a parameter to it.
Original Contents of Array Final Contents of Array
int[] a1 = {3, 7};
arrayMystery(a1); _____________________________
1 of 8
2. Reference Semantics Mystery
(Missing; we didn't give this type of question that quarter.)
3. Inheritance Mystery
Assume that the following classes have been defined:
public class Denny extends John { public class Michelle extends John {
public void method1() { public void method1() {
System.out.print("denny 1 "); System.out.print("michelle 1 ");
} }
}
public String toString() {
return "denny " + super.toString(); public class John extends Cass {
} public void method2() {
} method1();
System.out.print("john 2 ");
public class Cass { }
public void method1() {
System.out.print("cass 1 "); public String toString() {
} return "john";
}
public void method2() { }
System.out.print("cass 2 ");
}
Given the classes above, what output is produced by the following code?
Cass[] elements = {new Cass(), new Denny(), new John(), new Michelle()};
for (int i = 0; i < elements.length; i++) {
elements[i].method1();
System.out.println();
elements[i].method2();
System.out.println();
System.out.println(elements[i]);
System.out.println();
}
2 of 8
4. File Processing
Write a static method called runningSum that accepts as a parameter a Scanner holding a sequence of real numbers
and that outputs the running sum of the numbers followed by the maximum running sum. In other words, the nth
number that you report should be the sum of the first n numbers in the Scanner and the maximum that you report
should be the largest such value that you report. For example if the Scanner contains the following data:
3.25 4.5 -8.25 7.25 3.5 4.25 -6.5 5.25
3 of 8
5. File Processing
Write a static method named plusScores that accepts as a parameter a Scanner containing a series of lines that
represent student records. Each student record takes up two lines of input. The first line has the student's name and
the second line has a series of plus and minus characters. Below is a sample input:
Kane, Erica
--+-+
Chandler, Adam
++-+
Martin, Jake
+++++++
Dillon, Amanda
++-++-+-
The number of plus/minus characters will vary, but you may assume that at least one such character appears and that
no other characters appear on the second line of each pair. For each student you should produce a line of output with
the student's name followed by a colon followed by the percent of plus characters. For example, if the input above is
stored in a Scanner called input, the call of plusScores(input); should produce the following output:
Kane, Erica: 40.0% plus
Chandler, Adam: 75.0% plus
Martin, Jake: 100.0% plus
Dillon, Amanda: 62.5% plus
4 of 8
6. Array Programming
Write a method priceIsRight that accepts an array of integers bids and an integer price as parameters. The method
returns the element in the bids array that is closest in value to price without being larger than price. For example, if
bids stores the elements {200, 300, 250, 999, 40}, then priceIsRight(bids, 280) should return 250,
since 250 is the bid closest to 280 without going over 280. If all bids are larger than price, then your method should
return -1.
The following table shows some calls to your method and their expected results:
Arrays Returned Value
int[] a1 = {900, 885, 989, 1}; priceIsRight(a1, 880) returns 1
int[] a2 = {200}; priceIsRight(a2, 320) returns 200
int[] a3 = {500, 300, 241, 99, 501}; priceIsRight(a3, 50) returns -1
int[] a2 = {200}; priceIsRight(a2, 120) returns -1
You may assume there is at least 1 element in the array, and you may assume that the price and the values in bids will
all be greater than or equal to 1. Do not modify the contents of the array passed to your method as a parameter.
5 of 8
7. Array Programming
Write a static method named compress that accepts an array of integers a1 as a parameter and returns a new array
that contains only the unique values of a1. The values in the new array should be ordered in the same order they
originally appeared in. For example, if a1 stores the elements {10, 10, 9, 4, 10, 4, 9, 17}, then
compress(a1) should return a new array with elements {10, 9, 4, 17}.
The following table shows some calls to your method and their expected results:
Array Returned Value
int[] a1 = {5, 2, 5, 3, 2, 5}; compress(a1) returns {5, 2, 3}
int[] a2 = {-2, -12, 8, 8, 2, 12}; compress(a2) returns {-2, -12, 8, 2, 12}
int[] a3 = {4, 17, 0, 32, -3, 0, 0}; compress(a3) returns {4, 17, 0, 32, -3}
int[] a4 = {-2, -5, 0, 5, -92, -2, 0, 43}; compress(a4) returns {-2, -5, 0, 5, -92, 43}
int[] a5 = {1, 2, 3, 4, 5}; compress(a5) returns {1, 2, 3, 4, 5}
int[] a6 = {5, 5, 5, 5, 5, 5}; compress(a6) returns {5}
int[] a7 = {}; compress(a7) returns {}
Do not modify the contents of the array passed to your method as a parameter.
6 of 8
8. Critters
Write a class Caterpillar that extends the Critter class from our assignment, along with its movement behavior.
Caterpillars move in an increasing NESW square pattern: 1 move north, 1 move east, 1 move west, 1 move south,
then 2 moves north, 2 moves east, etc., the square pattern growing larger and larger indefinitely. If a Caterpillar
runs into a piece of food, the Caterpillar eats the food and immediately restarts the NESW pattern. The size of the
Caterpillar’s movement is also reset back to 1 move in each direction again, and the increasing square pattern
continues as before until another piece of food is encountered.
Here is a sample movement pattern of a Caterpillar:
• north 1 time, east 1 time, south 1 time, west 1 time
• north 2 times, east 2 times, south 2 times, west 2 times
• north 3 times, east 3 times, south 3 times, west 3 times
• (runs into food)
• north 1 time, east 1 time, south 1 time, west 1 time
• north 2 times, east 1 time
• (runs into food)
• north 1 time
• (runs into food)
• north 1 time, east 1 time, south 1 time, west 1 time
• north 2 times, east 2 times, south 2 times, west 2 times
• (etc.)
Write your complete Caterpillar class below. All other aspects of Caterpillar besides eating and movement
behavior use the default critter behavior. You may add anything needed to your class (fields, constructors, etc.) to
implement this behavior appropriately.
7 of 8
9. Classes and Objects
Suppose that you are provided with a pre-written class Date as // Each Date object stores a single
described at right. (The headings are shown, but not the method // month/day such as September 19.
bodies, to save space.) Assume that the fields, constructor, and // This class ignores leap years.
methods shown are already implemented. You may refer to them
or use them in solving this problem if necessary. public class Date {
private int month;
Write an instance method named subtractWeeks that will be private int day;
placed inside the Date class to become a part of each Date
object's behavior. The subtractWeeks method accepts an // Constructs a date with
integer as a parameter and shifts the date represented by the Date // the given month and day.
public Date(int m, int d)
object backward by that many weeks. A week is considered to be
exactly 7 days. You may assume the value passed is non- // Returns the date's day.
negative. Note that subtracting weeks might cause the date to public int getDay()
wrap into previous months or years.
// Returns the date's month.
For example, if the following Date is declared in client code: public int getMonth()
Date d = new Date(9, 19);
// Returns the number of days
The following calls to the subtractWeeks method would // in this date's month.
modify the Date object's state as indicated in the comments. public int daysInMonth()
Remember that Date objects do not store the year. The date
before January 1st is December 31st. Date objects also ignore // Modifies this date's state
// so that it has moved forward
leap years.
// in time by 1 day, wrapping
Date d = new Date(9, 19); // around into the next month
d.subtractWeeks(1); // d is now 9/12 // or year if necessary.
d.subtractWeeks(2); // d is now 8/29 // example: 9/19 -> 9/20
d.subtractWeeks(5); // d is now 7/25 // example: 9/30 -> 10/1
d.subtractWeeks(20); // d is now 3/7 // example: 12/31 -> 1/1
d.subtractWeeks(110); // d is now 1/26
public void nextDay()
// (2 years prior)
8 of 8
Other documents randomly have
different content
Inc.; 1Jul52; LP1833.
MALICE DOMESTIC. SEE Alfred Hitchcock Presents.
MALIGNANT TUMORS OF THE LUNGS. SEE Respiratory
Cancer.
MALLEABLE METALS. Albion Malleable Iron Co. 13 min., sd.,
color, 16mm. Kodachrome. Appl. authors: James F. Lybarger, G.
Russell Carrier. © Albion Malleable Iron Co.; 23Sep54; MU5778.
MALTA STORY. British Film Makers, London. Released in the U.
S. by United Artists Corp. 98 min., sd., b&w, 35mm. © British
Film Makers, Ltd.; 19Jun53; LP4368.
MAMA BUFANO’S. SEE Fireside Theatre.
MAMA GERMAINE. SEE Navy Log.
MAMA LOVES MAMBO. SEE The Honeymooners.
MAMA’S REUNION. SEE Those Whiting Girls, no. 7.
MAMBO. Produzione Ponti De Laurentiis. Rome. Released in the
U. S. by Paramount Pictures Corp. 94 min., sd., b&w, 35mm. ©
Paramount Pictures Corp.; 13Nov54; LP4586.
MAMBO. SEE
Confidential File.
Our Miss Brooks, no. 88.
M-Squad.
26 Men.
Trailer.
1. The Spirit Rider.
2. Savage Fury.
3. Mask of El Latigo.
4. The Murder Cave.
5. The Stone Guillotine.
6. Flame and Battle.
7. Double Ambush.
8. The Blazing Barrier.
9. The Silent Informer.
10. Window of Death.
11. The Fatal Masquerade.
12. Redskin Raiders.
testbankdeal.com