Scribd
Upload
25 views5 pages

Boolean Algebra

The document discusses Boolean algebra and logic expressions. It shows how to represent Boolean expressions using Venn diagrams, truth tables, and logic circuits. Examples of simplifying, minimizing, and obtaining expressions from diagrams are provided.

Uploaded by

Nguyên Vũ
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
25 views5 pages

Boolean Algebra

The document discusses Boolean algebra and logic expressions. It shows how to represent Boolean expressions using Venn diagrams, truth tables, and logic circuits. Examples of simplifying, minimizing, and obtaining expressions from diagrams are provided.

Uploaded by

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

BOOLEAN ALGEBRA

4.1 Show the following properties of sets using Venn diagrams:

(a) A ∪ (A ∩ B) = A

(b) A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C)

4.2 p = ‘It rained yesterday’ q = ‘I used an umbrella yesterday’ (a) Construct English sentences
to express, (∧ ⇔ ‘and’, ∨ ⇔ ‘or’, ¬ ⇔ ‘not’)

(i) p ∧ q : It rained yesterday and I used an umbrella yesterday.

(ii) p ∨ q : It rained yesterday or I used an umbrella yesterday.

(iii) ¬p ∨ q : It wasn’t rained yesterday or I used an umbrella yesterday.

(iv) p ∧ ¬q : It rained yesterday and I wasn’t used an umbrella yesterday.


(v) ¬(p ∧ q) : It wasn’t rained yesterday and I wasn’t used an umbrella yesterday.

(vi) ¬p ∨ ¬q : It wasn’t rained yesterday or I wasn’t used an umbrella yesterday.

(b) Given that p is true and q is false, what is the truth value of each part of section (a)

(i) F

(ii) T

(iii) F

(iv) T

(v) T

(vi) T

4.3 Show the following properties of propositions using truth tables

(a) p ∨ (p ∧ q) ⇔ p

p q p∧q p ∨ (p ∨ q) p ∨ (p ∧ q) ⇔ p
T T T T T
T F F T F
F T F T F
F F F F T

(b) ¬(p ∨ q) ⇔ ¬p ∧ ¬q.

p q ¬p ¬q p∨q ¬(p ∨ q) ¬p ∧ ¬q ¬(p ∨ q) ⇔ ¬p ∧ ¬q

T T F F T F F T
T F F T T F F T
F T T F T F F T
F F T T F T T T

4.4 Using Venn diagrams or truth tables find simpler expressions for the following:

(a) ab + ab¯ = a(b + b¯) = a.1 = a

(b) (ab)(ac) = a.a.b.c = abc


(c) a + abc = a(1+bc) = a.1 = a

(d) (ab)a = (a.a)b = ab

4.5 (a) Draw implementations of the following as logic circuits:

(i) a¯ b¯ + ab¯

(ii) a + bc

(iii) a¯ + ab
(iv) a¯ bc¯

(b) If a = 1, b = 0 and c = 1, what is the value of each of the expressions in section (a)?

(i) a¯ b¯ + ab¯ = ( a¯ + a) b¯ = b¯ = 0¯ =1.

(ii) a + bc = 1 + 0.1 = 1 + 0 = 1.

(iii) a¯ + ab = 0 + 1.0 = 0 + 0 = 0.

(iv) a¯ bc¯ = b (a+c) ¯ = 0( 1 + 1) ¯ = 0.0 = 0.

4.6 Minimize the following expressions and draw their logic circuits:

(a) ab¯ c¯ + ab¯ + abc = a(b¯+c)

(b) abc(a + b + c) + a = a + b + c

(c) (a + c)(a + b) + ab = a(b + c¯)

(d) (a + b)(a + d) + abc¯ + abd¯ + abcd = a¯b¯d¯ + ab


4.7 Obtain a Boolean expression for the logic networks shown in Figure 4.16.

You might also like