EDPT Boolean Logic and Binary Operations 5 — Questions and Answers
Question 1: What is the hexadecimal equivalent of binary 10110111?
- A7
- B6
- B7 (Correct answer)
- C7
Correct answer: B7
Split into nibbles: 1011=B and 0111=7, giving B7 in hex.
Question 2: Which Boolean law states that A AND (B OR C) = (A AND B) OR (A AND C)?
- Commutative law
- Associative law
- Distributive law (Correct answer)
- De Morgan's law
Correct answer: Distributive law
The distributive law allows AND to distribute over OR and vice versa.
Question 3: What is the result of shifting the binary number 0110 one position to the left?
- 0011
- 1100 (Correct answer)
- 1110
- 0111
Correct answer: 1100
A left shift by 1 moves all bits left and fills the rightmost bit with 0, giving 1100.
Question 4: If A=0 and B=1, what does the expression (A NOR B) evaluate to?
- 0 (Correct answer)
- 1
- A
- B
Correct answer: 0
A OR B = 0 OR 1 = 1, and NOR inverts it to 0.
Question 5: What is the minimum number of NAND gates needed to implement a NOT gate?
- 1 (Correct answer)
- 2
- 3
- 4
Correct answer: 1
A NAND gate with both inputs tied together acts as a NOT gate.
Question 6: What decimal value does the binary fraction 0.101 represent?
- 0.5
- 0.625 (Correct answer)
- 0.75
- 0.875
Correct answer: 0.625
0.101 = 0×0.5 + 1×0.25 + 0×0.125 = 0.5 + 0.125 = 0.625.
Question 7: De Morgan's theorem states that NOT(A OR B) is equivalent to:
- (NOT A) OR (NOT B)
- (NOT A) AND (NOT B) (Correct answer)
- NOT A OR B
- A AND B
Correct answer: (NOT A) AND (NOT B)
De Morgan's theorem: NOT(A OR B) = (NOT A) AND (NOT B).
EDPT Boolean Logic and Binary Operations 5
What is the hexadecimal equivalent of binary 10110111?