Which of the following is the correct binary representation of the number 2?
1 answer:
You might be interested in
Answer:
Following are the method definition to this question:
public class Neg //defining class Neg
{
public static void replaceEvens(int[] numbers) //defining a method replaceEvens that accepts array
{
int i; //defining integer variable
for(i = 0 ; i < numbers.length; i++) //defining foop to counts number
{
if(numbers[i]%2 == 0) //defining condition to check number is even
{
numbers[i] = numbers[i] * -1; //multiply the number by -1
}
}
for(i = 0 ; i < numbers.length; i++) // defining loop print array
{
System.out.print(numbers[i] + " "); //print array
}
}
public static void main(String[] as)//defining main method
{
int[] numbers = {12, 10, 18, 5, 2,22}; //defining array numbers and assign value
System.out.println("Elements of array: "); //print message
for(int i = 0 ; i < numbers.length ; i++) //defining loop to print message
{
System.out.print(numbers[i] + " "); //print array
}
System.out.println("\n After replaceEvens"); //print message
replaceEvens(numbers); //calling method replaceEvens
}
}
Output:
please find the attachment.
Explanation:
- In the given program a static method replaceEvens is declared, in which array numbers pass as the parameter, inside the for method loop is declared, which counts array number in this loop if block is defined, that check-in array there is an even number.
- In the condition is true it will multiply the number by -1, and output side the loop it will define another loop to print its value.
- Inside the main method, a number array is declared, that first prints its value then call the method to print its change value.
