[go: up one dir, main page]
Scribd
Upload
13 views2 pages

CSC2901 Tutorial4 2021

Uploaded by

samuelchibinjimwanza
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
13 views2 pages

CSC2901 Tutorial4 2021

Uploaded by

samuelchibinjimwanza
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

DEPARTMENT OF COMPUTER SCIENCES

CSC2901 – Discrete Structures


Tutorial Sheet 4

1. Suppose A is a set and S be the superset of A. Let x and y be in S and define


the following operators on S
 𝑥 ′ be the complement of x
 𝑥 + 𝑦 = 𝑥 ∪𝑦
 𝑥. 𝑦 = 𝑥 ∩ 𝑦
Prove that the (𝑆, +, . , ‘, ∅, 𝐴) is a Boolean algebra.
2. Let B be a set and 𝑥, 𝑦 be in B. Let the operators ‘, + and . be defined as
follows
 𝑥’ = 24/𝑥
 𝑥 + 𝑦 = 𝑙𝑐𝑚(𝑥, 𝑦)
 𝑥. 𝑦 = 𝑔𝑐𝑑(𝑥, 𝑦)
For each of the given sets B, determine whether (B, +, ., ‘,1, 24) is a Boolean
algebra
a. B = {1, 2, 3, 12, 24}
b. B = {1, 2, 3, 4, 6 ,8 , 12, 24}
3. Prove the following identities
a. 𝑥. 𝑥 = 𝑥
b. 𝑥 + 𝑥 = 𝑥
c. 𝑥’’ = 𝑥
4. Simplify each of the following using Boolean algebra laws
a. (𝑥 + 𝑦)(𝑥’ + 𝑦)
b. (𝑥𝑦)(𝑥’ + 𝑦)
c. (𝑥 + 𝑦)’(𝑦’ + 𝑥) + 𝑥’
d. [(𝑥𝑦)𝑧 + (𝑦𝑥)𝑧’] + 𝑥𝑦’
e. 𝑥𝑦 + 𝑥𝑦’ + 𝑥’𝑦 + 𝑥’𝑦’
f. 𝑥𝑦 + (𝑥𝑦)’𝑧 + 𝑧’
g. 𝑥(𝑥 + 𝑦) + 𝑧 + 𝑦
h. 𝑥’𝑤 + 𝑥’𝑦’ + 𝑦𝑧’ + 𝑥’𝑧
5. Use K-maps to simplify the expressions above
6. For each of the following logic networks, write the Boolean expression

a.

b.

c.

d.

You might also like