Aoc Unit-1

Unit#1 Digital Logic Circuits:
Subject Department of
Computer Application
05BC2102
Architectural Organization of Subject:
Architectural
Computers Organization of
Computers
Unit#1
Asst. Prof. Sheth Niraj
● 1. To understand basic organization of digital computer.
● 2. To understand various digital circuits and components.

Course
● 3. To understand basics of CPU.
Objectives
● 4. To understand basics of IO.
● 5. To understand basics of Memory.
Faculty of Computer Application 2

Syllabus

● “Computer System
Architecture”, M. Morris
Books Mano, Pearson Publication,
Third Edition.

● 1. Digital Logic Circuits:

● 2. Digital Components:
UNIT: ● 3. Basic Computer Organization and Design:
● 4. Central Processing Unit:
● 5. Central Processing Unit:

● Digital Computers
● Logic Gates
UNIT – 1 ● Boolean Algebra

Digital Logic ● Map Simplification
Circuits ● Combinational Circuits
● Flip-Flops
● Sequential circuits

● Digital computer, any of a class of devices capable of

solving problems by processing information in
discrete form.
● It operates on data, including magnitudes, letters,
Digital and symbols, that are expressed in binary code—i.e.,
using only the two digits 0 and 1.
Computers
● By counting, comparing, and manipulating these
digits or their combinations according to a set of
instructions held in its memory, a digital computer
can perform such tasks as to control industrial
processes and regulate the operations of machines

● LAPTOP
Digital ● DESKTOP
Computers ● MOBILE
● PALMTOP

● Digital computers use the binary number system, which

has two digits 0 and 1.
● A binary digit is called a bit.
Digital ● Information is represented in digital computers in groups

Computers of bits.
● By using various coding techniques, groups of bits can be
made to represent not only binary numbers but also
other discrete symbols, such as decimal digits or letters
of the alphabet.

● Decimal Number System :
● Decimal Number System comprises digits from 0-9 that

are 0, 1, 2, 3, 4, 5, 6, 7, 8 & 9. The base or radix of the
Decimal Number System is 10 because the total number of
digits available in the Decimal Number System is 10. All
Digital the other digits can be expressed with the help of these 10
Computers digit numbers.
● Decimal Number System is the most common and easiest
number system used in our daily lives. Some of the
Decimal Number System examples are:
● 341, 56, 6789, 78.

● Binary Number System.
● Digital Computers use the binary number system to

manipulate and store all of their data including numbers,
words, videos, graphics, and music.
Digital ● The binary number system, also called the base-2 number
Computers system, is a method of representing numbers that counts
by using combinations of only two numerals: zero (0) and
one (1).
● Some example are
● 101, 1100101, 111000, 0001010

● Convert Decimal to binary.
• Step 1: Divide the given decimal number by 2 and note

down the remainder.
• Step 2: Now, divide the obtained quotient by 2, and note
the remainder again.
Digital • Step 3: Repeat the above steps until you get 0 as the
Computers quotient.
• Step 4: Now, write the remainders in such a way that the
last remainder is written first, followed by the rest in the
reverse order.
• This number is the binary value of the given decimal
number.
● For example 100= (?)2

number Remainder
2 100
2 50 0 ● Writing
from
Decimal to 2 25 0
bottom to
binary 2 12 1 top we get
2 6 0 ● (1100100)2
2 3 0
2 1 1
2 0 1
Decimal to
● Convert 356 decimal to binary
binary

Number Remainder
2 356
2 178 0
2 89 0 ● Writing from
bottom to top
2 44 1
Decimal to we get
2 22 0
binary 2 11 0 ● (101100100)2
2 5 1
2 2 1
2 1 0
2 0 1

● Convert binary to decimal.
● Step-1 Write down all the binary digit.
● Step-2 Multiply each digit by 2.
● Step-3 Starting from the left give the power to 2 in

Binary to sequence from 0 to n-1.
decimal ● Step-4 Sum all the numbers.

Binary to
● Convert 11010101 to decimal
decimal

1x27 + 1x26 + 0x25 + 1x24 + 0x23 + 1x22 + 0x21 + 1x20
Binary to
1x128 + 1x64 + 0 + 1x16 + 0 + 1x4 + 0 + 1x1
decimal
128+64+0+16+0+4+0+1 = 213
So 11010101 binary is = 213 decimal

Digital
Computers

