Question

Mathematical LOGIC Card nr. 7 1. Draw a truth table, and find the number of the given Boolean function. Define the function, using numbers of binary vectors 2. Simplify the given function by reducing its expression into DNF (Disjunctive Normal Form. Simplify the given function by reducing its xpression into a polynomial of modulo2. the given Boolean function geometrically minimize it. resent f (x)vxž

all fast

Answer 1

SOLUTION:

DISJUNCTIVE NORMAL FORM:

It is simply described as an OR's of AND's.

Given, ^unchin neduce it to DNF Tt is a Canoni Col Nomal Form Consisbt DNF a disjunchion Coniunctive clauSes - as an OR of ANDS- it Can also be Called Accodinto the P blem ow lets Tak e ㈡yt and Simpli

ePlacin

70 Tづ This S inDisjunc bive Normal fom oP S of ANDS

ue Con wnle above as enCe Prvved '4 Civen f Truth Table ConSidemo 0 0

When η:l 'we have only one Boolean vanable uith 2 diffeγent values 69 When n2 ue hove 2BooleanVaiale s iH 2 Combina-bons Conves bingt the Booleam tuncon nto a number: let x :0 and χ:I an Boolean tunct be omes (oo Οι Booleanon Bna vectors ove

Now we Cal culat mbe as Sum of owes f2 usn th Binay vecbsnthe prevous as xonents 0 + 2 + 2 + 2 2 0 28 Boo lean exPve SSion, It olso xepre sents a QssoGiated it Whe Same Boolean quivalent Boolean £x pvessi0ns 51 Boolean Va ia bles ( 2)there 0e 4 dilteren 24 16 Boolea aSeS uncbons Of 2 vaviables