Answer:
hello please join the
Explanation:
you should join the green alien squad in gta
Answer:
public class array{
public static void main(String []args){
int[] array = {2,4,7,1,9};
int num_vals = array.length;
for(int i=0;i<num_vals;i++){
System.out.println(array[i] + " ");
}
for(int i=num_vals-1;i>=0;i--){
System.out.println(array[i] + " ");
}
}
}
Explanation:
First create the class in the java programming.
Then create the main function and declare the array with values.
Store the size of array in num_vals variable by using the function array.length.
create a for loop to iterate the each element in the array and then print on the screen with spaces and newline.
it traverse the loop from first to last.
Then, again create the for loop to iterate the each element in the array and then print on the screen with spaces and newline but the traversing start from last to first.
The connector for ethernet cables is called RJ45. for phone jack is RJ11. Although they look the same, the RJ11 has only 4 leads, as opposed to 9 leads in RJ45. Also, RJ11 is not as wide as RJ45, so the connector does not fit.
Even if it would, the signals would be totally incompatible, so no success can be expected.
Answer:
False
Explanation:
The scheme where you can find the greatest common divisor (GCD) of two integers by repetitive application of the division algorithm is known as Euclidean Algorithm.
The Euclidean Algorithm for calculating GCD of two numbers X and Y can be given as follows:
- If X=0 then GCD(X, Y)=Y since the Greatest Common Divisor of 0 and Y is Y.
- If Y=0 then GCD(X, Y)=X since the Greates Common Divisor of 0 and X is X.
- Let R be the remainder of dividing X by Y assuming X > Y. (R = X % Y)
- Find GCD( Y, R ) because GCD( X, Y ) = GCD(Y, R ).
- Repeat the above steps again till R = 0.
