Register

#self doubt

• retagged by
184 views

1 Answer

0 votes
0 votes

To obtain POS from SOP or vice-versa, do the following steps:

  1. Expand out the given expression using the distributive property.
  2. Use De Morgan’s Law.
  3. Simplify the expression, if necessary.

Alternatively, the same can also be obtained using K-map.

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
codingo1234 asked Apr 8, 2019
248 views
#SELF DOUBT(WEAK ENTITY IN DBMS)
Can a weak entity depend on more than one strong entity?If yes then how does that exaclty work?
Can a weak entity depend on more than one strong entity?If yes then how does that exaclty work?
User Avatar
0 votes
0 votes
1 answer
3
dvlken asked Oct 16, 2023
352 views
self doubt
2. Simplify the following Boolean expressions to a minimum number of literals: (a + b + c’)(a’b’ + c) 3. Draw logic diagrams of the circuits that implement the original and simplified expression in Problem 2.
2. Simplify the following Boolean expressions to a minimum number of literals: (a + b + c’)(a’b’ + c) 3. Draw logic diagrams of the circuits that implement the orig...
User Avatar
0 votes
0 votes
0 answers
4
rd8794 asked Nov 21, 2022
418 views
KMaps - Digital Logic (self doubt)
I’m taking for an example kmaps for 3 var A’B’ A’B AB AB’ C’ 0 1 3 2 C 4 5 7 6 (probably here we are taking CAB’ = 6 and below like AB’C =5 ) A’B’ A’B AB AB’ C’ 0 2 6 4 C 1 3 7 5 But how do i know which one to use and when?
I’m taking for an example kmaps for 3 var A’B’A’BABAB’C’ 0132C4576(probably here we are taking CAB’ = 6and below like AB’C =5 ) A’B’A’BABAB’C’...
User Avatar
Link Copied!