Professional Documents
Culture Documents
Computer System & Architecture Digital Logic Circuits and Components 1.1. Digital Computers Definition
Computer System & Architecture Digital Logic Circuits and Components 1.1. Digital Computers Definition
CHAPTER 1
DEFINITION:
1. A computer that performs calculations and logical operations with quantities represented as digits,
usually in the binary number system.
3. Mini computers:
In terms of size and processing capacity, minicomputers lie in between mainframes and
microcomputers. Minicomputers are also called mid-range systems or workstations. The term
began to be popularly used in the 1960s to refer to relatively smaller third generation
computers. They took up the space that would be needed for a refrigerator or two and used
transistor and core memory technologies.
4. Super computers:
DEFINITION:
A logic gate is a basic building block of a digital circuit that has two inputs and
one output. These gates are implemented using electronic switches like transistors,
diodes. But, in practice basic logic gates are built using CMOS technology, FETS
and MOSFET(Metal Oxide Semiconductor FET)s.
The basic logic gates are categorized into seven: AND, OR, XOR, NAND, NOR,
XNOR and NOT. These logic gates with their logic gate symbols and truth tables are
explained below.
UNIVERSAL LOGIC GATE
A universal logic gate is one which can implement any Boolean function {0,1}, without the use of any
other logic gate. The NAND and NOR gates are called universal logic gates because all the other
gates can be created using these two.
1.3.BOOLEAN ALGEBRA
Boolean Algebra is used to analyze and simplify the digital (logic) circuits. It uses
only the binary numbers i.e. 0 and 1. It is also called as Binary Algebra or logical
Algebra. Boolean algebra was invented by George Boole in 1854.
ORing of the variables is represented by a plus (+) sign between them. For
example ORing of A, B, C is represented as A + B + C.
BOOLEAN LAWS:
BOOLEAN FUNCTION
Boolean algebra deals with binary variables and logic operation. A Boolean
Function is described by an algebraic expression called Boolean expression which
consists of binary variables, the constants 0 and 1, and the logic operation symbols.
Consider the following example.