Boolean Algebra is all about simplifying the boolean expressions and write them in their smallest form so that execution takes minimum time and required minimum space.
Boolean expressions are simplified in 2 ways. First way is using laws of boolean algebra and the other way is using K-maps
This portion covers the ways to simplify the boolean expressions using laws of boolean algebra.
Any problem or issue in understanding the topic is most welcome. Please share it in the comment box and I will resolve it for you.
Thank You.
No comments:
Post a Comment