Scribd
Upload
24 views

Assignment 02

Uploaded by

contactghezlene
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
24 views

Assignment 02

Uploaded by

contactghezlene
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

The National Higher School of Artificial Intelligence 2023/2024

Digital systems First Year

Assignment 02
Exercise 01
Simplify the following Boolean expression using only Boolean algebra and axioms

a) 𝐹 = 𝑋𝑍 + 𝑌(𝑋̅𝑍 + 𝑌̅)
b) 𝐹 = 𝑊𝑋𝑌𝑍 + 𝑊𝑋𝑌𝑍̅ + 𝑊𝑋𝑌̅𝑍 + 𝑊𝑋𝑌̅ 𝑍̅ + 𝑊 ̅ 𝑋𝑌𝑍̅ + 𝑊𝑋̅𝑌𝑍̅ + 𝑊
̅ 𝑋̅𝑌𝑍̅ + 𝑊 ̅ 𝑋𝑌̅𝑍
c) 𝐹 = 𝑊𝑋𝑍̅ + 𝑊𝑋̅𝑍̅ + 𝑊𝑋̅𝑍 + 𝑋̅𝑌𝑍 + 𝑋̅𝑌𝑍̅ + 𝑋𝑌𝑌̅𝑍 + 𝑊𝑌̅𝑍̅ + 𝑊𝑌𝑍̅ + 𝑊 ̅ 𝑌̅ 𝑍̅ + 𝑊𝑋𝑍 + 𝑊
̅ 𝑌𝑍̅ + 𝑊𝑋𝑋̅𝑌𝑍
d) 𝐹 = 𝐵(𝐴𝐵 + 𝐴𝐵̅ )(𝐴𝐶 ̅̅̅̅ + 𝐶)
e) (𝐴 + 𝐵̅ 𝐵) + ̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
𝑜𝑢𝑡 = ̅̅̅̅̅̅̅̅̅̅̅̅ (𝐵 + 𝐴̅)(𝐴 + 𝐵𝐶)
f) 𝑜𝑢𝑡 = ̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
(𝐶 + 𝐴𝐵𝐶̅ + B ̅C̅ D) + ̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
(𝐶 + ̅̅̅̅̅̅̅̅
𝐵 + 𝐷)

Exercise 02
Express the following functions in a sum of minterms and a product of maxterms :
a) 𝐹 = (XY + Z)(Y + XZ)
b) 𝐹 = 𝐷(𝐴̅ + 𝐵) + 𝐵̅ 𝐷

Exercise 03
Simplify the following Boolean SOP expression using the Karnaugh map technique.
a) F(W,X,Y,Z) = ∑ m(0,2,4,5,7,8,10,13,14,15)
b) F(X,Y,Z) = Π M(0,1,2,3,4,6)

Simplify the following Boolean SOP expression, with don’t care conditions, using the Karnaugh map
technique. Express your answer in POS form.

a) F(W,X,Y,Z) = Σ m(2,5,7,8,9,12,15) ; dc(W,X,Y,Z) = Σ m(0,1,10,14)


b) F(W,X,Y,Z) = Σ m(1,2,5,8,9,12,14) + Σ dc(3,6,10,13,15)

Exercise 04
a) Assuming the following Truth Table for a three input variable function F(A,B,C), determine the full
Minterm expression for F.

A B C F
0 0 0 1
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 1
1 0 1 0
1 1 0 1
1 1 1 0
b) Using a Karnaugh map, simplify the expression for F(A,B,C) defined in the above Part.
The National Higher School of Artificial Intelligence 2023/2024
Digital systems First Year

Exercise 05
The circuit shown below can be simplified. Write a Boolean expression that represents the function of
the simplified circuit using the minimum number of AND, OR and NOT gate.

A
C

Exercise 06
Draw the circuit diagram for the Boolean expression below. Use NAND gates only. (ie. you may not use
inverter gates).
𝐹 = 𝑋𝑌̅ + 𝑋̅𝑌
Draw the circuit diagram for the following Boolean expression using only NOR gates
𝐹 = 𝑋𝑌 + 𝑋̅𝑍 + 𝑌𝑍̅

Exercise 07
Design a combinational circuit with three inputs, x, y and z, and the three outputs, A, B, and C. when the
binary input is 0, 1, 2, or 3, the binary output is one greater than the input. When the binary input is 4, 5,
6, or 7, the binary output is one less than the input.
a) Derive the truth table that defines the required relationship between inputs and outputs.
b) Obtain the simplified Boolean functions for each output as a function of the input variables.
c) Draw the logic diagram

You might also like