Computer Science
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 |
Boolean Algebra
13 Likes
Answer
| A | B | C | F | Max Terms |
|---|---|---|---|---|
| 0 | 0 | 0 | 0 | A+B+C |
| 0 | 0 | 1 | 1 | |
| 0 | 1 | 0 | 0 | A+B'+C |
| 0 | 1 | 1 | 1 | |
| 1 | 0 | 0 | 0 | A'+B+C |
| 1 | 0 | 1 | 1 | |
| 1 | 1 | 0 | 0 | A'+B'+C |
| 1 | 1 | 1 | 1 |
SOP expression:
(A+B+C).(A+B'+C).(A'+B+C).(A'+B'+C)
Answered By
8 Likes
Related Questions
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 Draw the truth table for the following boolean function:
F (A, B, C)=(A'+B).(B'+C)Find the complement of XY'Z + XY + YZ'
Convert the following expression into canonical POS form:
F(A, B) = (A + B).A'