Class 12 Exam  >  Class 12 Questions  >  Laws of boolean algebra Related: Chapter 7 -... Start Learning for Free
Verified Answer
Laws of boolean algebra Related: Chapter 7 - Boolean Algebra, Chapter...
As well as the logic symbols “0” and “1” being used to represent a digital input or output, we can also use them as constants for a permanently “Open” or “Closed” circuit or contact respectively.

A set of rules or Laws of Boolean Algebra expressions have been invented to help reduce the number of logic gates needed to perform a particular logic operation resulting in a list of functions or theorems known commonly as the Laws of Boolean Algebra.

Boolean Algebra is the mathematics we use to analyse digital gates and circuits. We can use these “Laws of Boolean” to both reduce and simplify a complex Boolean expression in an attempt to reduce the number of logic gates required. Boolean Algebra is therefore a system of mathematics based on logic that has its own set of rules or laws which are used to define and reduce Boolean expressions.

The variables used in Boolean Algebra only have one of two possible values, a logic “0” and a logic “1” but an expression can have an infinite number of variables all labelled individually to represent inputs to the expression, For example, variables A, B, C etc, giving us a logical expression of A + B = C, but each variable can ONLY be a 0 or a 1.
This question is part of UPSC exam. View all Class 12 courses
Explore Courses for Class 12 exam
Laws of boolean algebra Related: Chapter 7 - Boolean Algebra, Chapter Notes, Class 12, Computer Science
Question Description
Laws of boolean algebra Related: Chapter 7 - Boolean Algebra, Chapter Notes, Class 12, Computer Science for Class 12 2024 is part of Class 12 preparation. The Question and answers have been prepared according to the Class 12 exam syllabus. Information about Laws of boolean algebra Related: Chapter 7 - Boolean Algebra, Chapter Notes, Class 12, Computer Science covers all topics & solutions for Class 12 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Laws of boolean algebra Related: Chapter 7 - Boolean Algebra, Chapter Notes, Class 12, Computer Science.
Solutions for Laws of boolean algebra Related: Chapter 7 - Boolean Algebra, Chapter Notes, Class 12, Computer Science in English & in Hindi are available as part of our courses for Class 12. Download more important topics, notes, lectures and mock test series for Class 12 Exam by signing up for free.
Here you can find the meaning of Laws of boolean algebra Related: Chapter 7 - Boolean Algebra, Chapter Notes, Class 12, Computer Science defined & explained in the simplest way possible. Besides giving the explanation of Laws of boolean algebra Related: Chapter 7 - Boolean Algebra, Chapter Notes, Class 12, Computer Science, a detailed solution for Laws of boolean algebra Related: Chapter 7 - Boolean Algebra, Chapter Notes, Class 12, Computer Science has been provided alongside types of Laws of boolean algebra Related: Chapter 7 - Boolean Algebra, Chapter Notes, Class 12, Computer Science theory, EduRev gives you an ample number of questions to practice Laws of boolean algebra Related: Chapter 7 - Boolean Algebra, Chapter Notes, Class 12, Computer Science tests, examples and also practice Class 12 tests.
Explore Courses for Class 12 exam
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
10M+ students study on EduRev