MIDTERM EXAMINATION
Summer 2024
Department of Computer Science & Engineering
Independent University, Bangladesh (IUB)
CEN 204: Introduction to Computer Hardware and Digital Logic
CSC 204: Introduction to Computer Hardware and Digital Logic
CSE 204: Digital Logic Design
Total Marks: 50
Time Allowed: 75 Minutes
Answer all four (4) questions
Figure in bracket [] next to each question indicates marks for that
question
This question paper has three (3) pages (including cover page).
1.
You are given the following Boolean Algebra equation:
X' Y' Z + X' Y Z + X Y' = X Y' + X' Z
(a)
Show the equivalence using a Truth Table.
[5]
(b)
Prove the equivalence using the theorems of Boolean Algebra.
[5]
(10 marks) [CO1]
2.
You are given the following function:
F(A, B, C, D) = m(1, 3, 10, 11) + x (8, 9).
(a)
Simplify the function using a K-map.
[5]
(b)
Implement the function using basic gates. (Draw the logic diagram.)
[5]
(10 marks) [CO1]
Page 2 of 3
3.
Function E is defined by the following truth table:
X
0
0
0
0
1
1
1
1
Y
0
0
1
1
0
0
1
1
Z
0
1
0
1
0
1
0
1
E
0
1
0
0
1
0
1
1
(a)
List the minterms of E using the “m()” notation.
[2]
(b)
List the maxterms of E using the “M()” notation.
[2]
(c)
List the minterms of ~E, using the “m()” notation.
[2]
(d)
Starting from the minterm expansion form of ~E (obtained in part (c)), show
that it is equivalent to the maxterm expansion form of E (obtained in part
(b)).
[4]
(10 marks) [CO1]
4.
Design a 3-bit majority detector.
(The 1-bit output should be high if there are more 1s than 0s in the inputs, and low
if there are more 0s than 1s in the inputs.)
(a)
First derive the Truth Table.
[5]
(b)
Then show the canonical expression.
[5]
(c)
Simplify the expression using a K-map.
[5]
(d)
Draw the logic circuit.
[5]
(20 marks) [CO1]
THE END
Page 3 of 3