Course Plan Digital Electronics
Course Plan Digital Electronics
Course Plan Digital Electronics
For
(20EC104) DIGITAL ELECTRONICS
Course Instructors :
L-T-P : 3-0-2
Credits :4
Course Level : UG
School of Engineering
SR University,
Warangal
Page 1 of 14
1.COURSE CONTEXT
DEPARTMENT ECE
SCHOOL Engineering
2.COURSE BRIEF
DIGITAL
COURSE TITLE ELECTRONICS PRE-REQUISITES NA
COURSE CODE (20EC104) TOTAL CREDITS 4
COURSE TYPE Program Core L-T-P FORMAT 3-0-2
3.COURSE SUMMARY
This course provides a comprehensive understanding of digital electronics, covering both theoretical
concepts and practical implementations. Students will learn about number systems, logic gates,
Boolean algebra, combinational and sequential circuit design, and programmable logic devices.
4.COURSE-SPECIFIC LEARNING OUTCOMES (CO)
By the end of this program, students should have the following knowledge, skills and values:
CO1: Understand digital logic gates, Boolean algebra, and the fundamental principles of digital
circuits, analyze and design basic digital circuits utilizing logic gates.
CO2: Implement digital circuits by effectively utilizing a range of electronic components, including
logic gates, flip-flops, multiplexers, and decoders.
CO3: Cultivate skills in designing and analyzing combinational and sequential circuits, as well as gain
proficiency in working with various Programmable Logic Devices (PLDs).
PO/
PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO
CO1 3 3 3
CO2 3 3 3 2
CO3 3 3 3 3
Mapping
Target Level
Page 2 of 14
Course Outcome 1 (CO1): Understand digital logic gates, Boolean algebra, and the fundamental
principles of digital circuits, analyze and design basic digital circuits utilizing logic gates.
Program Outcome 1 (PO1): Demonstrate a strong foundation in the principles and theories of
electrical and electronic engineering.
Program Outcome 2 (PO2): Apply mathematical and scientific principles to analyze and solve
engineering problems.
Course Outcome 2 (CO2): Implement digital circuits by effectively utilizing a range of electronic
components, including logic gates, flip-flops, multiplexers, and decoders.
Program Outcome 3 (PO3): Demonstrate proficiency in using modern tools and equipment to design,
simulate, and implement electronic systems.
Program Outcome 4 (PO4): Develop the ability to work effectively in teams and communicate
engineering concepts clearly.
Course Outcome 3 (CO3): Cultivate skills in designing and analyzing combinational and sequential
circuits, as well as gain proficiency in working with various Programmable Logic Devices (PLDs).
Program Outcome 5 (PO5): Demonstrate the ability to design and analyze complex electronic systems
using appropriate methodologies and tools.
Program Outcome 6 (PO6): Exhibit an understanding of ethical and professional responsibilities in the
field of electrical and electronic engineering.
5.DETAILED SYLLABUS
UNIT I (Contact hours: 7)
Number systems and Logic Gates
Review on number systems, digital logic gates: AND, OR, NOT, NAND, NOR, Ex-OR and Exclusive
- NOR, Realization of gates using Universal Gates, Implementations of Logic Functions using basic
gates, NAND –NOR implementation.
UNIT II (Contact hours: 8)
Boolean postulates and laws –De-Morgan’s Theorem- Boolean function- Minimization of Boolean
expressions – Sum of Products (SOP) –Product of Sums (POS)-Canonical forms – Karnaugh map
Minimization – Don’t care conditions – Quine Mc’Clusky method of minimization, simplification
rules.
UNIT III (Contact hours:8)
Page 3 of 14
UNIT IV (Contact hours:8)
Sequential Circuits
Flip-Flops, and latches - SR Flip flop, JK Flip flop, T Flip flop, D Flip flop and Master slave Flip flops
– Excitation table - Realization of one flip flop using other flip flops.
Counters (Asynchronous and Synchronous counters: Modulo-n counter – Shift Register- Universal
Shift Register, Applications of Shift Register: Ring counter, Johnson counter.
Finite state machine-capabilities and limitations, Mealy and Moore models-minimization of
completely specified and incompletely specified sequential machines, Introduction to ASM.
UNIT V (Contact hours: 5)
Programmable Logic Devices
Basic PLD’s –ROM, PROM, PLA, PAL. Realization of switching function using PLD’s –
Introduction to FPGA, CPLD.
TEXT BOOKS
REFERENCES
1. Digital Design: Principles and Practices,,Wakerly,4th edition, Pearson Education
2. Fundamentals of Logic Design, C. H. Roth, L. L. Kinney, 7th edition, Cengage Learning.
7.TEXTBOOKS/LEARNING RESOURCES:
1. Digital Design, M. Morris Mano, M.D.Ciletti, , Pearson Pearson Education; Sixth edition
2. Digital Logic and Computer Design by M. Morris Mano, Pearson Pearson Education; Fifth edition
Page 4 of 14
8.REFERENCE BOOKS/LEARNING RESOURCES:
2. edX: edX provides courses like "Digital Electronics" by Purdue University and "Introduction to
Electronics" by Massachusetts Institute of Technology (MIT).
3. Udemy: Udemy offers a wide range of digital electronics courses, including "Digital Electronics:
Introduction to Digital Electronics" and "Digital Electronics: Combinational Logic Circuits."
4. NPTEL: NPTEL (National Programme on Technology Enhanced Learning) offers digital electronics
courses in collaboration with various Indian Institutes of Technology (IITs), such as "Digital
Electronics" by IIT Madras.
Page 5 of 14
Conversion steps (10 minutes)
Sample circuit and its conversion (30 minutes)
Realization of simple circuit using universal gates(10 minutes)
Realization of OR logic using NAND
Conversion steps (10 minutes)
Sample circuit and its conversion
Basic circuit (5 minutes)
5
Conversion (10 minutes)
Truth table( 10 minutes)
Realization of simple circuit using universal gates(10 minutes)
Comparison of basic with converted circuit (5 minutes)
Realization of OR logic using NOR
Conversion steps (10 minutes)
Sample circuit and its conversion
Basic circuit (5 minutes)
6
Conversion (10 minutes)
Truth table( 10 minutes)
Realization of simple circuit using universal gates(10 minutes)
Comparison of basic with converted circuit (5 minutes)
Concept to circuit conversion and its realization
Conversion steps (10 minutes)
Sample circuit and its conversion
Basic circuit (5 minutes)
7
Conversion (10 minutes)
Truth table( 10 minutes)
Realization of simple circuit using universal gates(10 minutes)
Comparison of basic with converted circuit (5 minutes)
8 Buffer Lecture - Unit 1
Introduction to Boolean Algebra
Boolean Postulates ( 25 minutes)
basic postulates( 10 minutes)
postulates necessary for minimization ( 10 minutes)
9 simple example (5 minutes)
Boolean laws
basic laws( 10 minutes)
laws necessary for minimization ( 10 minutes)
simple example (5 minutes)
De-Morgan's Theorem and its realization
Theorem and Boolean expression (10 minutes)
10
Theorem and its proof (10 minutes)
Boolean Functions (30 minutes)
Minimization of Boolean Expressions (20 minutes)
11
2 level literals based minimization (30 minutes) contd….
12 Minimization of Boolean Expressions (20 minutes)
Page 6 of 14
higher level literals and its minimization(30 minutes)
Sum of Products (SOP) (12 minutes) ,
13 Product of Sums (POS) (12 minutes)
Realization using truthtable (26 minutes)
2 variable Karnaugh Map Minimization (15 minutes)
14 3 variable Karnaugh Map Minimization (25 minutes)
Don't Care Conditions (10 minutes)
15 Quine McCluskey Method of Minimization (50 minutes) contd…
16 Quine McCluskey Method of Minimization (50 minutes)
17 Buffer Lecture – unit 2
Design procedure for Adders and Subtractors (20 minutes)
18 Design of half adder and full adder (15 minutes)
Design of half subtractor and full subtractor (15 minutes)
Serial Adder/Subtractor
Logic explanation (5 minutes)
Realization (10 minutes)
Parallel Adder/Subtractor
19 Logic explanation (5 minutes)
Realization (10 minutes)
Carry Look Ahead Adder
Logic diagram (10 minutes)
Logical realization (10 minutes)
BCD Adder
Logic diagram (10 minutes)
Logical realization (10 minutes)
Magnitude Comparator
20
Truth Table (5 minutes)
Kmap formation (10 minutes)
boolean expression realization (5 minutes)
Logic realization (10 minutes)
Multiplexer/Demultiplexer
21 Logic diagram (10 minutes)
Logical realization (10 minutes)
Encoder/Decoder (30 minutes)
Truth Table (5 minutes)
22 Kmap formation (10 minutes)
boolean expression realization (5 minutes)
Logic realization (10 minutes)
Parity Checker
Logic diagram (10 minutes)
Truth Table (10 minutes)
23
Kmap formation (10 minutes)
boolean expression realization (10minutes)
Logic realization (10 minutes)
Page 7 of 14
Code Converters: Binary to Gray (35 minutes)
Logic diagram (10 minutes)
Truth Table (10 minutes)
24
Kmap formation (10 minutes)
boolean expression realization (10minutes)
Logic realization (10 minutes)
Gray to Binary, BCD to Excess 3 Code
Logic diagram (10 minutes)
Truth Table (10 minutes)
25
Kmap formation (10 minutes)
boolean expression realization (10minutes)
Logic realization (10 minutes)
26 Buffer Lecture – Unit 3
Introduction to sequential logic and the need for memory elements
Definition (2minutes)
About the need of memory elements ( 3 minutes)
Basic concept of a latch and its operation (5 minutes)
27 Introduction to flip-flops and their characteristics
Types of flip-flop (10 minutes)
Truth table of all flip flops (10 minutes)
Characteristic table(10 minutes)
Excitation table(10 minutes)
Implementing flip-flops using NAND and NOR gates
Truth table of SR flip flops (5minutes)
Characteristic table(10 minutes)
28 Excitation table(10 minutes)
Truth table of JK flip flops (5 minutes)
Characteristic table(10 minutes)
Excitation table(10 minutes)
Truth table of D flip flops (5 minutes)
Characteristic table(10 minutes)
Excitation table(10 minutes)
29
Truth table of T flip flops (5 minutes)
Characteristic table(10 minutes)
Excitation table(10 minutes)
Realization of flip-flops
procedure to convert one flip to another (10 minutes)
truth table , excitation table identification( 10 minutes)
30
conversion table formation and realization (10 minutes)
Kmap formation (10 minutes)
logic diagram formation (20 minutes)
31 Introduction to counters and their applications (5 minutes)
Asynchronous counters: definition, operation, and timing analysis(5 minutes)
Synchronous counters: definition, operation, and timing analysis(5 minutes)
Modulo-n counters and their significance
Page 8 of 14
State Diagram ( 5 minutes)
State Table (10 minutes)
Kmap formation (10 minutes)
Design based on derived boolean expression (10)
Introduction to shift registers and their applications (5 minutes)
Shift register types:
serial-in-serial-out (SISO) (5 minutes)
serial-in-parallel-out (SIPO) (5 minutes)
parallel-in-serial-out (PISO) (5 minutes)
32
parallel-in-parallel-out (PIPO) (5 minutes)
Universal Shift Register:
Definition (5 minutes)
Operation (15 minutes)
Applications (5 minutes)
Ring Counter:
Definition(5 minutes)
Operation (10 minutes)
Applications (5 minutes)
Johnson Counter: definition, operation, and applications
Definition(5 minutes)
Operation (10 minutes)
Applications (5 minutes)
33
Mealy model
State Diagram ( 5 minutes)
State Table (10 minutes)
Kmap formation (10 minutes)
Moore models
State Diagram ( 5 minutes)
State Table (10 minutes)
Kmap formation (10 minutes)
Introduction of FSM (10 minutes)
FSM formation (10 minutes)
34 Realization of FSM using simple logic (10 minutes)
merger graph – conceptual realization (10 minutes)
Applications of FSM (10 minutes)
35 Buffer Lecture – Unit IV
Basic PLD’s –
ROM (5 minutes)
PROM (10 minutes)
PLA (10 minutes)
36
PAL. (10 minutes)
Realization of switching function using PROM
Programming Table (10 minutes)
realization (5 minutes)
37 Realization of switching function using PLA
Page 9 of 14
Programming Table (10 minutes)
Logic diagram (10 minutes)
minterm segregation (10 minutes)
combinational circuit programming
Programming Table (10 minutes)
minterm segregation (5 minutes)
Logic diagram (5 minutes)
Real time example programming using PLA
Programming Table (10 minutes)
minterm segregation (5 minutes)
Logic diagram (5 minutes)
38
Idea pitching using PLA
Programming Table (10 minutes)
minterm segregation (5 minutes)
Logic diagram (5 minutes)
Realization of switching function using PAL
Programming Table (10 minutes)
Logic diagram (10 minutes)
minterm segregation (10 minutes)
39
combinational circuit programming
Programming Table (10 minutes)
minterm segregation (5 minutes)
Logic diagram (5 minutes)
Real time example programming using PAL
Programming Table (10 minutes)
minterm segregation (5 minutes)
Logic diagram (5 minutes)
40
Idea pitching using PLA
Programming Table (10 minutes)
minterm segregation (5 minutes)
Logic diagram (5 minutes)
41 Buffer Lecture -Unit V
42 Buffer Lecture
1
Realization of Logic gates
Tinker cad introduction (20 minutes)
IC numbers and Internal Logic (20 minutes)
Logic gates programming and truth table verification ( 60 minutes)
Assessment (10 minutes)
2
Minimization of Boolean functions and realization using logic gates
Page 10 of 14
Theoretical approach
Truth table formation (10 minutes)
Kmap formation (10 minutes)
logic diagram (10 minutes)
Logic gates programming and truth table verification ( 70 minutes)
Assessment (10 minutes)
3
Realization of logic gates using universal gates
Theoretical approach
Truth table formation (10 minutes)
Kmap formation (10 minutes)
logic diagram (10 minutes)
Logic gates programming and truth table verification ( 70 minutes)
Assessment (10 minutes)
4
Design of Half adder, Full adder, Half subtractor and Full subtractor
Theoretical approach
Truth table formation (10 minutes)
Kmap formation (10 minutes)
logic diagram (10 minutes)
Logic gates programming and truth table verification ( 70 minutes)
Assessment (10 minutes)
5
Design of Multiplexer, Demultiplexer
Theoretical approach
Truth table formation (10 minutes)
Kmap formation (10 minutes)
logic diagram (10 minutes)
Logic gates programming and truth table verification ( 70 minutes)
Assessment (10 minutes)
6
Buffer Lab – Cycle I
7
Design of Comparators
Theoretical approach
Truth table formation (10 minutes)
Kmap formation (10 minutes)
logic diagram (10 minutes)
Logic gates programming and truth table verification ( 70 minutes)
Assessment (10 minutes)
Page 11 of 14
8
Design of Encoder, Decoder
Theoretical approach
Truth table formation (10 minutes)
Kmap formation (10 minutes)
logic diagram (10 minutes)
Logic gates programming and truth table verification ( 70 minutes)
Assessment (10 minutes)
9
Design of Code converters
Theoretical approach
Truth table formation (10 minutes)
Kmap formation (10 minutes)
logic diagram (10 minutes)
Logic gates programming and truth table verification ( 70 minutes)
Assessment (10 minutes)
10
Conversion of one flip to another flip and its realization.
Theoretical approach
Truth table formation (10 minutes)
Kmap formation (10 minutes)
logic diagram (10 minutes)
Logic gates programming and truth table verification ( 70 minutes)
Assessment (10 minutes)
11
Design of 2-bit counters
Theoretical approach
Truth table formation (10 minutes)
Kmap formation (10 minutes)
logic diagram (10 minutes)
Logic gates programming and truth table verification ( 70 minutes)
Assessment (10 minutes)
12
Design of Up- Down Counter
Theoretical approach
Truth table formation (10 minutes)
Kmap formation (10 minutes)
logic diagram (10 minutes)
Logic gates programming and truth table verification ( 70 minutes)
Assessment (10 minutes)
Page 12 of 14
13
Design of shift registers
Theoretical approach
Truth table formation (10 minutes)
Kmap formation (10 minutes)
logic diagram (10 minutes)
Logic gates programming and truth table verification ( 70 minutes)
Assessment (10 minutes)
14 Buffer Lab – Cycle II
12.Evaluation Components
14.Proposed Industry Talks: Invited Talk on Digital Electronics and its applications by Mr.Ranjith
Kannan , Senior Manager , Analog Devices inc., Banglore
16.Certification Mapping:
1. Certified Electronics Technician (CET)
2. Certified Digital Systems Technician (CDST)
3. NI Certified LabVIEW Associate Developer (CLAD)
4. Online Course Certifications Coursera, Udemy, and edX offer online courses related to digital
electronics.
18.Hardware/Devices Used: NA
Page 13 of 14
19.Proposed Case Studies:
1. Smart home automation
2. Smart agriculture solution
3. Robotics for assisted life
4. Digital electronics for education
21.Attendance Policy
1. At least 75% attendance in the course is mandatory
2. A maximum of 5% shall be allowed under medical grounds and 5% on representing the
University on official events outside like sports, hackathons, NCC, NSS etc.
3. Students with less than 65% of attendance shall be prevented from writing the final assessment.
Page 14 of 14