North East University Bangladesh

Department of Computer Science and Engineering

Program: B.Sc. (Eng.) in CSE
Course: Digital Logic Design (Code: CSE-221)
Mid Semester Examination Summer 2018
Time: 1 hour 30 minutes Total Marks: 30
Answer any five(5) from the following questions
1. (A) How many bits are required to represent an eight-digit decimal number in BCD? [2 + 2 + 2]
Represent the decimal value 178 by its straight binary equivalent. Then encode the same
decimal number using BCD.
(B) Convert the number 0101 (binary) to its Gray code equivalent. Convert 0101 (Gray code)
to its binary number equivalent.
(C) Given the two binary numbers X = 1010100 and Y = 1000011, perform the subtraction
(a)X − Y and (b)Y − X by using 2’s complements.
2. (A) Find 16’s complement of (BABA)16 . [2 + 2 + 2]
(B) Convert (BABA)16 to binary and find the 2’s complement of the result.
(C) Convert the answer in (B) to hexadecimal and compare with the answer in (A).
3. (A) Reduce the Boolean expression to the indicated number of literals: [4 + 2]
0 0 0
(i) (x y + z) + z + xy + wz to three literals
0 0 0 0
(ii) A B(D + C D) + B(A + A CD) to one literal
0 0 0 0 0 0
(B) Find the complement of the functions F1 = x yz + x y z and F2 = x(y z + yz).
4. (A) Simplify the following Boolean function with three variable map: [2 + 2 + 2]
P
F (x, y, z) = (0, 1, 2, 3, 5).
(B) Simplify the following Boolean function, using variable map:
P
F (w, x, y, z) = (3, 7, 11, 13, 14, 15).
(C) Simplify the following Boolean function:
Q
F (A, B, C, D) = (0, 1, 2, 4, 5, 6, 8, 9, 10, 12).
P
5. (A) Simplify the following Boolean function F (A, B, C, D) = (1, 3, 7, 11, 15) together [3 + 3]
P
with the don’t-care conditions d(A, B, C, D) = (0, 2, 5).
(B) A four-bit binary number is represented as A3 A2 A1 A0 , where A3 , A2 , A1 and A0 represent
the individual bits and A0 is the LSB. Design a logic circuit that will produce a HIGH
output whenever the binary number is greater than (2)10 and less than (8)10 .
6. (A) Implement a full adder using two half adders. Show the output of each logic gate when [4 + 2]
the input to the full adders are: A = 1, B = 0 and Cin = 1.
(B) Design a full subtractor circuit. Show the simplified expression for each output.
7. (A) Design a 2-bit binary multiplier using half adders. Verify the output of the multiplier [4 + 2]
when the inputs are: A = 10 and B = 11.
(B) Perform BCD addition: (57)10 + (36)10 .

End of exam