An easy would be to convert the expression obtained to 0s and 1s. And then, you can notice the fact that there are all possible combinations of odd $\#1$s in each of the terms. Thus it would be the XOR of the inputs.

The Gateway to Computer Science Excellence

+13 votes

Best answer

0

yes, it's A⊕B⊕C, ex-or is an odd function, it means number of boolean variables in un-prime form will be odd.

+1

Thehobo03

A variable has two forms p(non-prime) p'(prime (or) complemented). in exor function there will always be odd number of non-prime variables in each minterm,

A variable has two forms p(non-prime) p'(prime (or) complemented). in exor function there will always be odd number of non-prime variables in each minterm,

0

can you please explain how you got

=(A+B')(A'+B)C+A'BC'+AB'C'

by using

A'B'C+AB'C'+A'BC'+ABC

I am unable to understand this part can uh please explain

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.3k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.1k
- Non GATE 1.5k
- Others 1.5k
- Admissions 595
- Exam Queries 576
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 17

50,647 questions

56,492 answers

195,439 comments

100,708 users