Answer:
A
Explanation:
Example: when scrolling through a list of shows, if you filter for action shows, only shows that match the action description would appear
One shortcoming of rapid application development (RAD) is a narrow focus, which might limit future development.
Answer:
4) 3 11 44
Explanation:
Given data
int [] val = { 3, 10, 44 };
The total number of parameters of given array are 3, so total length of array is also 3.
The indexing of array starts with '0', Therefore the indexes of array with length zero are: {0,1,2}
The value of array at index 0 is = 3
similarly,
value at index 1 = 10
value at index 2 = 44
Here, Int i = 1 is storing the value '1' in integer variable i.
In addition to that, any value of index 'i' of an array is selected using array[i].
Therefore,
val[i] is selecting the value of array located at index '1' because i = 1.
val[i] = val[1] = 10
val[i]+1 is selecting the value of array located at index 'i' that is (1) and adding 1 to it
=> val[i] = 10
=> val[i]+1 = 10+1 = 11
Finally,
val[i] = val[i]+1; is copying the val[i]+1 = 11 to value placed at index 1 (10). Hence, the output would be {3 11 44}. So 4th option is correct.
Answer:
The complete method is as follows:
public static int divBySum(int[] arr, int num){
int sum = 0;
for(int i:arr){
if(i%num == 0)
sum+=i;
}
return sum;
}
Explanation:
As instructed, the program assumes that arr has been declared and initialized. So, this solution only completes the divBySum method (the main method is not included)
This line defines the method
public static int divBySum(int[] arr, int num){
This line declares and initializes sum to 0
int sum = 0;
This uses for each to iterate through the array elements
for(int i:arr){
This checks if an array element is divisible by num (the second parameter)
if(i%num == 0)
If yes, sum is updated
sum+=i;
}
This returns the calculated sum
return sum;
}
Answer:
can anyone help me in computer
