Scribd
Upload
24 views

Unit 6 Electronics Digital Electronics

This document outlines the syllabus for a Basic Electrical & Electronics Engineering course, focusing on digital electronics. It covers topics such as number systems, logic gates, Boolean algebra, combinational circuits, and sequential circuits including flip-flops. Key concepts include truth tables, basic identities of Boolean algebra, and types of flip-flops.

Uploaded by

tsaimanojreddy
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
24 views

Unit 6 Electronics Digital Electronics

This document outlines the syllabus for a Basic Electrical & Electronics Engineering course, focusing on digital electronics. It covers topics such as number systems, logic gates, Boolean algebra, combinational circuits, and sequential circuits including flip-flops. Key concepts include truth tables, basic identities of Boolean algebra, and types of flip-flops.

Uploaded by

tsaimanojreddy
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/ 39

UNIT III

DIGITAL ELECTRONICS

23EEE101 Basic Electrical & Electronics Engineering


Syllabus:
Overview of Number Systems, Logic gates including
Universal Gates, BCD codes, Excess-3 code, Gray
code, Hamming code. Boolean Algebra, Basic
Theorems and properties of Boolean Algebra, Truth-
Tables and Functionality of Logic Gates – NOT, OR,
AND, NOR, NAND, XOR and XNOR. Simple
combinational circuits–Half and Full Adder,
Introduction to sequential circuits, Flip flops,
Registers and counters (Elementary Treatment only)
Overview of Number Systems:
DIGITAL LOGIC GATES:
Algebraic
Name Graphical Symbol Truth Table
Function
A B F
A F=A B 0 0 0
AND F or 0 1 0
B F = AB 1 0 0
1 1 1
A B F
A 0 0 0
OR F F=A+B 0 1 1
B 1 0 1
1 1 1

F =A A F
NOT A F or 0 1
1 0
F = A’

A B F
A 0 0 1
NAND F F = AB 0 1 1
B 1 0 1
1 1 0
A B F
A 0 0 1
NOR F F=A+B 0 1 0
B 1 0 0
1 1 0
A B F
A 0 0 0
XOR F F=A B 0 1 1
B 1 0 1
1 1 0
Table
Basic Identities of Boolean Algebra

Basic Postulates
A•B=B•A A+B=B+A Commutative Laws
A • (B + C) = (A • B) + (A • C) A + (B • C) = (A + B) • (A + C) Distributive Laws
1•A=A 0+A=A Identity Elements
A• A =0 A+ A =1 Inverse Elements
Other Identities
0•A=0 1+A=1
A•A=A A+A=A
A • (B • C) = (A • B) • C A + (B + C) = (A + B) + C Associative Laws
A·B= A + B A +B= A· B DeMorgan's Theorem

© 2016 Pearson Education, Inc., Hoboken, NJ.


All rights reserved.
FLIP-FLOP CIRCUITS:
The memory elements used in clocked sequential
circuits are called flip-flops. These circuits are binary
cells capable of storing one bit of information. It has
two outputs, one for the normal value and one for
the complement value of the bit stored in it : Binary
information can enter a flip-flop in a variety of ways.
Hence there different types of flip-flops.
The following are the types of flip-flops :
1. R-S flip-flop.
2. D flip-flop.
3. J-K flip flop.
4. T flip-flop

You might also like