Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- 1,The operation used to toggle a specific bit#(a)XOR(b)AND(c)OR(d)NOT#a
- 2,The result of ANDing 1 and 0 is#(a)0(b)1(c)10(d)11#a
- 3,Which operation sets all bits to 0?#(a)XOR with 0(b)AND with 0(c)OR with 0(d)NOT#a
- 4,What does left-shifting a binary number by 2 do?#(a)Divide by 2(b)Add 2(c)Multiply by 4(d)Subtract 2#c
- 5,How many bits are in a nibble?#(a)8(b)2(c)4(d)16#c
- 6,The binary representation of decimal 10 is#(a)1001(b)1010(c)1100(d)1110#b
- 7,What is the result of ORing 1010 with 0101?#(a)1111(b)1010(c)0000(d)1000#a
- 8,The complement of 1110 is#(a)0000(b)1111(c)0001(d)0010#c
- 9,What is the 2's complement of 0001?#(a)1111(b)1110(c)0001(d)0010#b
- 10,A circular left shift of 1010 by 1 position gives#(a)0101(b)1010(c)1111(d)1101#a
- 11,The binary result of 4 AND 5 is#(a)100(b)101(c)001(d)000#c
- 12,Which operation checks whether a bit is set?#(a)XOR(b)AND(c)OR(d)Shift Right#b
- 13,Right-shifting 16 by 2 results in#(a)2(b)4(c)8(d)16#c
- 14,The hexadecimal equivalent of binary 1110 is#(a)C(b)E(c)A(d)D#b
- 15,Which bitwise operation clears a specific bit?#(a)AND with 0(b)XOR(c)OR(d)NOT#a
- 16,Which operation flips all bits?#(a)AND(b)OR(c)NOT(d)XOR#c
- 17,XORing any number with itself results in#(a)The same number(b)0(c)1(d)Its complement#b
- 18,What is the decimal equivalent of binary 1011?#(a)9(b)10(c)11(d)12#c
- 19,The binary result of NOT 0000 is#(a)1111(b)0000(c)1000(d)0101#a
- 20,The result of XORing 0101 and 1010 is#(a)0000(b)1111(c)1010(d)1100#b
- 21,How many distinct values can be represented by 4 bits?#(a)8(b)16(c)4(d)32#b
- 22,A logical left shift of 0010 by 2 positions results in#(a)0100(b)1000(c)1100(d)1010#b
- 23,What does right-shifting a signed number fill the vacant bits with?#(a)0(b)1(c)Sign bit(d)Random bits#c
- 24,What does the OR operation between two bits yield?#(a)1 if both are 1(b)0 if both are 0(c)1 if either is 1(d)1 if both are 0#c
- 25,The binary result of 8 OR 4 is#(a)1111(b)1100(c)1000(d)1100#d
- 26,The binary result of XORing 1100 and 1010 is#(a)0110(b)1110(c)0000(d)0011#a
- 27,A bit mask is used to#(a)Toggle specific bits(b)Check specific bits(c)Set specific bits(d)All of the above#d
- 28,The 2's complement of binary 1010 is#(a)0110(b)0101(c)1010(d)0111#a
- 29,The operation to set a specific bit to 1 is#(a)AND(b)XOR(c)OR(d)NOT#c
- 30,A left shift of binary 0011 by 3 positions results in#(a)0000(b)1100(c)1000(d)0110#c
- 31,What is the result of NOT 1111?#(a)1111(b)0000(c)0001(d)1000#b
- 32,The binary representation of decimal 7 is#(a)0110(b)0111(c)1000(d)0101#b
- 33,The result of XORing 1111 and 1010 is#(a)0101(b)1010(c)1100(d)0000#a
- 34,What is the decimal equivalent of binary 1100?#(a)11(b)12(c)13(d)14#b
- 35,What does ANDing a number with its complement yield?#(a)All bits 1(b)All bits 0(c)The same number(d)The opposite number#b
- 36,A circular right shift of 1101 by 2 positions gives#(a)1110(b)0111(c)1011(d)0110#c
- 37,Which bitwise operation can be used to invert specific bits?#(a)OR(b)XOR(c)AND(d)NOT#b
- 38,The 1's complement of 1000 is#(a)0111(b)1001(c)1111(d)0000#a
- 39,What does XORing with 1 do to a bit?#(a)Inverts it(b)Sets it to 1(c)Clears it(d)Does nothing#a
- 40,What is the binary result of ANDing 1001 and 1100?#(a)1000(b)1100(c)0001(d)0100#a
- 41,Which operation is used to check if a number is odd?#(a)AND with 1(b)OR with 1(c)XOR with 1(d)NOT#a
- 42,The hexadecimal equivalent of binary 11111111 is#(a)FF(b)0F(c)F0(d)AA#a
- 43,The result of ORing 1001 and 0101 is#(a)1110(b)1001(c)1101(d)0100#c
- 44,A left shift by 1 bit is equivalent to#(a)Adding 1(b)Subtracting 1(c)Multiplying by 2(d)Dividing by 2#c
- 45,What is the result of XORing 1010 and 1010?#(a)0000(b)1010(c)1111(d)0101#a
- 46,The binary result of NOT 0011 is#(a)1100(b)0011(c)1111(d)1001#a
- 47,How many bits are in a byte?#(a)2(b)4(c)8(d)16#c
- 48,Which operation can be used to clear all bits?#(a)XOR with 0(b)AND with 0(c)OR with 1(d)Shift Right#b
- 49,The binary result of 4 OR 8 is#(a)1100(b)0100(c)1010(d)1000#a
- 50,The complement of 0101 is#(a)1010(b)0101(c)1111(d)0000#a
- 51,The binary result of 3 AND 5 is#(a)0001(b)0011(c)0101(d)0110#a
- 52,A right shift by 1 bit is equivalent to#(a)Dividing by 2(b)Multiplying by 2(c)Adding 1(d)Subtracting 1#a
- 53,The binary equivalent of decimal 15 is#(a)1111(b)1110(c)1100(d)1010#a
- 54,The result of XORing 1110 and 1001 is#(a)0111(b)1111(c)1000(d)0000#a
- 55,What is the 2’s complement of binary 0101?#(a)1011(b)1010(c)1101(d)0110#b
- 56,What does a circular left shift of 1011 by 2 produce?#(a)1110(b)0111(c)1101(d)1011#b
- 57,What does right-shifting a binary number by 3 do?#(a)Divide by 8(b)Multiply by 8(c)Divide by 3(d)Multiply by 3#a
- 58,The result of ORing 1100 and 0011 is#(a)1111(b)1001(c)1100(d)1010#a
- 59,Which operation flips all bits in a binary number?#(a)NOT(b)XOR(c)OR(d)AND#a
- 60,What is the binary equivalent of decimal 9?#(a)1010(b)1001(c)1101(d)1110#b
- 61,The binary result of XORing 1010 and 0101 is#(a)1111(b)1000(c)1010(d)0000#a
- 62,A logical AND operation is equivalent to#(a)Multiplication(b)Addition(c)Division(d)Subtraction#a
- 63,The binary representation of decimal 6 is#(a)0101(b)0110(c)1000(d)1011#b
- 64,Which operation sets a bit to 1 without affecting other bits?#(a)OR(b)XOR(c)AND(d)NOT#a
- 65,The result of NOT 0001 is#(a)1110(b)0000(c)1111(d)0010#a
- 66,A left shift of binary 0101 by 2 positions results in#(a)1010(b)0011(c)1100(d)0001#c
- 67,What is the decimal equivalent of binary 1001?#(a)7(b)8(c)9(d)10#c
- 68,The hexadecimal representation of binary 1010 is#(a)F(b)A(c)B(d)E#b
- 69,How many values can a 2-bit binary number represent?#(a)4(b)2(c)8(d)16#a
- 70,Which operation clears a specific bit to 0?#(a)AND with 0(b)XOR(c)OR(d)NOT#a
- 71,The binary result of ANDing 1111 and 1100 is#(a)1100(b)1111(c)0000(d)1001#a
- 72,A circular right shift of binary 1001 by 1 gives#(a)1100(b)1110(c)0100(d)1100#d
- 73,What is the result of XORing 1100 and 1100?#(a)1111(b)1010(c)0000(d)0111#c
- 74,The result of NOT 0110 is#(a)1001(b)0111(c)1010(d)1101#a
- 75,The 1’s complement of binary 1101 is#(a)0101(b)0010(c)1011(d)0110#d
- 76,A left shift operation by 2 bits is equivalent to#(a)Multiply by 2(b)Divide by 2(c)Multiply by 4(d)Divide by 4#c
- 77,The binary equivalent of decimal 12 is#(a)1101(b)1110(c)1100(d)1010#c
- 78,Which operation is used to check a specific bit in a number?#(a)XOR(b)AND(c)OR(d)NOT#b
- 79,The result of ORing 1000 and 1001 is#(a)1101(b)1001(c)1110(d)1000#b
- 80,A right shift by 3 bits is equivalent to#(a)Dividing by 4(b)Dividing by 8(c)Multiplying by 4(d)Adding 3#b
- 81,The binary result of 7 AND 3 is#(a)0001(b)0011(c)0101(d)0110#b
- 82,A left shift of binary 1010 by 3 positions results in#(a)10000(b)10100(c)10110(d)01010#b
- 83,The 2’s complement of binary 0110 is#(a)1010(b)1001(c)1110(d)1011#a
- 84,What is the result of XORing binary 1111 and 0000?#(a)1111(b)0000(c)1010(d)1100#a
- 85,A circular left shift of binary 1001 by 1 position gives#(a)1110(b)1010(c)1100(d)0011#d
- 86,Which operation can isolate the least significant bit of a binary number?#(a)AND(b)XOR(c)NOT(d)OR#a
- 87,The binary result of NOT 1010 is#(a)1111(b)1101(c)0101(d)0111#c
- 88,A logical OR operation outputs 1 when#(a)Both inputs are 0(b)Both inputs are 1(c)Either input is 1(d)Neither input is 1#c
- 89,The hexadecimal equivalent of binary 1111 is#(a)E(b)F(c)A(d)C#b
- 90,The binary representation of decimal 18 is#(a)10010(b)10101(c)11001(d)11100#a
- 91,What is the decimal equivalent of binary 1110?#(a)12(b)13(c)14(d)15#c
- 92,The result of ANDing binary 1010 and 0110 is#(a)0010(b)0111(c)1110(d)1010#a
- 93,The 1’s complement of binary 1000 is#(a)0111(b)1100(c)1110(d)1011#a
- 94,A left shift of binary 0011 by 2 results in#(a)1111(b)0110(c)1100(d)1000#c
- 95,The binary equivalent of decimal 20 is#(a)10100(b)10010(c)11010(d)11100#a
- 96,Which operation toggles a specific bit in a binary number?#(a)XOR(b)OR(c)AND(d)NOT#a
- 97,The binary result of XORing 1100 and 1010 is#(a)0110(b)1000(c)1111(d)0101#a
- 98,What is the result of ORing binary 0000 and 1111?#(a)0000(b)1010(c)1111(d)0110#c
- 99,A circular right shift of binary 0110 by 1 results in#(a)0011(b)0111(c)1110(d)1011#a
- 100,The result of NOT 1111 is#(a)0000(b)0110(c)1010(d)0001#a
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement