Answer: provided in the explanation section
Explanation:
import java.util.*;
class Mutation {
public static int[] mutateTheArray(int n , int[] a)
{
int []b = new int[n];
for(int i=0;i<n;i++)
{
b[i]=0;
if(((i-1)>=0)&&((i-1)<n))
b[i]+=a[i-1];
if(((i)>=0)&&((i)<n))
b[i]+=a[i];
if(((i+1)>=0)&&((i+1)<n))
b[i]+=a[i+1];
}
return b;
}
public static void main (String[] args) {
Scanner sc = new Scanner(System.in);
int n= sc.nextInt();
int []a = new int [n];
for(int i=0;i<n;i++)
a[i]=sc.nextInt();
int []b = mutateTheArray(n,a);
for(int i=0;i<n;i++)
System.out.print(b[i]+" ");
}
}
cheers i hope this helped !!
Answer:
public static void randomize(RegularPolygon r){
int side = (int)((20-10) * Math.random()) + 10;
int length = (int)((12-5) * Math.random()) + 5;
// assuming the regularpolygon class has setSide and setLength methods.
r.set.Side(side);
r.setLength(length);
}
Explanation:
The randomize method is used to access and change the state of the RegularPolygon class attributes sides and length. The method accepts the class as an argument and assigns a random number of sides and length to the polygon object.
I have no idea, i just need points. Good luck
Store b. This will have her paying 36.00 for the rug. Store A she will pay 40.50
Answer:
code = 010100000001101000101
Explanation:
Steps:
The inequality yields 
, where M = 16. Therefore,
The second step will be to arrange the data bits and check the bits. This will be as follows:
Bit position number Check bits Data Bits
21 10101
20 10100
The bits are checked up to bit position 1
Thus, the code is 010100000001101000101