● Input
● All the data received by the computer goes through

the input unit. The input unit comprises different
devices. Like a mouse, keyboard, scanner, etc. In
other words, each of these devices acts as a mediator
Digital between the users and the computer.
Computers ● The data that is to be processed is put through the
input unit. The computer accepts the raw data in
binary form. It then processes the data, and produces
the desired output.

● The 3 major functions of the input unit are-
• Take the data to be processed by the user.
• Convert the given data into machine-readable form.
Digital • And then, transmit the converted data into the main
Computers memory of the computer. The sole purpose is to
connect the user and the computer. In addition, this
creates easy communication between them.

● CPU – Central Processing Unit
● Central Processing Unit or the CPU, is the brain of the

computer. It works the same way a human brain works. As
the brain controls all human activities, the CPU too controls
all tasks.
Digital ● Moreover, the CPU conducts all the arithmetical and logical
Computers operations in the computer.
● Now the CPU comprises of two units, namely – ALU
(Arithmetic Logic Unit) and CU (Control Unit). Both of
these units work in sync. The CPU processes the data as a
whole.
Department of Computer Application 22

● ALU – Arithmetic Logic Unit
● The Arithmetic Logic Unit is made of two terms, arithmetic

and logic. There are two major functions that this unit
performs.
1. Data inserted through the input unit into the primary
memory. Performs the basic arithmetical operation on it.
Digital Like addition, subtraction, multiplication, and division. It
Computers performs all sorts of calculations required on the data. Then
sends back data to the storage.
2. The unit is also responsible for performing logical
operations like, AND, OR, Equal to, Less than, etc. In
addition to this it conducts merging, sorting, and selection
of the given data.
● CU – Control Unit
● The control unit as the name suggests is the controller of all

the activities/tasks and operations. All this is performed
inside the computer.
● The memory unit sends a set of instructions to the control
Digital unit. Then the control unit in turn converts those
Computers instructions. After that these instructions are converted to
control signals.
These control signals help in prioritizing and scheduling the

activities. Thus, the control unit coordinates the tasks inside
the computer in sync with the input and output units.
● Memory Unit
● All the data that has to be processed or has been processed

is stored in the memory unit. The memory unit acts as a hub
of all the data. It transmits it to the required part of the
computer whenever necessary.
Digital ● The memory unit works in sync with the CPU. This helps in
Computers faster accessing and processing of the data. Thus, making
tasks easier and faster.
● There are two types of computer memory-
● Primary memory
● Secondary memory

● Output
● There is nothing to be amazed by what the output unit is

used for. All the information sent to the computer once
processed is received by the user through the output unit.
Devices like printers, monitors, projector, etc. all come
Digital under the output unit.
Computers ● The output unit displays the data either in the form of a
soft copy or hard copy. The printer is for the hard copy. The
monitor is for the display. The output unit accepts the data
in binary form from the computer. It then converts it into a
readable form for the user.

● Logic Gates

● Flip-Flops

● 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.
● Logic gates has two state either 1 (high) or 0 (low)
● At any one time, a digital device will be in one of these

Logic Gates two binary situations. A light bulb can be used to
demonstrate the operation of a logic gate. When logic 0 is
supplied to the switch, it is turned off, and the bulb does
not light up. The switch is in an ON state when logic 1 is
applied, and the bulb would light up. In integrated circuits
(IC), logic gates are widely employed.

Logic Gates

● An AND gate has a single output and two or more inputs.
1. When all of the inputs are 1, the output of this gate is 1.
2. The AND gate’s Boolean logic is Y=A.B if there are two

inputs A and B.
Logic Gates ● An AND gate’s symbol and truth table are as follows:
AND gate TRUTH TABLE

BLOCK DIAGRAM / SYMBOL
A B A.B
0 0 0
0 1 0
1 0 0
Department of Computer Application 1 1 1 30
Number of possible combination depend upon the
variable so if n input are there then 2n possible
combination possible
So if 3 variable are there then 23 = 8 possibility
A B C
Logic Gates 0 0 0
AND gate 0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
Department of Computer Application
1 1 1 31
Logic Gates
AND gate

● Two or more inputs and one output can be used in an

OR gate.
1. The logic of this gate is that if at least one of the
inputs is 1, the output will be 1.
2. The OR gate’s output will be given by the following
Logic Gates
mathematical procedure if there are two inputs A
OR gate and B: Y=A+B TRUTH TABLE

