Respuesta :
The bitwise AND of 101 1110, 010 0001 is 000 0000.
The bitwise OR of 101 1110, 010 0001 is 111 1111.
The bitwise XOR of 101 1110, 010 0001 is 111 1111.
How to find the bitwise or, bitwise and, and bitwise xor?
Bitwise Operator:
Working with individual bits, which are the smallest units of data in a computing system, is referred to as the "bitwise" level of operation. The binary value of each bit is either 0 or 1. A bitwise operation manipulates a binary number, a bit string, or an array of bits down to their individual bits. It is a quick and easy action that is directly supported by the CPU and fundamental to higher-level arithmetic operations.
Bitwise AND:
two numbers are used as operands, and AND is performed on each bit of the two numbers. Only when both bits are 1 will AND produce a result of 1. If the matching bits of two operands are 1, the output of a bitwise AND is 1. The result of the corresponding bit is evaluated to 0 if either bit of an operand is 0.
Bitwise OR:
using two numbers as the operands, OR is performed on each bit of the two numbers. If any of the two bits is 1, the result of OR is 1. If at least one corresponding bit of two operands is 1, the output of a bitwise OR is 1. The bitwise OR operator is represented by | in C programming.
Bitwise XOR:
Bitwise XOR also known as bitwise exclusive OR.
XORs each bit of the operands of two numbers when two numbers are used as the operands. If the two bits are distinct, XOR produces a value of 1. If the corresponding bits of two operands are opposite, the bitwise XOR operator produces a value of 1. It is indicated by ^ .
0 OR 0 = 0 0 AND 0 = 0 0 XOR 0 = 0
0 OR 1 = 1 0 AND 1 = 0 0 XOR 1 = 1
1 OR 0 = 1 1 AND 0 = 0 1 XOR 0 = 1
1 OR 1 = 1 1 AND 1 = 1 1 XOR 1 = 0
The bitwise AND of 101 1110, 010 0001 is 000 0000.
The bitwise OR of 101 1110, 010 0001 is 111 1111.
The bitwise XOR of 101 1110, 010 0001 is 111 1111.
Learn more about bitwise operator from here:
https://brainly.in/question/16103279
#SPJ4
