Consider the following (supposedly) immutable class: public…
Consider the following (supposedly) immutable class: public final class Immutable { private final String string; private final int x; private final List list; public Immutable(String string, int x, List list) { this.string = string; // Line A this.x = x; // Line B this.list = new ArrayList (list); // Line C } public getList() { return list; } // Line D public getInt() { return x; } // Line E public getString() { return string; } // Line F } Which line(s) of code is/are a problem with respect tothe immutability of class Immutable (select all correct answer(s) and no incorrect answer(s) to get credit):
Read DetailsOnline Editor Link (Fork this): LINK Alternatively, you can…
Online Editor Link (Fork this): LINK Alternatively, you can also use the editor here: LINK Write a function pattern(h), where h is the parameter that defines the height of the following pattern. The pattern prints out the half-hollow pyramid, as shown in the test cases below. Note: You do not need to return anything from the function, just have it print directly. pattern(5): * ** * * * ****** pattern(6): * ** * * * * * ******* pattern(7): * ** * * * * * * * ********
Read DetailsOnline Editor Link (Fork this): LINK Alternatively, you can…
Online Editor Link (Fork this): LINK Alternatively, you can also use the editor here: LINK The multiplicative persistence of a number is the count of steps needed to reduce it to a single digit by multiplying its digits together repeatedly. For example, the multiplicative persistence of 39 is 3 because: Step 1: 3 × 9 = 27 Step 2: 2 × 7 = 14 Step 3: 1 × 4 = 4 And 4 is a single-digit number, so we stop after 3 steps. Write a function calculate_persistence(num) that takes a positive integer as input and returns its multiplicative persistence. Examples: calculate_persistence(4) should return 0 (it’s already a single-digit number, so no steps are needed) calculate_persistence(39) should return 3 (as shown in the example above) calculate_persistence(999) should return 4 (9×9×9=729, 7×2×9=126, 1×2×6=12, 1×2=2) calculate_persistence(77) should return 4 (7×7=49, 4×9=36, 3×6=18, 1×8=8) Your function should work for any positive integer.
Read Details