# Digital Circuits

## Don’t Care Conditions

Make sure to check the previous blog on K-Map Simplification as that can help a lot to have a deeper understanding. In this blog, we will learn about Don’t care conditions used while simplifying a k-map. Sometimes there is an occasion where it doesn’t matter if the function produces 0 or 1 for a given minterm. We …

## K-Map simplification (Karnaugh Map)

Make sure to check the previous blog on Boolean Algebra as that can help a lot to have a deeper understanding. In this blog, we will learn about K-Map Simplification (Karnaugh Map). The complexity of a logic diagram is directly related to the complexity of the boolean algebraic expression. The truth table implementation is good …

## Boolean algebra

In the previous blog, we learned about the Digital Circuit and Logic Gates. This time we will learn about Boolean Algebra, Gates and their truth tables, DeMorgan’s Theorem, and Compliment of a function. Let’s Get Started! Gates and their Truth table AND Gate OR Gate NOT Gate NOR Gate NAND Gate XOR Gate XNOR Gate …

## Digital Circuits and Logic gates

Digital Computers have a big role to play in our everyday lives. It facilitates most of our work and saves us a lot of time. But have you ever wondered what happens in that machine that works so easily with these? Yes, then this is the right place. This blog will introduce you to the …