$3.$ BDD Terminal Cases and Operation BDD$\_$OR$.$

a$.$ Specify a set of terminal cases for BDD$\_$AND$($f$,$g$).$

b$.$ Justify that the operation BDD$\_$OR can be derived from BDD$\_$AND by replacing the terminal cases. Specify a set of terminal cases for BDD$\_$OR$($f$,$g$).$

$4.$ BDDs$.$

a$.$ Write a BDD for $f=w+x^{\text{'}}+y+z.$ Use the ordering $g=w^{**}{x}^{**}zh=w^{**}x**z^{\text{'}}w.$

$d.$ Represent all three $BDDsas$ one shared $BDD$ structure.

$e.$ Construct a $BDD$ for $BD{D}_{A}ND(f,g).$ Use the $BD{D}_{A}ND$ algorithm presented $in$ class.

$f.$ Construct a $BDD$ for $BD{D}_{O}R(g,h).$ Use a 'modified' $BD{D}_{A}ND$ algorithm $(see$ problem $3.b.)w.$

$c.$ Write a $BDD$ for $h=w^{**}x**z^{\text{'}}.$ Use the ordering $w.$

$d.$ Represent all three $BDDsas$ one shared $BDD$ structure.

$e.$ Construct a $BDD$ for $BD{D}_{A}ND(f,g).$ Use the $BD{D}_{A}ND$ algorithm presented $in$ class.

$f.$ Construct a $BDD$ for $BD{D}_{O}R(g,h).$ Use a 'modified' $BD{D}_{A}ND$ algorithm $(see$ problem $3.b.)w.$

$b.$ Write a $BDD$ for $g=w^{**}{x}^{**}z.$ Use the ordering $w.$

$c.$ Write a $BDD$ for $h=w^{**}x**z^{\text{'}}.$ Use the ordering $w.$

$d.$ Represent all three $BDDsas$ one shared $BDD$ structure.

$e.$ Construct a $BDD$ for $BD{D}_{A}ND(f,g).$ Use the $BD{D}_{A}ND$ algorithm presented $in$ class.

$f.$ Construct a $BDD$ for $BD{D}_{O}R(g,h).$ Use a 'modified' $BD{D}_{A}ND$ algorithm $(see$ problem $3.b.)$