A B A+B
0 0 0
0 1 1
1 0 1
1 1 1 33
Logic Gates
OR gate

● The NOT gate is a basic one-input, one-output gate.
1. When the input is 1, the output is 0 and vice versa. A

NOT gate is sometimes called as an inverter because
of its feature.
Logic Gates 2. If there is only one input A, the output may be

calculated using the Boolean equation Y=A’.
NOT gate
TRUTH TABLE
A A’
0 1
1 0

● Universal logic gates are the logic gates that are

capable of implementing any Boolean function
without requiring any other type of gate.
● They are called as “Universal Gates” because-
• They can realize all the binary operations.
Logic Gates • All the basic logic gates can be derived from them.
● There are following two universal logic gates

1. NAND Gate
2. NOR Gate
● Explain in next slide.

● A NAND gate, sometimes known as a ‘NOT-AND’ gate, is

essentially a Not gate followed by an AND gate.
1. This gate’s output is 1 only if none of the inputs is 1.
Alternatively, when all of the inputs are not high and at least
one is low, the output is high.
Logic Gates
NAND gate 2. If there are two inputs A and B, the Boolean expression for
the NAND gate is Y=(A.B)’ TRUTH TABLE

A B (A.B)’
0 0 1
0 1 1
1 0 1
1 1 0 37
Logic Gates
NAND gate

● A NOR gate, sometimes known as a “NOT-OR” gate,
consists of an OR gate followed by a NOT gate.
1. This gate’s output is 1 only when all of its inputs are 0.
Alternatively, when all of the inputs are low, the output
is high.
Logic Gates 2. The Boolean statement for the NOR gate is Y=(A+B)’ if
NOR gate there are two inputs A and B. TRUTH TABLE

A B (A+B)’
0 0 1
0 1 0
1 0 0
1 1 0 39
Logic Gates
NOR gate

● The Exclusive-OR or ‘Ex-OR’ gate is a digital logic gate that

accepts more than two inputs but only outputs one value.
1. If number of the ‘High’ inputs are odd then the output of the
XOR Gate is ‘High’, If number of the ‘High’ inputs are even
the output is ‘Low’.
Logic Gates
2. The Boolean equation for the XOR gate is Y=A’.B+A.B’ if
Ex-OR gate there are two inputs A and B. TRUTH TABLE

A B (A xor B)
0 0 0
0 1 1
1 0 1
1 1 0 41
Logic Gates
Ex-OR gate

● The Exclusive-NOR or ‘EX-NOR’ gate is a digital logic gate

that accepts more than two inputs but only outputs one.
1. If number of the ‘High’ inputs are even then the output of the
XOR Gate is ‘High’, If number of the ‘High’ inputs are odd the
output is ‘Low’.
Logic Gates
Ex-NOR gate 2. If there are two inputs A and B, then the XNOR gate’s
Boolean equation is: Y=A.B+A’B’. TRUTH TABLE

A B (A XNOR B)
0 0 1
0 1 0
1 0 0
1 1 1 43
Logic Gates
Ex-NOR gate

● Summary
Logic Gates

dsfdsfdsfdsafdasfadsfadsfads
fdasfadsfadsfdasfdsafdsfdasf
dasfadsfdsfdsfdasfadsfdasfds
fdasfdasfadsfadsfadsfdasfda
sfdsfadsfadsfdsafdsfdsfdsfad
sfadsfadsfdsfdasfd
Logic Gates

● ( (A . B + C’) . D)’
Logic Diagram

● ( A’ . ( A + B) ) + (A + B)
Logic Diagram

● Draw by your self

Logic Diagram
● A.B + A’.C + B’.(A+C’)

● Logic Gates

● Flip-Flops

● 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.
Boolean
● Variable used can have only two values. Binary 1 for HIGH
Algebra
and Binary 0 for LOW.
● Complement of a variable is represented by an overbar (-).
Thus, complement of variable B is represented as B Bar.
Thus if B = 0 then B Bar = 1 and B = 1 then B Bar = 0.

● Boolean Laws
● There are six types of Boolean Laws.
1) Commutative law
Boolean
● Any binary operation which satisfies the following
Algebra expression is referred to as commutative operation.
● Commutative law states that changing the sequence of

