35 OR 7 is 39.
To see how this works, write the values in binary, one directly above the other:
00100011 (35)
00000111 (7)
Each column provides the two input operands for the OR operator. The output is derived from the following truth table:
0 or 0 = 0
0 or 1 = 1
1 or 0 = 1
1 or 1 = 1
Thus when the column has two 0s, we output a 0, otherwise we output a 1. Repeating this for all columns we find the following output:
00100111
Converting this to decimal we can see that 35 OR 7 must be 39.
Bitwise OR.
The bitwise & operator performs a bitwise AND operation. The bitwise ^ operator performs a bitwise exclusive OR operation. The bitwise | operator performs a bitwise inclusive OR operation.
There are three logical operators in C; AND (&), OR (|), and NOT (^). These are the bitwise versions. The combinatorial versions are &&, , and !.
False: highest precedence & bitwise AND ^ bitwise XOR | bitwise OR lowest precedence
The bitwise XOR operator is ^, or shift 6. The bitwise XOR assignment operator is ^=.
They perform bitwise operations like AND (&), OR (|), XOR (^) and NOT (~).
Bitwise OR.
in C you can manipulate the individual bits of a data item. << leftwise shift >> rightwise shift & bitwise AND | bitwise OR ~ bitwise complement (flips all bits) I can't go intoa tutorial here in how to use these, but google it - i just did and there's tons of info out there.
The bitwise & operator performs a bitwise AND operation. The bitwise ^ operator performs a bitwise exclusive OR operation. The bitwise | operator performs a bitwise inclusive OR operation.
question: find the percentage A is of B or, 7 (A) is what percente of 35 (B) (B-A)/B x 100 =C. then subtract C from 100 B-A 35-7=28 /B 28/35=0.8 x 100 =C 0.8 x 100=80 - C 100-80=20. so, 7 is 20 percent of 35
There are three logical operators in C; AND (&), OR (|), and NOT (^). These are the bitwise versions. The combinatorial versions are &&, , and !.
There is no such thing. Logic is bitwise operation, not a data type.
False: highest precedence & bitwise AND ^ bitwise XOR | bitwise OR lowest precedence
The bitwise XOR operator is ^, or shift 6. The bitwise XOR assignment operator is ^=.
num1 <<= 1; /* shift left */
C=7. I'll show my work. 5c-8=27. 5c=35. C=7
-5c-6=29 29 + 6= 35 -5c=35 c=7