Computer Science
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 |
Boolean Algebra
8 Likes
Answer
| A | B | C | D (Output) | Max Terms | Max Term Designation |
|---|---|---|---|---|---|
| 0 | 0 | 0 | 0 | A+B+C | M0 |
| 0 | 0 | 1 | 0 | A+B+C' | M1 |
| 0 | 1 | 0 | 0 | A+B'+C | M2 |
| 0 | 1 | 1 | 1 | ||
| 1 | 0 | 0 | 0 | A'+B+C | M4 |
| 1 | 0 | 1 | 1 | ||
| 1 | 1 | 0 | 1 | ||
| 1 | 1 | 1 | 1 |
Max term expression for D = (A+B+C).(A+B+C').(A+B'+C).(A'+B+C)
Max term expression in cardinal form:
F(A, B, C) = π(0, 1, 2, 4)
Answered By
4 Likes
Related Questions
Reduce the following boolean function with the help of Karnaugh's map:
F (a, b, c, d) =Σ (0, 1, 2, 4, 5, 6, 8, 9, 12, 13, 14)
Draw the truth table for the following boolean function:
F (A, B, C)=(A'+B).(B'+C)Reduce the following boolean function with the help of Karnaugh's map:
F (A, B, C, D) =Σ (0, 1, 2, 3, 12, 13, 14, 15)
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.