Question 6
(a) With the help of a logic diagram and a truth table explain a Decimal to Binary [4]
encoder.
(b) Derive a Boolean expression for the logic diagram given below and simplify it. [3] Name
A A
B
B B
output
C
A C
B
(c) Reduce the following expression using Boolean laws: [3]
F(A, B, C, D) =(A + C) (A + C) (A+ B+ CD)
Comments of Examiners
(a) Some candidates drew the AND gate instead of OR gate.
Some drew the octal / hexadecimal encoder instead of Suggestions for teachers
decimal encoder. However, most of the candidates Practice should be given in
answered this part correctly. The working / explanation drawing the encoders along with
was shown in some cases which was not required. the expression, truth table and
(b) Most of the candidates answered this part well except logic circuit / diagram.
for a few who were not able to simplify the expression. More practice should be given in
(c) Most of the candidates attempted this part correctly deriving expressions from a
barring a few who gave vague reduction. circuit diagram and simplifying
it. Laws must be implemented for
minimizing expressions.
All related laws of Boolean
algebra should be practiced for
reducing expressions.
152