ASSIGNMENT 1: DIGITAL LOGIC CIRCUIT
LAST DATE OF SUMBISSION 17 SEP 2024
FULL MARKS 10
Question 1:
a) Convert the following numbers into their respective representations:
(256)_10 to binary and hexadecimal
(11001)_2 to octal and decimal
(A5C)_16 to decimal and binary
b) Explain the concept of the general radix 'r' number system with an example of base-5.
Question 2:
a) Perform the following binary arithmetic operations using signed numbers:
Add (1101)_2 and (1011)_2 (in 2’s complement form).
Subtract (1001)_2 from (1111)_2 (in signed magnitude form).
b) Explain the process of detecting errors using parity bits. Provide an example.
UNIT 2: Boolean Algebra and Logic Circuits
Question 3:
Simplify the following Boolean function using Boolean theorems and Karnaugh Map (K-map):
F(A,B,C,D)=∑(0,1,2,5,8,9,10)F(A, B, C, D) = \sum(0, 1, 2, 5, 8, 9, 10)F(A,B,C,D)=∑(0,1,2,5,8,9,10)
Question 4:
a) Explain the concept of Minterms and Maxterms with an example.
b) Design a logic circuit using NAND gates only for the Boolean expression:
F(A,B,C)=A′B+BC′F(A, B, C) = A'B + BC'F(A,B,C)=A′B+BC′
Question 5: What is the significance of the Karnaugh Map (K-Map) in digital logic minimization? Briefly
explain its advantages over the algebraic simplification method.
Question 6: Solve the following Boolean expression using a 4-variable K-Map and simplify it to its
minimal form:
F(A,B,C,D)=∑m(0,1,2,5,7,8,9,10,14)F(A, B, C, D) = \sum m(0, 1, 2, 5, 7, 8, 9, 10,
14)F(A,B,C,D)=∑m(0,1,2,5,7,8,9,10,14)
Question 7: Explain how don't care conditions can be used in K-Map minimization. Provide an example
of how don't care terms help to simplify a Boolean function
Question 8: Briefly describe the Quine McCluskey Method (Tabular Method) for Boolean function
minimization. How does it differ from the K-Map method?
Question 9: Design a 2-bit binary adder using half adders or full adders. Explain the design process and
provide the Boolean expressions for the sum and carry.
Question 10: What is a multiplexer? Design a 4-to-1 multiplexer using logic gates. Include the truth table
and the Boolean equation.
