0% found this document useful (0 votes)
62 views10 pages

Printer

This document outlines the contents and topics covered in a computer course. The course contains 4 units: (1) Introduction and Evolution of Computer, (2) Classification of Computer, (3) Number System and Their Conversion, and (4) Logic Function and Boolean Algebra. Unit 4 covers logic gates like AND, OR, NOT, NAND, NOR, XOR, and XNOR gates. It also discusses universal gates, De Morgan's theorems, and Boolean expressions.

Uploaded by

Sudeep Raj Karki
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)
62 views10 pages

Printer

This document outlines the contents and topics covered in a computer course. The course contains 4 units: (1) Introduction and Evolution of Computer, (2) Classification of Computer, (3) Number System and Their Conversion, and (4) Logic Function and Boolean Algebra. Unit 4 covers logic gates like AND, OR, NOT, NAND, NOR, XOR, and XNOR gates. It also discusses universal gates, De Morgan's theorems, and Boolean expressions.

Uploaded by

Sudeep Raj Karki
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/ 10

COURSE CONTENTS

Unit-1 ............................................................................................................................... 2
Introduction and Evolution of Computer ................................................... 2
1.1 Concept and characteristics of computer ................................... 2
Unit-2 ............................................................................................................................... 3
Classification of Computer ................................................................................ 3
Unit-3 ............................................................................................................................... 4
Number System and Their Conversion ....................................................... 4
Unit-4 ............................................................................................................................... 5
Logic Function and Boolean Algebra............................................................ 5
Logic gate ............................................................................................................. 5
Unit-1
Introduction and Evolution of Computer

Computer is an electronic device which gives us useful information when given


any kind of data.
1.1 Concept and characteristics of computer
Unit-2
Classification of Computer
Unit-3
Number System and Their Conversion
Unit-4
Logic Function and Boolean Algebra
4.1 Logic gate
A logic gate is an electronic circuit which generates only one output signal from
one or more input signal.
And gate
It is an electronic circuit used to perform logical multiplication and it is denoted
by dot operator (.).
Graphical symbol:
Truth table
Input output
A A B O=A.B
0 0 0
O 0 1 0
B 1 0 0
1 1 1

Boolean Expression
O=A.B
OR GATE
It is an electronic circuit used to perform logical addition and for that it uses plus
operator (+).
Graphical Symbol
Truth table
Input output
A A B O=A+B
0 0 0
O 0 1 1
B 1 0 1
1 1 1

Boolean expression :O=A+B


NOT GATE
It is an electronic circuit used to perform logical complement and for that it uses
single quote or bar operator (‘or ⁻).
Graphical Gate
Truth table
Input output
A A’ A O=A’
0 1
1 0

Boolean Expression: O=A’


NAND GATE
It is an electronic circuit used to perform complement logical multiplication.
Graphical Symbol
Truth table
Input output
A A B O=A.B
O 0 0 1
0 1 1
B 1 0 1
1 1 0

Boolean expression :O=(A.B)’


NOR GATE

It is an electronic circuit used to perform complement of logical addition. It uses


plus operator.
Graphical Symbol
Truth table
Input output
A A B O=(A+B)`
0 0 1
O
0 1 0
B 1 0 0
1 1 0

Boolean Expression :O=(A+B)’


X-OR Gate
It is an electronic circuit used to perform “either/or” operation.
Graphical Symbol

Truth table
A Input output
A B O=(A+B)
O 0 0 0
0 1 1
1 0 1
B 1 1 0

Boolean Expression:O=A’.B+A.B’
X-NOR Gate
It is an electronic circuit used to perform logical complement of Exclusive-OR
operation.

Truth table
Input output
A A B O=(A B)’
0 0 1
O 0 1 0
1 0 0
1 1 1
B

Boolean Expression:O=A.B+A’.B’
Universal Gate
A universal gate is a gate which can implement any Boolean function without
using any other types of gates.

A A A
Out AA=A

A A.B A
A.B NAND
AND
A.B
B B

A A

A
NAND OR A+B
B
B

B
DE MORGAN’S THEOREM
THEOREM 1
A
The complement of a sum of variables is equal to O=(A+B)'
B
the product of the complement of each variable.
Proof: (A+B)'=A'.B' A
O=A'+B'
B
Hence, (A+B)'=A'.B'
A B A' B' A+B (A+B)' A'.B'
0 0 1 1 0 1 1
0 1 1 0 1 0 0
1 0 0 1 1 0 0
1 1 0 0 1 0 0
THEOREM 2
The complement of product of variables is equal A
O= (A.B)'
to the sum of the complement of each variable. B
Proof:(A.B)'= A'+B'
A
O=A'+B'
B
A B A' B' A+B (A+B)' A'+B'
0 0 1 1 0 1 1
0 1 1 0 1 0 0
1 0 0 1 1 0 0
1 1 0 0 1 0 0

Hence, (A.B)'= A'+B'.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy