1. /
2. CBSE
3. /
4. Class 12
5. /
6. Introduction to Boolean Algebra...

# Introduction to Boolean Algebra class 12 Notes Computer Science

### myCBSEguide App

Download the app to get CBSE Sample Papers 2023-24, NCERT Solutions (Revised), Most Important Questions, Previous Year Question Bank, Mock Tests, and Detailed Notes.

## Physical Education Chapter 4 Introduction to Boolean

Introduction to Boolean Algebra class 12 Notes Computer Science in PDF are available for free download in myCBSEguide mobile app. The best app for CBSE students now provides   Introduction to Boolean Algebra class 12 Notes Computer Science latest chapter wise notes for quick preparation of CBSE board exams and school-based annual examinations. Class 12 Computer Science notes on chapter 4 Introduction to Boolean Algebra Computer Science are also available for download in CBSE Guide website.

## Revision notes for Class 12 Physical Education Chapter 4 Introduction to Boolean Algebra

Download CBSE class 12th revision notes for chapter 4 Introduction to Boolean Algebra in PDF format for free. Download revision notes for Introduction to Boolean Algebra class 12 Notes and score high in exams. These are the  Introduction to Boolean Algebra class 12 Notes Computer Science prepared by team of expert teachers. The revision notes help you revise the whole chapter 4 in minutes. Revision notes in exam days is one of the best tips recommended by teachers during exam days.

## Introduction to Boolean Algebra class 12 Notes Computer Science

Boolean Algebra: is the algebra of logic that deals with binary variables and logic operations.

Boolean Variable: A boolean variable is a symbol, usually an alphabet used to represent a logical quantity. It can have a 0 or 1 value

Boolean Function: consists of binary variable, constants 0 & 1, logic operation symbols, parenthesis and equal to operator.

Complement: A complement is the inverse of a variable and is indicated by a’ or bar over the variable. A binary variable is one that can assume one of the two values 0 and 1.

Literal: A Literal is a variable or the complement of a variable

Truth table: is atable which represents all the possible values of logical variables along with all the possible results of the given combinations of values.

List of axioms and theorems:

 Identity A + 0 = A A. 1 = A Complement A + A’ = 1 A. A’ = 0 Commutative A + B = B + A A. B = B. A Assosiative A + (B + C) = (A + B) + C A. (B. C) = (A. B). C Distributive A. (B + C) = A. B + A. C A + (B. C) = (A + B). (A + C) Null Element A + 1 = 1 A. 0 = 0 Involution (A’)’ = A Indempotency A + A = A A. A = A Absorption A + (A. B) = A A. (A + B) = A 3rd Distributive A + A’. B = A + B De Morgan’s (A + B)’ = A’. B’ (A. B)’ = A’. B’

### (Boolean Functions and Reduce Forms)

A Boolean function can be expressed algebraically from a given truth table by forming a minterm and then taking the OR of all those terms.

Minterm: An n variable minterm is a product term with n literals resulting into 1.

Maxterm: An n variable maxterm is a sum term with n literals resulting into 0.

A sum-of-product expression is logical OR of two or more AND terms

A product-of-sum is logical AND of two or more OR terms

If each term in SOP / POS form contains all the literals, then it is canonical form of expression.

To convert from one canonical form to another, interchange the symbol and list those numbers missing from the original form.

The Karnaugh map (K-map) provides a systematic way of simplifying Boolean algebra expressions.

For minimizing a given expression in SOP form, after filling the k map look for combination of adjascent one’s.

Combine these one’s in such a way that the expression is minimum.

For minimizing expression in POS form we mark zeros, from the truth table, in the map. Combine zeros in such a way that the expression is minimum.

Sum Term: is a single literal or the logical sum of two or more literals.

Product term: is a single literal or the logical product of two or more literals.

### (Application of Boolean Logic)

Gate is an electronic system that performs a logical operation on a set of input signal(s). They are the building blocks of Integrated Circuits.

An SOP expression when implemented as circuit – takes the output of one or more AND gates and OR’s them together to create the final output.

An POS expression when implemented as circuit – takes the output of one or more OR gates and AND’s them together to create the final output.

Universal gates are the ones which can be used for implementing any gate like AND, OR and NOT, or any combination of these basic gates; NAND and NOR gates are universal gates.

Implementation of a SOP expression using NAND gates only

1) All 1st level AND gates can be replaced by one NAND gate each.

2) The output of all 1st level NAND gate is fed into another NAND gate. This will realize the SOP expression

3) If there is any single literal in expression, feed its complement directly to 2nd level NAND gate. Similarly, POS using NOR gate can be  implemented by replacing NAND by NOR gate.

Implementation of POS / SOP expression using NAND / NOR gates only.

1) All literals in the first level gate will be fed in their complemented form.

2) Add an extra NAND / NOR gate after 2nd level gate to get the resultant output.

## CBSE Class 12 Revision Notes and Key Points

Introduction to Boolean Algebra class 12 Notes Computer Science. CBSE quick revision note for class-12 Computer Science, Chemistry, Math’s, Biology and other subject are very helpful to revise the whole syllabus during exam days. The revision notes covers all important formulas and concepts given in the chapter. Even if you wish to have an overview of a chapter, quick revision notes are here to do if for you. These notes will certainly save your time during stressful exam days.

To download Introduction to Boolean Algebra class 12 Notes Computer Science, sample paper for class 12 Physics, Chemistry, Biology, History, Computer Science, Economics, Computer Science, Computer Science, Home Science, Accountancy, Computer Science and Home Science; do check myCBSEguide app or website. myCBSEguide provides sample papers with solution, test papers for chapter-wise practice, NCERT solutions, NCERT Exemplar solutions, quick revision notes for ready reference, CBSE guess papers and CBSE important question papers. Sample Paper all are made available through the best app for CBSE students and myCBSEguide website

### Test Generator

Create question paper PDF and online tests with your own name & logo in minutes.

### myCBSEguide

Question Bank, Mock Tests, Exam Papers, NCERT Solutions, Sample Papers, Notes

### 1 thought on “Introduction to Boolean Algebra class 12 Notes Computer Science”

1. cbse board has made some changes in their date sheet for 12th exam. the dates for physical exam were changed and the rest of the syllabus will be the same