Digital Logic Design Msc IT MidTerm Past paper 2016 IT HUB

Objective Part
(Note: Attempt all questions.)

Q.1 Write a short answer for each question. 2×16=32
i. Convert $ (111011)_2 $ into Decimal
ii. Convert $ (1101)_2 $ into binary.
iii. Represent $ (1110000100110110)_2 $ into hexadecimal number system.
iv. Explain the term BCD code?
v. Implement the logic circuit from the given Boolean expression. Do not use AND, OR, and NOT Gates.
$ X = A + B + AB’ $
vi. Convert $ (225.225) $ into Binary, Decimal, Hexadecimal Format?
vii. Convert $ (110.1)_2 = 0_8 $
viii. Simplify $ xy + xy’ $
ix. Minimize the Expression $ ABC + AB’ + ABC $
x. List the truth table $ F = xy + xy’ + y’z $
xi. Explain the term don’t care condition?
xii. Explain Exclusive OR function?
xiii. Explain the term Universal gates?
xiv. Implement the function $ F = xyz + x’z + y’z $
xv. Explain the terms SOP and POS.
xvi. Prove that exclusive-OR is the complement of exclusive-NOR?

Subjective Part
(Attempt any three questions 3×16=48)

Question No. 2:
(a) Express the following function in a sum of minterms and a product of maxterms.
$ F(A, B, C) = 1 $

(b) Simplify the Boolean function by using Tabulation method
$ F = \Sigma(0, 1, 2, 8, 10, 11, 14, 15) $

Question No. 3:
(a) Find the complement of $ F = wx + yz $; then show that $ FF’ = 0 $ and $ F + F’ = 1 $
i. $ Y = [(u+x)(y+z)] $
ii. $ Y = [(u+x)(z+y+xu)] $

Question No. 4:
(a) Simplify using K-map $ F(w, x, y, z) = \Sigma(3, 7, 11, 13, 14, 15) $
(b) Show that the dual of the exclusive-OR is equal to its complement.

Question No. 5:
Implement the following Boolean expression with exclusive-OR and AND gates:
$ F = AB’CD’ + A’BCD + AB’C’D + A’B’C’D $

Good Luck…