Access free live classes and tests on the app
Download
+
Unacademy
  • Goals
    • AFCAT
    • AP EAMCET
    • Bank Exam
    • BPSC
    • CA Foundation
    • CAPF
    • CAT
    • CBSE Class 11
    • CBSE Class 12
    • CDS
    • CLAT
    • CSIR UGC
    • GATE
    • IIT JAM
    • JEE
    • Karnataka CET
    • Karnataka PSC
    • Kerala PSC
    • MHT CET
    • MPPSC
    • NDA
    • NEET PG
    • NEET UG
    • NTA UGC
    • Railway Exam
    • SSC
    • TS EAMCET
    • UPSC
    • WBPSC
    • CFA
Login Join for Free
avtar
  • ProfileProfile
  • Settings Settings
  • Refer your friendsRefer your friends
  • Sign outSign out
  • Terms & conditions
  • •
  • Privacy policy
  • About
  • •
  • Careers
  • •
  • Blog

© 2023 Sorting Hat Technologies Pvt Ltd

CBSE Class 11 » CBSE Class 11 Study Materials » Computer Science » Boolean Logic
CBSE

Boolean Logic

In this article, we define Boolean logic and discuss concepts associated with Boolean algebra, examples of Boolean logic, and basic Boolean logic.

Table of Content
  •  

Boolean logic is a form of algebra where the value of variables is expressed in truth values instead of elementary algebra. This algebra form involves three terms: AND, OR, and NOT. Boolean logic was introduced by George Boole, from where it gets its name. This form of algebra is used to simplify and help decision-making. It is applied in simple calculators, computers, electronics, and programming languages. This type of algebra can help make clear and black and white decisions.  

Overview of Boolean Logic

  • Boolean logic is a form of algebra where variables are truth values and lie between 0 and 1. 
  • It implies that all values are either true or false.
  • There are certain logical operations in Boolean algebra, such as conjunction and disjunction.
  • It is aimed at simple decision-making. 
  • Boolean variable refers to the variables representing the logical quantities between 0 and 1.
  • Literal is a term used to denote variables or their complements, where complement refers to the inverse. 
  • The truth table is a table that contains all possible combinations of logical variables.
  • Boolean algebra only involves the use of variables that are binary or have only two values.
  • An example of Boolean logic could be Red AND Shoes to find red shoes. 
  • There are three main Boolean operators: AND, OR, and NOT.

Boolean Operators

There are three major operators in Boolean logic:  AND, OR, and NOT:

  • Conjunction or AND operation
  • Negation or NOT negation
  • Disjunction or OR operation

Boolean Expression 

A Boolean expression is a logical statement that produces a Boolean value, either True or False. Synonyms such as ‘Yes’ for ‘True’ and ‘No’ for ‘False’ are sometimes used to express the statement. In addition, digital circuits for True and False use the numbers 1 and 0.

Statements that use logical operators, such as AND, OR, XOR, and NOT, are Boolean expressions. As a result, writing X AND Y = True is a Boolean expression.

Terminologies

Some of the critical terms in Boolean algebra are as follows:

Boolean Algebra: Boolean algebra is the branch of mathematics concerned with logical operations and binary variables.

Boolean Variable: A Boolean variable is a variable or a symbol, usually an alphabet, that represents logical quantities like 0 or 1.

Boolean Function: Binary variables, logical operators, constants like 0 and 1, equal to the operator, and parenthesis symbols make up a Boolean function.

Literal: A literal is a variable or a variable’s complement.

Complement: The inverse of a variable is represented by a bar over the variable.

Truth Table: The truth table is a table that lists all of the possible values and combinations of logical variables. A truth table can be created by converting the Boolean equation. The truth table should have 2n rows, with “n” denoting the number of variables in the equation. The number of rows in the truth table is 8. For example, if a Boolean equation has three variables. 23 = 8 (i.e.

Laws of Boolean Logic :-

1) Law of Commutation

A commutative operation is any binary operation that satisfies the following expression. The commutative law states that changing the order of the variables does not affect the logic circuit’s output.

  1. B = B. A. B = A. B = A. B = A. B

B + A = A + B

2) Law of Association

It claims that the order in which the logic operations are carried out makes no difference because the result is the same.

(A.B.) A = C. ( B . C )

A + (B + C) = (A + B + C).

3) The Law of Distribution

The following conditions are stated in distributive law:

(A. B + C) = (A. B) + (A. B) + (A. B) + (A. B) + (A. (A. C)

(A + B) = A + (B. C). (A + C)

AND THE LAW

The AND operation is used in these laws. As a result, they’re known as AND laws.

.0 = 0 A.0 = 0 A.0 = 0 A.0

  1. A. A. A. A. A. A. A. A. A

A = A.1

OR the law

The OR operation is used in these laws. As a result, they are known as OR laws.

A + 0 equals A

1 = A + 1

A + A equals A

4) The Law of Inversion

