0% found this document useful (0 votes)
66 views8 pages

Class XI Computer Science Lesson 14 Logic Gates Part 1 Session 2023-'24

This document provides an introduction to logic gates, including their definitions, functions, and truth tables. It covers basic gates such as AND, OR, NOT, NAND, NOR, EX-OR, and EX-NOR, explaining their operations and symbols. Additionally, it discusses the combination of gates to create complex functions and includes worksheets for practice.

Uploaded by

vermarajveer160
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
66 views8 pages

Class XI Computer Science Lesson 14 Logic Gates Part 1 Session 2023-'24

This document provides an introduction to logic gates, including their definitions, functions, and truth tables. It covers basic gates such as AND, OR, NOT, NAND, NOR, EX-OR, and EX-NOR, explaining their operations and symbols. Additionally, it discusses the combination of gates to create complex functions and includes worksheets for practice.

Uploaded by

vermarajveer160
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Class XI

Computer Science
Lesson 14
Logic Gates-Part 1

Video Tutorial:

Logic Gates
Basic Logic Gates - OR | AND | NOT | XOR gates
XNOR Gate in Boolean Algebra with Truth Table and Equation

Introduction:

Boolean functions may be practically implemented by using electronic gates. The following
points are important to understand.
Electronic gates require a power supply.
Gate INPUTS are driven by voltages having two nominal values, e.g. 0V and 5V representing
logic 0 and logic 1 respectively.
The OUTPUT of a gate provides two nominal values of voltage only, e.g. 0V and 5V
representing logic 0 and logic 1 respectively. In general, there is only one output to a logic
gate except in some special cases.
There is always a time delay between an input being applied and the output responding.

Logic states

True False

1 0

High Low

+Vs 0V

On Off

Gates are identified by their function: NOT, AND, NAND, OR, NOR, EX-OR and EX-NOR. Capital
letters are normally used to make it clear that the term refers to a logic gate.

Page 1 of 8
Class XI
Computer Science
Lesson 14
Logic Gates-Part 1

Truth Tables

Truth tables help understand the behaviour of logic gates.


• They show how the input(s) of a logic gate relate to its output(s).
• The gate input(s) are shown in the left column(s) of the table with all the different
possible input combinations. This is normally done by making the inputs count up in
binary.
• The gate output(s) are shown in the right hand side column.

Truth Table Diagram

Page 2 of 8
Class XI
Computer Science
Lesson 14
Logic Gates-Part 1

Logic Gates

Logic gates are the basic building blocks of any digital system. It is an electronic circuit having
one or more than one input and only one output. The relationship between the input and the
output is based on a certain logic. Based on this, logic gates are named as AND gate, OR gate,
NOT gate etc.

AND gate

The AND gate is an electronic circuit that gives a high output (1) only if all its inputs are
high. A dot (.) is used to show the AND operation i.e. A.B. Bear in mind that this dot is
sometimes omitted i.e. AB

OR gate

The OR gate is an electronic circuit that gives a high output (1) if one or more of its inputs
are high. A plus (+) is used to show the OR operation.

Page 3 of 8
Class XI
Computer Science
Lesson 14
Logic Gates-Part 1

NOT gate

The NOT gate is an electronic circuit that produces an inverted version of the input at its
output. It is also known as an inverter. If the input variable is A, the inverted output is
known as NOT A. This is also shown as A', or A with a bar over the top, as shown at the
outputs.

NAND gate

This is a NOT-AND gate which is equal to an AND gate followed by a NOT gate. The outputs
of all NAND gates are high if any of the inputs are low. The symbol is an AND gate with a
small circle on the output. The small circle represents inversion.

NOR gate

Page 4 of 8
Class XI
Computer Science
Lesson 14
Logic Gates-Part 1

This is a NOT-OR gate which is equal to an OR gate followed by a NOT gate. The outputs of
all NOR gates are low if any of the inputs are high.The symbol is an OR gate with a small
circle on the output. The small circle represents inversion.

EX-OR gate

The 'Exclusive-OR' gate is a circuit which will give a high output if either, but not both, of
its two inputs are high. An encircled plus sign ( ) is used to show the EOR operation.

EX-NOR gate

The 'Exclusive-NOR' gate circuit does the opposite to the EOR gate. It will give a low output
if either, but not both, of its two inputs are high. The symbol is an EXOR gate with a small
circle on the output. The small circle represents inversion.

Page 5 of 8
Class XI
Computer Science
Lesson 14
Logic Gates-Part 1

The NAND and NOR gates are called universal functions since with either one the AND and
OR functions and NOT can be generated.

Note:

A function in sum of products form can be implemented using NAND gates by replacing all
AND and OR gates by NAND gates.

A function in product of sums form can be implemented using NOR gates by replacing all
AND and OR gates by NOR gates

Combinations of logic gates

Logic gates can be combined to produce more complex functions.

For example to produce an output Q which is true only when input A is true and input B is
false, we can combine a NOT gate and an AND gate as shown.

Logic diagram of a boolean function


The logic diagram for the Boolean function F = x + y'z can be represented as:

Page 6 of 8
Class XI
Computer Science
Lesson 14
Logic Gates-Part 1

• The Boolean function F = x + y'z is transformed from an algebraic expression into a


logic diagram composed of AND, OR, and inverter gates.
• Inverter at input 'y' generates its complement y'.
• There is an AND gate for the term y'z, and an OR gate is used to combine the two
terms (x and y'z).
• The variables of the function are taken to be the inputs of the circuit, and the
variable symbol of the function is taken as the output of the circuit.
• The truth table for the Boolean function F = x + y'z can be represented as:

Worksheet
1. Draw the logic circuit of NOR and NAND gate only.
2. Name the logic gate for the following circuit diagram and write its truth table.

Page 7 of 8
Class XI
Computer Science
Lesson 14
Logic Gates-Part 1

3. Consider the following truth table where A and B are two inputs and X is the output:

Name and draw the logic gate for the given truth table.

4. From the logic circuit diagram given below, find the output ‘F’ and simplify it.
Also, state the law represented by the logic diagram.

5. Differentiate between XNOR and XOR gates. Draw the truth table and logic diagrams of 3
input XNOR gate.
6. Draw a logic circuit for (A + B).(C + D). C

Page 8 of 8

You might also like