ITER, SIKSHA ‘O’ ANUSANDHAN (Deemed to be
University) Assignment
Branch CSE and CSIT Programme [Link]
Course Name Digital Logic Design Semester 3rd
Course Code EET1211 Academic Year 2025/Odd
Topic- Application of Boolean algebra,
Assignment-2 Minterm and Maxterm Expansions, GP-1
Karnaugh map
Learning Level L1: Remembering L3: Applying L5: Evaluating
(LL)
L2: Understanding L4: Analysing L6: Creating
Q’s Questions COs LL
Given, 𝐹(𝑎, 𝑏, 𝑐) = 𝑎𝑏𝑐 ′ + 𝑏 ′ .
1. Express 𝐹 a minterm expression. (Use 𝑚-notation).
2. Express 𝐹 a maxterm expression. (Use 𝑀-notation).
1 3. Express 𝐹 ′ a minterm expression. (Use 𝑚-notation). CO2 L2
4. Express 𝐹 ′ a maxterm expression. (Use 𝑀-notation).
Given 𝐹(𝑎, 𝑏, 𝑐, 𝑑) = (𝑎 + 𝑏 + 𝑑)(𝑎′ + 𝑐)(𝑎′ + 𝑏 ′ + 𝑐 ′ )(𝑎 + 𝑏 + 𝑐 ′ + 𝑑 ′ ).
1. Express 𝐹 a minterm expression. (Use 𝑚-notation).
2. Express 𝐹 a maxterm expression. (Use 𝑀-notation).
2 3. Express 𝐹 ′ a minterm expression. (Use 𝑚-notation). CO2 L2
4. Express 𝐹 ′ a maxterm expression. (Use 𝑀-notation).
3 [2011] CO2 L2
In the circuit given below, the expression for Y is
4 CO2 L2
5 CO2 L2
[2000]
[1997]
6 CO2 L2
7 CO2 L2
8 CO2 L2
Find the simplest expression for 𝐹1 , 𝐹2 , 𝐹3 and 𝐹4 for the given truth table.
A B C F1 F2 F3 F4
0 0 0 1 1 0 1
0 0 1 x 0 0 0
0 1 0 0 1 X 0
0 1 1 0 0 1 1
9 CO2 L2
1 0 0 0 1 1 1
1 0 1 X 0 1 0
1 1 0 0 X X X
1 1 1 1 X 1 X
CO2 L2
Given 𝐹1 = ∑ 𝑚(0,4,5,6) and 𝐹2 = ∑ 𝑚(0,3,6,7) find the minterm
10 expression for 𝐹1 + 𝐹2 .
11 Plot the following function on a K-map. (Do not expand to minter form CO2 L2
before plotting.)
𝐹(𝐴, 𝐵, 𝐶, 𝐷) = 𝐵𝐷′ + 𝐵 ′ 𝐶𝐷 + 𝐴𝐵𝐶 + 𝐴𝐵𝐶 ′ 𝐷 + 𝐵 ′ 𝐷′
1. Find the minimum sum of products.
2. Find the minimum product of sums.
Find the minimum sum of products for each function using K-map.
1. 𝑓1 (𝑎, 𝑏, 𝑐) = 𝑚0 + 𝑚2 + 𝑚5 + 𝑚6 .
2. 𝑓2 (𝑑, 𝑒, 𝑓) = ∑ 𝑚(0,1,2,4).
3. 𝑓3 (𝑟, 𝑠, 𝑡) = 𝑟𝑡 ′ + 𝑟 ′ 𝑠 ′ + 𝑟 ′ 𝑠.
4. 𝑓4 (𝑥, 𝑦, 𝑧) = 𝑀0 ∙ 𝑀5 .
12 CO2 L4
13 Let the minterm expression (𝐴, 𝐵, 𝐶, 𝐷) = ∑ (0,2,4,6,8) + ∑ 𝑑(1,3,10).
What is the minimal form of the function represented by the Karnaugh
map? CO2 L2
(GATE CSE 2008)
14 What is the minimum SOP for 𝐹(𝑤, 𝑥, 𝑦, 𝑧) = ∑ 𝑚(4,6,9,11,12,14) + ∑
𝑑(1,3,10)?
CO2 L2
(GATE CSE 2002)
15 Find the minimum sum of products and the minimum product of sums for
each function.
1. 𝑓(𝑎, 𝑏, 𝑐, 𝑑) = ∑ 𝑚(0,2,3,4,7,8,14)
2. 𝑓(𝑎, 𝑏, 𝑐, 𝑑) = ∏ 𝑀(1,2,3,4,9,15)
CO2 L2
3. 𝑓(𝑎, 𝑏, 𝑐, 𝑑) = ∑ 𝑚(1,3,4,11) + ∑ 𝑑(2,7,8,12,14,15)
4. 𝑓(𝑎, 𝑏, 𝑐, 𝑑) = ∏𝑀(0,1,6,8,11,12) ∙ ∏𝐷(3,7,14,15)
16 What is the minimum POS for (𝐴, 𝐵, 𝐶, 𝐷) = ∑ (1,3,4,6,9,11,12,14)?
(GATE CSE 1996) CO2 L2
17 A combinational logic circuit which has one output Z and 4-bit input ABCD
representing a binary number. Z should be 1 if the input is at least 5 but is
no greater than 11.
CO2 L4
a) List the minterms.
b) List the maxterms.
18 A combinational circuit that has four inputs ((𝐴, 𝐵, 𝐶, and 𝐷) and three
outputs (𝑋, 𝑌 and 𝑍). 𝑋𝑌𝑍 represents a binary number whose value equals
CO2 L4
the number of 1’s at the input. For example, if 𝐴𝐵𝐶𝐷 = 1011, 𝑋𝑌𝑍 = 011.
a) Determine the Boolean expression in SOP.
b) Determine the Boolean expression in POS.
Assignment Topic: Application of Boolean Date of Assignment2: Date of Submission:
2 algebra, Minterm and Maxterm 24.10.2025 03.11.2025
Expansions, Karnaugh map
Note:
1. assignment carries a weightage of 20 marks out of 100
2. Course outcome CO2 was covered.
CO1 Able to state and explain different number systems, binary codes
Able to apply the principles of Boolean algebra, Karnaugh map and Quine
CO2 McCluskey
Method to simplify logic expressions
Course Able to analyse and design various combinational circuits
CO3
Outcome
s CO4 Able to analyse and design Memory and Programmable Logic Devices
CO5 Able to analyse and understand latches, flip-flops, registers and counter
operations.
CO6 Analyse the relationship between digital logic and computer organization
through assembly language programming.