the variables does not have any effect on the output of
a logic circuit.
2) Associative law
● This law states that the order in which the logic
operations are performed is irrelevant as their effect
Boolean is the same.
Algebra
3) Distributive law
● Distributive law states the following condition.

4) AND law
● These laws use the AND operation. Therefore they
are called as AND laws.
Boolean
Algebra 5) OR law
● These laws use the OR operation. Therefore they are
called as OR laws.

6) INVERSION law
● This law uses the NOT operation. The inversion law
states that double inversion of a variable results in
the original variable itself.
Boolean
Algebra

● DE MORGAN’S LAW
● De Morgan has suggested two theorems which are

extremely useful in Boolean Algebra. The two
Boolean theorems are discussed below.
Algebra ● Theorem 1
● Theorem 2

● Table showing verification of the De Morgan's first

theorem
Boolean
Algebra
● Column 3 and 6 are same so

● Table showing verification of the De Morgan's second

theorem
Boolean
Algebra
● Column 3 and 6 are same so

● Example of simplify the Boolean expression.
Boolean
Algebra


● Example of simplify the Boolean expression.
Boolean
Algebra

● Simplify by our self.
● BC+BC´+BA=B
Boolean ● (A+C)(AD+AD´)+AC+C=A+C
Algebra ● A´(A+B)+(B+AA)(A+B´)=A+B
● A+A´B+A´BĆ+A´BĆ´D+A´BĆ´DÉ=A+B+C+D+E

● BC+BC´+BA
● B(C + C’ + A)
Boolean
● B(1 + A) (C+ C’=1)
Algebra
● B(1) (1+A=1)
● B

● Logic Gates

● Flip-Flops

Maurice Karnaugh
● Karnaugh is an
American physicist,
mathematician and
inventor.
Map
Simplification ● Karnaugh worked at
Bell Labs (1952-66),
developing the
Karnaugh map
(1954)

● The Map method involves a simple, straightforward

procedure for simplifying Boolean expressions.
● Map simplification may be regarded as a pictorial
arrangement of the truth table which allows an easy
interpretation for choosing the minimum number of
Map terms needed to express the function algebraically.
Simplification The map method is also known as Karnaugh map or
K-map.
● Each combination of the variables in a truth table is
called a mid-term.

● The K-map method is used for expressions containing 2, 3,
4, and 5 variables.
● For a higher number of variables, there is another method
used for simplification called the Quine-McClusky method.
● In K-map, the number of cells is similar to the total number
Map of variable input combinations.
Simplification ● For example, if the number of variables is three, the number
of cells is 23=8, and if the number of variables is four, the
number of cells is 24 =16. The K-map takes the SOP and
POS forms.
● SOP Stand for sum of product and pos stand for product of
sum.
● The K-map grid is filled using 0's and 1's. The K-map is solved by
making groups. There are the following steps used to solve the
expressions using K-map:
1. First, we find the K-map as per the number of variables.
2. Find the maxterm and minterm in the given expression.
Map 3. Fill cells of K-map for SOP with 1 respective to the minterms.
Simplification 4. Fill cells of the block for POS with 0 respective to the maxterm.
5. Next, we create rectangular groups that contain total terms in the
power of two like 2, 4, 8, … and try to cover as many elements as we
can in one group.
6. With the help of these groups, we find the product terms and sum
them up for the SOP form.

● Minterm means product of term. Sum of minterm

also know as sum of products. (SOP)
● In minterm we looking for 1.
● For example x.y.z + x’.y.z’

Map
Simplification
● Maxterm means sum of the term. Product of
maxterm also known as product of sum ( POS).
● In maxterm we looking for 0.
● For example (x+y+z) . (x’+y+z’)

Map
Simplification

● We start with minterm representation.
● 2 variable k map
● 2 variable k map require 2 =4 block.
Map
A B
Simplification
0 0
0 1
1 0
1 1

● In k-map each cell represent 1 min-term.
x y
0 0
0 1
Map 1 0
Simplification 1 1

● 3 variable k map
A B C
0 0 0
Map
0 0 1
Simplification 0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
A B C
0 0 0
0 0 1
0 1 0
Map 0 1 1
Simplification 1 0 0
1 0 1
1 1 0
1 1 1

