Subject Code & Name : EC23312 – DIGITAL SYSTEM DESIGN
Year & Semester : II/III
Departments: ECE
Assignment I
Date of Announcement:25/08/2025
Date of Submission: 29/08/2025
Note: Submit the hardcopy and Upload the Softcopy in the Moodle on or before deadline.
SET 1 (Roll No: 1 - 10)
1. Simplify the following Boolean Expression using suitable K-Map and draw the
logic diagram for the simplified expression using NOR gates only.
a. F=∑m(0,2,3,8,9,12,13,15)
b. F=ПM(0,1,3,4,6,7,8,9,12,15,17,19,23,24,26,28,29,30) + d(2,13,14,18,22,25)
2. Simplify the following minterms using Tabulation method and verify using K-
Map.
a. F(W,X,Y,Z)= ∑m(0,1,2,4,5,6,8,12,13,14)
3. Simplify the following Boolean expression using suitable K-map and draw the
logic diagram for the simplified expression using NAND gates only.
a. F=П(0,2,3,8,9,12,13,15)
b. F=(A+B+C)(A+B+C)(A+B+C)(A+B+C)(A+B+C)
SET 2 (Roll No: 11 - 20)
1. (i). Encode your roll number into:
a. Binary, Octal, Hexadecimal
(ii). Convert the given octal number 745 into:
a) Binary
b) Hexadecimal
2. Simplify the following expressions using Boolean laws:
I. A+ABA + ABA+AB
II. A(A′+B)A(A' + B)A(A′+B)
III. (A+B)(A+B′)(A + B)(A + B')(A+B)(A+B′)
Justify each step with the law used (e.g., Absorption Law, Distributive Law).
Once simplified, draw a minimized logic circuit for each.
3. You receive a black-box circuit with 3 inputs (A, B, C) and 1 output (Y).
You are told the output behaves as follows:
For inputs 000, 011, 101, and 111, the output is 1.
For inputs 001, 010, and 110, the output is 0.
The input 100 is a don’t care.
1. Represent the function in minterm (canonical SOP) form.
2. Use K-map to minimize the expression, utilizing the don’t care condition.
3. Sketch a logic circuit for the minimized function using universal gates (NOR
or NAND).
SET 3 (Roll No: 21 - 30)
1. Simplify the following Boolean Expression using Boolean algebra and draw the
logic diagram for the simplified expression using NAND Gates Only.
a. F=AC+ABC+A’BC+AB+D
b. Z=XYZ+X’YZ+XYZ’
2. Simplify the following Boolean Expression using Suitable K-map and draw the
logic diagram for the simplified expression using NOR Gates Only.
a. F=AB’C’+AC+A’CD’
b. Z=(A’+B+C)(A+B’)D
3. Simplify the following Boolean Expression using Quine Mccluskey and draw the
logic diagram for the simplified expression using NAND Gates Only.
a. F=∑m(0,7,8,9,10,12)+ ∑d(2,5,13)
b. Z=A’BC’D’+A’BC’D+ABC’D’+ABC’D+AB’C’D+A’B’CD’
SET 4 (Roll No: 31 - 40)
1. Simplify the following Boolean Expression using Boolean algebra and draw the
logic diagram for the simplified expression using NAND Gates Only.
a. F=XY+X’Z+YZ
b. Z=X’+XY+XZ’+XY’Z’
2. Simplify the following Boolean Expression using Suitable Kmap and draw the
logic diagram for the simplified expression using NOR Gates Only.
a. F= A’B+A’B’C+ABC’+AB’C’
b. Z=(B+C+D)(A’+B’)(B’+C’)
3. Simplify the following Boolean Expression using Quine Mccluskey and draw the
logic diagram for the simplified expression using NAND Gates Only.
a. F=∑m(1,2,3,5,9,12,14,15)+ ∑d(4,8,11)
b. Z=A’BC’D’+A’BC’D+ABC’D’+ABC’D+AB’C’D+A’B’CD’
SET 5 (Roll No: 41 - 50)
1. Simplify the following Boolean Expression using Suitable Kmap and draw the logic
diagram for the simplified expression using NOR Gates Only.
a. Z=∑m(1,2,3,14,15,18,21,22,25,28,32)+ ∑d(4,8,11,29,31)
2. Simplify the following Boolean Expression using Quine Mccluskey and draw the
logic diagram for the simplified expression using NAND Gates Only.
a. F=∑m(0,2,,6,7,9,12,15)+ ∑d(4,8,11)
3. Simply the following Boolean expression in (i) sum of product (ii) product of sum
using k-map AC’+B’D+A’CD+ABCD
SET 6 (Roll No: 51 - 60)
1. Simplify the following Boolean Expression using Boolean algebra and draw the
logic diagram for the simplified expression using NAND Gates Only.
a. F=A’B+BC'+BC+AB’C’
b. Z=AB + A(B + C) + B(B + C)
2. Simplify the following Boolean Expression using Suitable Kmap and draw the logic
diagram for the simplified expression using NOR Gates Only.
i) F (A, B, C, D,E) = ∑m(0,6,8,13,14,18,21,28)
ii) F (A, B, C, D) = ∑m (1,3,5,7,9,15) +d (4,13)
3. Simplify the following Boolean Expression using Quine Mccluskey and draw the
logic diagram for the simplified expression using NAND Gates Only.
a. F=∑m(0,2,,6,7,9,12,15)+ ∑d(4,8,11)
b. Z=πM(1,2,5,7,8,10,11).πd(0,3,6,12)