Complete the following truth table for $f ( A , B ) = \sim A \vee \sim B$ $\begin{array} { | c | c | c | c | c | }
\hline \boldsymbol { A } & \boldsymbol { B } & \sim \boldsymbol { A } & \sim \boldsymbol { B } & f ( \boldsymbol { A } , \boldsymbol { B } ) \
\hline 1 & 1 & & & \
\hline 1 & 0 & & & \
\hline 0 & 1 & & & \
\hline 0 & 0 & & & \
\hline
\end{array}$

Use the truth table to evaluate f (,01).
A) 0
B) 1
C) Neither of these

Question

Complete the following truth table for $f ( A , B ) = \sim A \vee \sim B$ $\begin{array} { | c | c | c | c | c | } 
\hline \boldsymbol { A } & \boldsymbol { B } & \sim \boldsymbol { A } & \sim \boldsymbol { B } & f ( \boldsymbol { A } , \boldsymbol { B } ) \
\hline 1 & 1 & & & \
\hline 1 & 0 & & & \
\hline 0 & 1 & & & \
\hline 0 & 0 & & & \
\hline
\end{array}$

Use the truth table to evaluate f (,01).
A) 0 
B) 1 
C) Neither of these

Quizplus · Accepted Answer

The function $f(A, B) = \sim A \vee \sim B$ outputs 1 whenever at least one of the inputs is 0, because the negation of a 0 is 1, and the OR operation with 1 always results in 1. For $f(0, 1)$, since $A = 0$, $\sim A = 1$, making the function output 1 regardless of $B$'s value.

Complete the Following Truth Table For f(A,B)=∼A∨∼Bf ( A , B ) = \sim A \vee \sim Bf(A,B)=∼A∨∼B

Complete the Following Truth Table For $f ( A , B ) = \sim A \vee \sim B$