Answer:
The method is as follows:
public static int lastIndexOf(int [] numbers, int num){
int lastIndex = numbers[0];
for(int i =0; i<numbers.length;i+=num){
lastIndex = numbers[i];
}
return lastIndex;
}
Explanation:
This defines the method
public static int lastIndexOf(int [] numbers, int num){
This initializes the lastIndex to the first element of the array
int lastIndex = numbers[0];
This iterates through every "num" element of the array
for(int i =0; i<numbers.length;i+=num){
This gets the current index... until the last
lastIndex = numbers[i]; }
This returns the last
return lastIndex; }
Answer:
input number
calculate modulus of the number and 5
compare outcome to 0
if 0 then output "divisible by 5"
else output "not divisible by 5"
Explanation:
The modulo operator is key here. It returns the remainder after integer division. So 8 mod 5 for example is 3, since 5x1+3 = 8. Only if the outcome is 0, you know the number you divided is a multiple of 5.
Theory of knowledge (TOK) plays a special role in the International Baccalaureate® (IB) Diploma Programme (DP), by providing an opportunity for students to reflect on the nature of knowledge, and on how we know what we claim to know.
Ask google mam.............