The NOT operation is used in this law. According to the inversion law, double inversion of a variable results in the original variable.

faq

Frequently Asked Questions

Get answers to the most common queries related to the CBSE Class 11 Examination Preparation.

Why is Boolean Logic important?

Ans : The “information age,” also known as the “computer age,” is built on the foundations o...Read full

Where is Boolean logic used?

Ans : The ability to combine synonyms and variant concepts to access relevant items is provided by Boolean logic and...Read full

What are examples of Boolean logic?

Ans : The use of words and phrases like “and,” “or,” and “not” in search tools t...Read full

What is De Morgan's Theorem?

Ans : Demorgan’s theorem defines the uniformity of a gate with the same inverted input and output. It’s ...Read full

Who invented Boolean logic?

Ans : Boolean logic is a type of algebra named after the nineteenth-century mathematician George Boole...Read full

Ans : The “information age,” also known as the “computer age,” is built on the foundations of Boolean logic. This is because each “value” in these logical statements or equations can only be true or false, with no ambiguity. It’s binary logic.

Ans : The ability to combine synonyms and variant concepts to access relevant items is provided by Boolean logic and operators (based on Boolean algebra) in most information databases. The basic Boolean connectors include AND, OR, and NOT.

Ans : The use of words and phrases like “and,” “or,” and “not” in search tools to get the most related results is referred to as Boolean logic. Using “recipes AND potatoes” to find potato-containing recipes is an example of Boolean logic in action.

Ans : Demorgan’s theorem defines the uniformity of a gate with the same inverted input and output. It’s used to implement basic gate operations such as the NAND and NOR gates.

Ans : Boolean logic is a type of algebra named after the nineteenth-century mathematician George Boole, in which all values are reduced to TRUE or FALSE.

Crack K-12 with Unacademy

Get subscription and access unlimited live and recorded courses from India’s best educators

  • Structured syllabus
  • Daily live classes
  • Ask doubts
  • Tests & practice
Learn more

Notifications

Get all the important information related to the CBSE Class 11 Exam including the process of application, important calendar dates, eligibility criteria, exam centers etc.

Data Correction
Exam Pattern for Class 11th
Registration Process
Syllabus
See all

Related articles

Learn more topics related to Computer Science
Use of Data Types in Computer Science

Data types in computer science help the compiler understand the programmer's intention for using the data. In addition, it helps in understanding data types that ensure the data is collected in the preferred format and the value of the function is given out as expected.

Units of Memory

A memory device refers to a device that can store data. The quantity of data stored in a unit of memory is called a memory unit.

Types of Software

A computer is controlled by software required to fulfil a specific need or perform tasks. System software and application software are the two categories of software.

System Software (Operating Systems, System Utilities, Device Drivers)

There are two kinds of software: system software and application software. A system software program is a set of applications that control and manage the operations of computer hardware.

See all
Access more than

5,130+ courses for CBSE Class 11

Get subscription

Trending Topics

  • Withdrawal Slip
  • Wildlife Conservation
  • Moving Coil Galvanometer
  • Ogive Curves
  • PPT Full Form
  • Reordering Of Sentences
  • Central Problems Of An Economy
  • Transcription In Eukaryotes
combat_iitjee

Important Links

  • NCERT Solutions
  • NCERT Books
  • Physics Formulas
  • Maths Formulas
  • Chemistry Formulas
testseries_iitjee
Download NEET 2022 question paper
.
Company Logo

Unacademy is India’s largest online learning platform. Download our apps to start learning


Starting your preparation?

Call us and we will answer all your questions about learning on Unacademy

Call +91 8585858585

Company
About usShikshodayaCareers
we're hiring
BlogsPrivacy PolicyTerms and Conditions
Help & support
User GuidelinesSite MapRefund PolicyTakedown PolicyGrievance Redressal
Products
Learner appLearner appEducator appEducator appParent appParent app
Popular goals
IIT JEEUPSCSSCCSIR UGC NETNEET UG
Trending exams
GATECATCANTA UGC NETBank Exams
Study material
UPSC Study MaterialNEET UG Study MaterialCA Foundation Study MaterialJEE Study MaterialSSC Study Material

© 2025 Sorting Hat Technologies Pvt Ltd

Unacademy
  • Goals
    • AFCAT
    • AP EAMCET
    • Bank Exam
    • BPSC
    • CA Foundation
    • CAPF
    • CAT
    • CBSE Class 11
    • CBSE Class 12
    • CDS
    • CLAT
    • CSIR UGC
    • GATE
    • IIT JAM
    • JEE
    • Karnataka CET
    • Karnataka PSC
    • Kerala PSC
    • MHT CET
    • MPPSC
    • NDA
    • NEET PG
    • NEET UG
    • NTA UGC
    • Railway Exam
    • SSC
    • TS EAMCET
    • UPSC
    • WBPSC
    • CFA

Share via

COPY