Answer:
in my opinion 4
Explanation:
when the system is available to users
(sorry and thanks)
// This command takes input from the user.
Scanner input = new Scanner(System.in);
int response= input.nextInt();
// Making the variables required
int noCount =0 ;
int yesCount =0;
// Checking the response if it is 1 or 2 and reporting accordingly
if(response == 1 || response ==2){
yesCount+=1;
System.out.println("YES WAS RECORDED");
}
// Checking if the input is 3 or 4 then printing the required lines
else if (response == 3 || response ==4){
noCount+=1;
System.out.println("NO WAS RECORDED");
}
// if the input is not valid than printing INVALID
else{
System.out.println("INVALID");
}
get int input for a
get int input for b
get string input for operator
if a is not int or b is not int throw exception and print error
if operator is not * / // or % throw exception and print error
if operator is * do multiplication of a and b and make answer c
else if operator is / do division of a and b and make answer c
else if operator is // do floor division of a and b and make answer c
else if operator is % do floor modulo of a and b and make answer c
print c
Answer: see description
Explanation:
first we accommodate the bit pattern in a matrix of 4x4 which is the minimum length checksum field, now with even parity two-dimensional scheme we need to complete this matrix by adding one row and one column by adding at the end of each row a 1 or a 0 to complete pairs of 1's:
we have
![\left[\begin{array}{cccc}1&1&1&0\\0&1&1&0\\1&0&0&1\\1&1&0&1\end{array}\right]](https://tex.z-dn.net/?f=%5Cleft%5B%5Cbegin%7Barray%7D%7Bcccc%7D1%261%261%260%5C%5C0%261%261%260%5C%5C1%260%260%261%5C%5C1%261%260%261%5Cend%7Barray%7D%5Cright%5D)
so we complete with this, adding a row at the end which matches a pair number of 1's
![\left[\begin{array}{ccccc}1&1&1&0&1\\0&1&1&0&0\\1&0&0&1&0\\1&1&0&1&1\\1&1&0&0&0\end{array}\right]](https://tex.z-dn.net/?f=%5Cleft%5B%5Cbegin%7Barray%7D%7Bccccc%7D1%261%261%260%261%5C%5C0%261%261%260%260%5C%5C1%260%260%261%260%5C%5C1%261%260%261%261%5C%5C1%261%260%260%260%5Cend%7Barray%7D%5Cright%5D)
