.) Represent each circuit with a symbolic statement. Using a truth table, state whether the circuits are equivalent.

A. (p ∨ q) ∧ ~p; [p ∨ (~p ∧ q)] ∧ ~p; equivalent

B. (p ∨ q) ∧ ~p; [p ∨ (~p ∧ q)] ∧ ~p; not equivalent

C. (p ∧ q) ∨ ~p; [p ∧ (~p ∨ q)] ∧ ~p; not equivalent

D. (p ∧ q) ∨ ~p; [p ∧ (~p ∨ q)] ∧ ~p; equivalent

The Examples are below in the comments 2 Attachments

Question

.) Represent each circuit with a symbolic statement. Using a truth table, state whether the circuits are equivalent.

A. (p ∨ q) ∧ ~p; [p ∨ (~p ∧ q)] ∧ ~p; equivalent

B. (p ∨ q) ∧ ~p; [p ∨ (~p ∧ q)] ∧ ~p; not equivalent

C. (p ∧ q) ∨ ~p; [p ∧ (~p ∨ q)] ∧ ~p; not equivalent

D. (p ∧ q) ∨ ~p; [p ∧ (~p ∨ q)] ∧ ~p; equivalent

The Examples are below in the comments  2 Attachments

needhelpp101 · Answer

attachment

unklerhaukus · Answer

$$\begin{array}{|c|c|c|c|c|c|c|c|}\hline p&\neg p& q  &~p ∧ q& p\lor q & (p\lor q)\land \neg p & [p ∨ (~p ∧ q)]& [p ∨ (~p ∧ q)] ∧ ~p  \ \hline  T&&T\ T&&F\F&&T\F&&F\\hline\end{array}$$

unklerhaukus · Answer

$\land $   means AND
$\lor $   means OR (inclusive)

unklerhaukus · Answer

to connect the wire on the left to the globe on the right there must be a path of truth