Prashnikaप्रश्निका
Code
About
‹ Back to the paper

Question 69

5 marks

Computer ScienceISC Computer Science - Competency Focused Practice Questions (CISCE, August 2024)Case basedBoolean Algebra

Answer the following questions.

Answer the following Boolean algebra questions: f(a, b, c) = a.b' + a.c + b.c'. Find its…

Answer the following Boolean algebra questions:
(a)[3]
$f(a, b, c) = a.b' + a.c + b.c'$. Find its corresponding Cardinal and Canonical sum-of-product expression?
(b)[2]
If $a=1, b=0, c=1, d=0$, then write maxterm and minterm for $F(a, b, c, d)$ in canonical form?
Open in the Boolean algebra solver

Answer

Answer (a)

$f(a,b,c) = a.b' + a.c + b.c'$ Truth table:
abcf
0000
0010
0101
0110
1001
1011
1101
1111
Cardinal (sum-of-minterms) form: $f(a,b,c) = \Sigma(2,4,5,6,7)$ Canonical SOP: $f(a,b,c) = a'bc' + ab'c' + ab'c + abc' + abc$

Answer (b)

$a=1, b=0, c=1, d=0$ gives the binary code 1010, i.e. index 10. Minterm (variable uncomplemented if its value is 1, complemented if 0): $m_{10} = a.b'.c.d'$ Maxterm (variable complemented if its value is 1, uncomplemented if 0): $M_{10} = a' + b + c' + d$