A B C D
0 0 0 0 ● 4 variable k map
0 0 0 1
0 0 1 0
0 0 1 1
0 1 0 0
0 1 0 1
0 1 1 0
Map 0 1 1 1
Simplification 1 0 0 0
1 0 0 1
1 0 1 0
1 0 1 1
1 1 0 0
1 1 0 1
1 1 1 0
1 1 1 1
W X Y Z
0 0 0 0
0 0 0 1
0 0 1 0
0 0 1 1
0 1 0 0
0 1 0 1
0 1 1 0
Map
0 1 1 1
Simplification 1 0 0 0
1 0 0 1
1 0 1 0
1 0 1 1
1 1 0 0
1 1 0 1
1 1 1 0
1 1 1 176
● RULES FOR SIMPLIFICATION
● Groups may not include any cell containing a zero.
● Each cell with 1 must be included in at list 1 group.
● Groups may be in sizes that are powered of 2.

Map
● Try to form the largest possible groups.
Simplification
● Groups may overleap.
● Groups may be square or rectangular only.
● Groups may be horizontal or vertical but not diagonal.
● Groups may wrap around the table.

● Group of cell in the size of power of 2 only
Map
Simplification

● Try to make larger group if possible.
Map
Simplification
● Group can be overlap.

● Group can only be horizontal or vertical but not

diagonal.
Map
Simplification

● Group may wrap around the table.
Map
Simplification

Map
Simplification

● In K-map values of the variables are written in binary

form & the logic function can be expressed in one of
Map the following form
Simplification ● SUM OF PRODUCTS (SOP)
● PRODUCT OF SUM (POS)

● MIN TERM
● Min term is referred as product term or SOP
X Y Z MINTERM SYMBOL
0 0 0 X’.Y’.Z’ m0
Map 0 0 1 X’.Y’.Z m1
Simplification 0 1 0 X’.Y.Z’ m2
0 1 1 X’.Y.Z m3
1 0 0 X.Y’.Z’ m4
1 0 1 X.Y’.Z m5
1 1 0 X.Y.Z’ m6
1 1 1 X.Y.Z m7
● Sum Of Product Simplification
● Min term is referred as SOP.
● Where product term are added with each other.
● Sum of product specified by ∑.

Map
● Simplify following:
Simplification
● F(X,Y)= ∑(2,3)
● F(x,y,z)=m(0,4)
● F(X,Y,Z)= ∑(0,4,6,7)
● F(X,Y,Z)= ∑(2,3,6)
● F(A,B,C,D)= ∑m(3,6,9,12,13)
● F(W,X,Y,Z)= ∑(0, 2, 5, 7, 8, 10, 13, 14,15)
● MAX TERM
● Max term is referred as sum term or POS.
X Y Z MINTERM SYMBOL
0 0 0 X+Y+Z M0
Map 0 0 1 X+Y+Z’ M1
Simplification 0 1 0 X+Y’+Z M2
0 1 1 X+Y’+Z’ M3
1 0 0 X’+Y+Z M4
1 0 1 X’+Y+Z’ M5
1 1 0 X’+Y’+Z M6
1 1 1 X’+Y’+Z’ M7
● Product Of Sum Simplification
● Maxterm is referred as POS
● Where sum term are multiplied with each other.
● Sum of product specified by ∏.

Map
● Simplify following:
Simplification
● F(X,Y)= ∏(2,3)
● F(X,Y,Z)= ∏(0,1,4,5)
● F(X,Y,Z)= ∏(0, 3, 6, 7)
● F(W,X,Y,Z)= ∏M(4,5,6,11,15)
● F(A,B,C,D)= ∏(5, 7, 13, 15)
● F(W,X,Y,Z)= ∏(3,5,7,8,10,11,12,13)
● Don’t Care Condition
● Don’t care conditions is the condition where any single

square or map will appears as x and it is not necessary to
write it into Boolean expression.
● In k-map each cell represents a minterm or maxterm and the
Map 0’s and 1’s in k map represents the minterm that make the
Simplification function equal to either 0 or 1.
● But in some occasion, it doesn't matter whether a function
produces a 0 or 1 for a given minterm.
● When this condition occurs, an X is used in the map to
represent the don't care condition.

Map
Simplification

● Simplification using don’t care
● F(W,X,Y,Z) = ∑(1, 5, 6, 11, 12, 13, 14) + d(4)

Map
● F(A, B, C, D) = ∑(6, 7, 8, 9) + d(12, 13, 14, 15)
Simplification
● F(A, B, C, D) = ∏(4,8,12) + d(0,9,15)
● F (A, B, C, D) = ∏ (3,6,7) + d (2, 4)

