Computer Science
Draw the truth table for the following boolean function:
F (A, B, C)=(A'+B).(B'+C)
Boolean Algebra
28 Likes
Answer
| A | B | C | A' | B' | A'+B | B'+C | (A'+B).(B'+C) |
|---|---|---|---|---|---|---|---|
| 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 |
| 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 |
| 0 | 1 | 0 | 1 | 0 | 1 | 0 | 0 |
| 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 |
| 1 | 0 | 0 | 0 | 1 | 0 | 1 | 0 |
| 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 |
| 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 |
| 1 | 1 | 1 | 0 | 0 | 1 | 1 | 1 |
Answered By
14 Likes
Related Questions
Write max term expression corresponding to the following truth table:
A B C D (Output) 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 1 1 0 0 0 1 0 1 1 1 1 0 1 1 1 1 1 Draw the truth table for the logical function M for three inputs A, B and C, where M = F (A, B, C). The output is 0 (zero), if the majority of inputs are zero (0) and one (1) if the majority of inputs are one (1). Write the sum of products expression (SOP) for M.
Write the SOP expression corresponding to the following truth table:
A B C D (Output) 0 0 0 0 0 0 1 1 0 1 0 0 0 1 1 1 1 0 0 0 1 0 1 1 1 1 0 0 1 1 1 1 Express in the product of sum (POS) form, the boolean function F (A, B, C). The truth table for which is given below:
A B C F 0 0 0 0 0 0 1 1 0 1 0 0 0 1 1 1 1 0 0 0 1 0 1 1 1 1 0 0 1 1 1 1