Question

A truth table can be implemented with different boolean expressions and different circuits True False Question 5 (2 points) The boolean expression "not x or y" is equivalent to the boolean expression "x or not Y" True False Question 6 (2 points) The boolean expression (x or y) and x is equivalent to the boolean expression (x and y) ory True False

Answer 1

Qu) True Because we Construct a truth table by using boolean expression or using circuit for example constructing a truth table using using boolean expression Y = ABTÀ Touth table Comment 0-0 to'=1 oil to al 1.0tizo о truth table Constru using circuit structing A re From the circuit E= ABT AB'

table Touth B comment o o 0.0 +000l=0 oil touch - O 1:0 +1.0 - Outro Qs) false Now, we prove or disprove the stepression aty = x+x Truth tables st 7 o yty o to=1 oto=1 õ +1=1/otło ī to=ol ito=1 ital ItT=1 are not equal Touth tables xty att Not equal to

Q6) True Given that, (x+y) x X - xt tox X こ x.x = x x.x + xy = x+xx (xx = X (1+y) Ityz [12 2 x xxtx = x(4+1) Ettl=1] Z х .: Both are equal