Register

self doubt

• retagged by
394 views
0 votes
0 votes
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.
• retagged by
User Avatar

1 Answer

0 votes
0 votes

Refer the image below:

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

Related questions

382
views
1 answers
1 votes
dutta18 asked Dec 9, 2022
382 views
Self doubt
How to do this Boolean multiplication? And which Boolean law is applicable here ?( P' + Q ) ( Q' + P )
User Avatar
1.4k
views
1 answers
4 votes
AniMan_7 asked Jun 29, 2023
1,400 views
3 input EX-NOR Gate and Its Associativity - Digital Logic
Does EX-NOR Gate follow Associativity ?How 3 input EX-NOR function is equal to 3 input EX-OR function ?
User Avatar
351
views
0 answers
3 votes
thehitchh1ker asked Oct 31, 2023
351 views
[Self Doubt] Conversion of SR-flipflop to T-flipflop
The standard approach for solving such problem is as follows:This approach gives us the equation for $S$ & $R$ in terms of $T, Q$ ... $R=TQ$ which is consistent with the standard approach and maintains $SR=0$
User Avatar
447
views
0 answers
0 votes
rd8794 asked Nov 21, 2022
447 views
KMaps - Digital Logic (self doubt)
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’ 0264C1375 But how do i know which one to use and when?
User Avatar
Link Copied!