Answer: Provided in the explanation section
Explanation:
The Question says;
Identify a logical operation (along
with a corresponding mask) that, when
applied to an input string of 8 bits,
produces an output string of all 0s if and
only if the input string is 10000001.
The Answer (Explanation):
XOR, exclusive OR only gives 1 when both the bits are different.
So, if we want to have all 0s, and the for input only 10000001, then we have only one operation which satisfies this condition - XOR 10000001. AND
with 00000000 would also give 0,
but it would give 0 with all the inputs, not just 10000001.
Cheers i hope this helped !!
Required: program to return the largest of three numbers.
pseudocode
input parameters, int A,B,C;
int T; // temporary storage
if (A>B) T=A;
else T=B;
if (T>C) print(T);
else print(C);
<span>Schema classes define all objects that AD can handle.</span>
Answer:
1 will be stored in result
Explanation:
Given
The lines of code
Required
Determine the value stored in result
The value stored in result is determine by the condition (x<3 && y ==6)
In the first line, the value of x is 2 and the value of y is 6
So: x<3 is true because x = 2 and 2 is less than 3
y == 6 is also true because y = 6 and 6 is equal to 6
So, the condition (x<3 && y ==6) is true and true will be saved in variable result
Because result is a Boolean variable which can only take true or false value
1 represents true
0 represents false
<em>So, 1 will be stored in result</em>
Its probably out dated our its been over used.
