# Simplify `following` Boolean Functions:

Access previous topic for details on Boolean Functions, equivalent truth table and gate level implementation. Examples are discussed next.

Exercise for following `boolean functions:`

1. F = xy + x’y + xy’
2. F = x + x’y
3. F = (x + y)(x +y’)
4. F = xy + x’z + yz
5. F = xyz + x’y + xyz’

Answers `derived` using Boolean Postulates and Theorems.

Example 1:- F = xy + x’y + xy’

From Theorem T1, = xy + xy + x’y + xy’ = y(x + x’) + x(y + y’)

From Postulate P3 = y + x . (Answer)

LTE - 4G Wireless Technology

Digital fundamentals.

Interview Questions.

Example 2:- F = x + x’y

From Postulate P8 = (x + x’)(x + y)

From Postulate P3, F = x + y (Answer)

Example 3:- F = (x + y)(x +y’)

From Postulate P8 = x + yy’

From Postulate P4 = x (Answer)

Example 4:- F = xy + x’z + yz

From Postulate P3 = xy + x’z + xyz + x’yz

= xy(1 + z) + x’z(1 + y) = xy + x’z (Answer)

Example 5:- F = xyz + x’y + xyz’

= xyz + x’yz + x’yz’ + xyz’ = yz + yz’

= y (Answer)

Next on fullchipdesign we will start discussion on minterms and maxterms. canonical or standard forms.

Tutorials `@fullchipdesign.com`

Verilog Tutorial.

LTE Tutorial.

Memory Tutorial.

Hope you liked! this page. Don't forgot to access relevant `previous and next sections ` with links below.