BCA_3rd Sem_23OBC303_Digital Logic Design
BCA_3rd Sem_23OBC303_Digital Logic Design
BCA_3rd Sem_23OBC303_Digital Logic Design
1. Course Summary
By the end of this Logic Design course, students will have acquired the knowledge and skills
needed to design, analyze, and simplify digital logic circuits. They will understand the core
principles of Boolean algebra, have proficiency in using Karnaugh maps for logic simplification,
and be capable of creating both combinational and sequential logic designs. This knowledge
forms the foundation for understanding the inner workings of digital systems and is invaluable
for computer applications and hardware design.
After the successful completion of this course, the student will be able to:
CO-1. Describe the principles of data and number representation, including binary
numbers and conversions. [L-1]
CO-2. Apply the concepts of complements and binary arithmetic to perform binary
addition and subtraction. [L-3]
CO-3. Apply Boolean algebra laws, including De Morgan's theorem, for the simplification
of complex logic expressions. [L-3]
CO-4. Analyze and interpret the behavior of basic logic gates, their symbolic
representations, and truth table. [L-4]
CO-5. Design and analyze logic circuits for various applications [L-4]
3. Course Contents
Sr. Number
Units
No of Hours
1 UNIT- I 10
Introduction to Digital Logic-
Data and Number Representation:
Binary Numbers: Understanding binary number systems and their
significance in digital logic.
Number Base Conversion: Techniques for converting numbers
between different bases (e.g., binary to decimal).
Complements: Concepts of 1's complement and 2's complement, and
their use in binary arithmetic.
Binary Codes: Study of BCD (Binary-Coded Decimal), Grey code, and
UNIT- II
Boolean Algebra and Logic Simplification-
Boolean Algebra:
Laws and Identities: Understanding fundamental laws (commutative,
associative, distributive) and identities of Boolean algebra.
De Morgan’s Theorem: Applying De Morgan’s laws to simplify Boolean
expressions.
2 Simplification of Logic Expressions 10
Karnaugh Maps:
Karnaugh Map for 2, 3, 4 Variables: Using K-maps to visualize and
simplify Boolean expressions.
Simplification of SOP and POS Logic Expressions using K-Map:
Techniques for finding the simplest Sum of Products (SOP) and Product
of Sums (POS) forms.
UNIT- III
Combinational Circuits and Their Applications-
Adders and Subtractors: Designing and analysing half adders, full
adders, and subtractors.
Code Converters: Circuits that convert data from one code to another
(e.g., BCD to binary).
3 Multiplexers and Demultiplexers: Design and use of multiplexers 10
(MUX) and demultiplexers (DEMUX) in data selection and routing.
(2:1,4:1)
Encoders and Decoders: Function and design of encoders and
decoders for data encoding and decoding applications.
4 UNIT- IV 10
Sequential Circuits and Their Applications-
Flip-Flops and Latches: S-R, J-K, D, T and Master slave, characteristic
Tables and equations
Registers: Types of registers (shift registers, parallel registers), and
their applications in data storage and transfer.
Counters: Designing and analysing different types of counters
UNIT- V
Memory Circuits and Programmable Logic Devices-
Memory Circuits:
RAM (Random Access Memory): Understanding types, operation, and
5 applications of RAM. 8
ROM (Read-Only Memory): Study of ROM types, characteristics, and
uses in digital systems.
Programmable Logic Devices:
Programmable Logic Array (PLA): Design and application of PLAs in
implementing combinational logic.
3. Course Resources
a. Essential Reading
1. Course Self-Learning Material
2. Morris Mano: Digital Logic and Computer Design, 4th Edition, Pearson
Education, 2014
b. Recommended Reading
1. Charles H. Roth Jr and Larry L Kinney Jr: Fundamentals of Logic Design, 7th
Edition, Cengage Learning, 2014.
2. Saha and N. Manna, Digital Principles and Logic Design, INFINITY SCIENCE
PRESS LLC,2007