Digital Electronics - Boolean Algebra and Logic Simplification - Discussion
Discussion Forum : Boolean Algebra and Logic Simplification - General Questions (Q.No. 28)
28.
A Karnaugh map is a systematic way of reducing which type of expression?
Discussion:
6 comments Page 1 of 1.
A j kiran said:
8 years ago
Both (sop & pos) both are used,
But sop is most likely to be use.
But sop is most likely to be use.
(1)
Susheel kumar said:
1 decade ago
I think by using k-map we can easily to simplify Boolean expressions whether (sop and pos).
Antara bhattacharjee said:
1 decade ago
By using k-map we can solve both s-o-p & p-o-s form.
(1)
Abhishek srivastava said:
1 decade ago
We can directly plot pos no conversion is required directly from truth table. Simplify just top and side expressions; converted to respective pos for eg:A'B' becomes A+B and just take 0's from truth table And plot And simplify as usual.
Bobby said:
1 decade ago
[A] is also a correct answer
Ruvathya said:
1 decade ago
Sop form can only be implemented easily. If it s not in sop form (pop) then yo have to convert it into sop then use k map to reduce it further.
Post your comments here:
Quick links
Quantitative Aptitude
Verbal (English)
Reasoning
Programming
Interview
Placement Papers