● Logic Gates

● Flip-Flops

● Combinational circuit is a circuit whose output is

dependent only on the state of its current inputs.
● A combinational circuit is the circuit where more than 1
circuit is designed into single component.
Combinational ● It has N no of inputs and M no of outputs.
Circuits ● design digital applications and it transforms the data into
the digital manner.
● A combinational circuit is a connected arrangement of
logic gates with a set of inputs and outputs.

● The procedure involves the following steps:
• The Problem Is Stated.

1
• The Input And Output Variables Are Assigned Letter
2 Symbols.
Combinational
Circuits 3
• The Truth Table That Defines
• The Simplified Boolean Functions For Each Output

4 Are Obtained.
• The Logic Diagram Is Drawn.
5

● BLOCK DIAGRAM
Combinational
Circuits

● Example of combinational circuit

● Half adder
● Full adder
Combinational ● Parity generator
Circuits ● Parity checker
● Multiplexer
● Decoder

● Half adder is the simplest of all adder circuits.
● Half adder is a combinational arithmetic circuit that

adds two numbers and produces a sum bit (s) and carry
bit (c) both as output.
HALF ADDER ● The addition of 2 bits is done using a combination circuit
called a Half adder.
● The input variables are augend and addend bits and
output variables are sum & carry bits. X and Y are the
two input bits.

Block diagram
HALF ADDER

Truth Table
INPUT OUTPUT
X Y SUM CARRY
HALF ADDER 0 0 0 0
0 1 1 0
1 0 1 0
1 1 0 1

Logical Expression:
For Sum:
HALF ADDER
Sum = A XOR B

Logical Expression:
For Carry:
HALF ADDER
Carry = A AND B

Implementation:
HALF ADDER

● Full adder is the combinational circuit.
● Full Adder is the adder that adds three inputs and

produces two outputs.
FULL ADDER ● The first two inputs are A and B and the third input is
an input carry as C-IN.
● The output carry is designated as C-OUT and the
normal output is designated as S which is SUM.

Block diagram
FULL ADDER

Truth Table
FULL ADDER

FULL ADDER

Full Adder Circuit
FULL ADDER

● Logic Gates

● Flip-Flops

● It is a digital logic circuit whose output depends on the
present inputs as well as previous inputs.
● It can describe by the output values as well as state values. It
contains at least one memory element.
● It is difficult to design and understand.
Sequential ● However, if a circuit uses both gates and flip-flops, it is
circuits called a sequential circuit.
● Hence, a sequential circuit is an interconnection of flip-flops
and gates.
● If we think of a sequential circuit as some black box that,
when provided with some external input, produces some
external output
● The external inputs constitute some of the inputs to

the combinational circuit.
● The internal outputs of the combinational circuit are
the internal inputs to the flip-flops.
Sequential ● Examples of sequential circuits:
circuits ● Registers
● Shift Registers
● Counters
● Ripple Counters
● Synchronous Counters
● Flip-flops

● Logic Gates

● Flip-Flops

● A Flip-flop is a binary cell capable of storing one bit of

information.
● It is called by stable device because it have 2 stable
position either 0 or 1
● It has two outputs, one for the normal value and one for
Flip-Flops
the complement value of the bit stored in it.
● Flip-flops are storage elements utilized in synchronous
sequential circuits.
● Synchronous sequential circuits employ signals that
effect storage elements only at discrete instances of time

● There are basically four different types of flip flops

and these are:
Flip-Flops ● 1. Set-Reset (SR) flip-flop or Latch.

● 2. D (Data or Delay) flip-flop
● 3. JK flip-flop
● 4. T (Toggle) flip-flop

● The RS Flip Flop is considered as one of the most

basic sequential logic circuits.
● The Flip Flop is a one-bit memory bi-stable device.
● It has two inputs, one is called “SET” which will set

SR Flip-Flops the device (output = 1) and is labelled S and another
is known as “RESET” which will reset the device
(output = 0) labelled as R.
● The RS stands for SET/RESET.

BLOCK DIAGRAM TRUTH TABLE
S R OUTPUT Q
RS Flip-Flops 0 0 No Change
0 1 Reset
1 0 Set
1 1 Invalid

RS Flip-Flops

● The D flip-flop is a clocked flip-flop with a single

