Boolean Algebra provides us a mathematical means of representing digital circuits, say it combinational or sequential. We always need to boils down any problem statement to an Boolean Expression just before we would start constructing the logic circuit. This section of quiz covers Boolean Algebra – Postulate & Theorems, Expression Reductions & Circuit Implementations, DeMorgan’s Theorems, Implementation using Universal Gates, SOP and POS representation, Karnaugh Map and Circuit Simplification.
The quiz questions are categorized according to their difficulty level.
Click on any of the following links to start with the quiz:
Level 1
Level 2
Level 3