Register

Simplify the Boolean function: (a) F=A’C+A’B+AB’C+BC

• recategorized by
133 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Admission QueryNext → · this similar questio...
← Previous in category · Digital LogicNext in category → · Digital Logic Questi...
Position:
Show:

Related questions

3 3 votes
4 answers 4 answers
4.8k
4.8k views
Gobind asked Oct 11, 2014
4,841 views
Kindly have a try .... IN canonical POS form following equation is written as (ABC)=AB+BC+AC (A)πM(0,1,2,4) (B)πM(3,5,6,7) (A)πM(0,1,2,3) (A)πM(4,5,6,7)
Kindly have a try .... IN canonical POS form following equation is written asF(A,B,C)=AB+BC+AC (A)πM(0,1,2,4) (B)πM(3,5,6,7)(C)πM(0,1,2,3) (D)πM(4,5,6,7)
2 2 votes
3 answers 3 answers
5.6k
5.6k views
techbrk3 asked Nov 9, 2017
5,614 views
Simplify the Boolean expression F(A,B,C)=AB+C'(AB+C)+A'
ABA + BA'+BAB'
0 0 votes
1 1 answer
14.6k
14.6k views
radha gogia asked Aug 16, 2015
14,639 views
Consider the relation R(A,B,C,D) with dependencies AB -> C, ABC -> D and AC ->>- B.
R is not in 3NF R is in 3NF but not in BCNF R is in BCNF but not in 4NF R is in 4NF How to approach this ques ?
0 0 votes
1 1 answer
1.8k
1.8k views
saba780 asked Apr 26, 2022
1,818 views
simplify the following logic functionf(ABC)USING k-MAP f(ABC)=(A+B+C') .(A+B'+C')
simplify the following logic functionf(ABC)USING k-MAP f(ABC)=(A+B+C') .(A+B'+C')