digital input ‘D’.
● Each time a D flip-flop is clocked, its output follows
D Flip-Flops the state of ‘D’.
● The D Flip Flop has only two inputs D and CP.
● The D inputs go precisely to the S input and its

complement is used to the R input.

Clk D OUTPUT Q(t+1)

0 0 No Change
D Flip-Flops 0 1 No Change
1 0 First Stage (0)
1 1 Next Stage(1)

D Flip-Flops

● Unlike the JK Flip-flop, the basic S-R NAND flip-flop circuit
has many advantages and uses in sequential logic circuits
but it suffers from two basic switching problems.
• 1. the Set = 1 and Reset = 1 condition (S = R = 1) must always
be avoided
• 2. if Set or Reset change state while the enable (EN) input is
JK Flip-Flops
high the correct latching action may not occur
● Then to overcome these two fundamental design problems
with the SR flip-flop design, the JK flip Flop was developed.
● This simple JK flip Flop is the most widely used of all the flip-
flop designs and is considered to be a universal flip-flop
circuit.
J K OUTPUT Q
JK Flip-Flops 0 0 No Change
0 1 Clear
1 0 Set to 1
1 1 Q(t)’ – complement

JK Flip-Flops

● The T flip-flop is also called toggle flip-flop. It is a

change of the JK flip-flop.
● The T flip flop is received by relating both inputs of a
JK flip-flop.
T Flip-Flops
● The T flip-flop is received by relating the inputs ‘J’
and ‘K’. When T = 0, both AND gates are disabled.
● Therefore, there is no change in the output. When
T= 1, the output toggles.

Clk T OUTPUT Q
T Flip-Flops 0
0
0
1
NO CHANGE
NO CHANGE
1 0 1 (Q’)
1 1 0 (Q)

T Flip-Flops

THANK YOU

Aoc Unit-1

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Aoc Unit-1

Uploaded by

Copyright:

Available Formats

Unit#1 Digital Logic Circuits:

● 1. To understand basic organization of digital computer.

● 2. To understand various digital circuits and components.

● 5. To understand basics of Memory.

Faculty of Computer Application 2

Faculty of Computer Application 3

Faculty of Computer Application 4

● 1. Digital Logic Circuits:

Faculty of Computer Application 5

UNIT – 1 ● Boolean Algebra

Faculty of Computer Application 6

● Digital computer, any of a class of devices capable of

Faculty of Computer Application 7

Faculty of Computer Application 8

● Digital computers use the binary number system, which

Digital ● Information is represented in digital computers in groups

Faculty of Computer Application 9

● Decimal Number System :

● Decimal Number System comprises digits from 0-9 that

Faculty of Computer Application 10

● Binary Number System.

● Digital Computers use the binary number system to

Faculty of Computer Application 11

• Step 1: Divide the given decimal number by 2 and note

● For example 100= (?)2

Faculty of Computer Application 14

Faculty of Computer Application 15

● Step-1 Write down all the binary digit.

● Step-2 Multiply each digit by 2.

● Step-3 Starting from the left give the power to 2 in

Faculty of Computer Application 16

Faculty of Computer Application 17

1x27 + 1x26 + 0x25 + 1x24 + 0x23 + 1x22 + 0x21 + 1x20

So 11010101 binary is = 213 decimal

Faculty of Computer Application 18

Faculty of Computer Application 19

● All the data received by the computer goes through

Faculty of Computer Application 20

● The 3 major functions of the input unit are-

• Take the data to be processed by the user.

• Convert the given data into machine-readable form.

Faculty of Computer Application 21

● CPU – Central Processing Unit

● Central Processing Unit or the CPU, is the brain of the

Department of Computer Application 22

● The Arithmetic Logic Unit is made of two terms, arithmetic

● The control unit as the name suggests is the controller of all

These control signals help in prioritizing and scheduling the

● All the data that has to be processed or has been processed

Department of Computer Application 25

● There is nothing to be amazed by what the output unit is

Department of Computer Application 26

UNIT – 1 ● Boolean Algebra

Department of Computer Application 27

● Logic gates are the basic building blocks of any digital

● At any one time, a digital device will be in one of these

Department of Computer Application 28

Department of Computer Application 29

1. When all of the inputs are 1, the output of this gate is 1.

2. The AND gate’s Boolean logic is Y=A.B if there are two

AND gate TRUTH TABLE

Department of Computer Application 32

● Two or more inputs and one output can be used in an