The Gateway to Computer Science Excellence
+1 vote
41 views

Simplify the Boolean expression to the minimum numbers of the literals.

 

  1. $ABC + A’B + ABC’$
  2. $X’YZ + XZ$
  3. $( X+ Y)’(X’ + Y’)$
  4. $XY + X(WZ + WZ’)$
  5. $(BC’ + A’D)(AB’ + CD’)$
in Digital Logic by Boss (10.6k points)
edited by | 41 views

1 Answer

+1 vote
Best answer

${\color{Red}{Literals:} }$Every occurrence of the variables in it's true(pure) and complemented(negation) forms.

 

$(5)$$(BC’ + A’D)(AB’ + CD’)$    Here number of literals$ = 8$

       we can write like this

      $\Rightarrow BC'AB'+BC'CD'+A'DAB'+A'DCD'$

     $\Rightarrow ABB'C'D+BC'CD'+A'AB'D+A'CDD'$

     $\Rightarrow 0+0+0+0=0$    $\left [ X.X'=0\right ]$     Here number of literals $ = 0$

by Boss (35.7k points)
selected by

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,645 questions
56,601 answers
195,850 comments
102,208 users