CSC23C201: Digital Logic
Paper Code: CSC23C201
Paper Title: Digital Logic
No. of Credits: 4 (L+T+P=3+1+0)
Paper Nomenclature: Major (Core -2)
Level: 100
Course Objectives: This course will teach the basic understanding of Digital Logic Design and its
application for digital computers. The course focuses on understanding the Introduction to organization
of digital computers, Concept of Memory, Boolean algebra & its Simplification of Boolean Functions,
and Combinational Logic and Sequential Logic.
Course Outcomes: On successful completion of the course, students will be able to:
1. Explain the concept of organization of digital computers with its different hardware components
such as Input Unit, Output Unit, Storage Unit, CPU. Control Unit, Arithmetic Logic Unit.
2. Solve problems on different number systems, binary arithmetic operation, floating point number
and signed magnitude number representation, overflow, underflow, and different computer error
detection and correction codes.
3. Have thorough idea on memory Hierarchy, and different types of memory, hit and miss
4. Solve problems on Boolean algebra and simplification of Boolean Functions
5. Design different digital Combinational and Sequential Logic circuitry.
Detailed Contents:
Unit Contents No. of
Lectures
I Introduction to organization of digital computer: Block diagram of a computer: 12
Input Unit, Output Unit, Storage Unit, CPU. Control Unit, Arithmetic Logic Unit,
System bus, Stored program concept, Number systems: Binary Arithmetic,
Floating point number representation, Fixed point number representation, Signed-
magnitude representation, overflow, underflow, Computer codes: Error detection
and correction codes, parity, parity generator, parity checker.
II Memory Unit: Memory Hierarchy, Main Memory, Memory Address Map. 12
Semiconductor Memory, Different types of semiconductor memory; Different
types of Cache Memory: Levels of Cache, Locality of reference, hit, miss, hit
ratio, Magnetic Memory; Different types Optical Memory, Different types of
magnetic memory.
III Boolean Algebra and Simplification of Boolean Functions: Boolean Algebra: 12
Various Boolean operations; Postulates, Theorems, Duality, Boolean functions,
Canonical forms, Representation of Boolean expressions using truth tables, logic
gates. Boolean expressions, Karnaugh map, Don’t Care Conditions- problems
using Don’t care conditions, benefit of using Don’t care conditions. Tabulation
method/Quine- McCluskey method, prime implicants.
IV Combinational Logic and Sequential Logic: Combinational circuits: Brief 12
introduction integrated circuits, Positive and negative logic. Digital devices:
Different Logic gates, Boolean function implementation using logic gates,
deviation of Boolean function, truth table, block diagram transformation. Half-
adder, Full-adder, Binary Adder, Half-subtractor, Half-subtractor, magnitude
comparator.; Encoders, Decoders, Multiplexers, Demultiplexers, Code
conversion, BCD-to-Excess 3 Code converter.
Sequential circuits: Flip-flops: Different types of flip-flops, Flip-flop excitation
tables, characteristic equations, truth tables, Triggering of Flip-flops. Registers,
Counters. Introduction to Field Programmable Gate Arrays (FPGA)
Practical: An indicative list of experiments are given below: 16
● Verification of Truth Tables for Basic and Universal Gates using ICs.
● Implementation of NAND and NOR gates using basic gates.
● Implement different Boolean Functions using basic gates.
● Implement different combinational circuits (such as Adder, Subtractor,
Encoder, Decoder etc.)
● Implement different sequential circuits (such as RS flip-flop/JK flip-
flop/register/counter etc.)
Suggested Readings:
Text Books:
1. M. M. Mano, Digital Logic and Computer Design, New Delhi: Pearson Education, 14th
Impression, 2022.
2. T. L. Floyd, Digital Fundamentals (11th Edition), New Delhi: Pearson Education, 2017.
Reference Books:
1. S. Salivahanan, Digital Circuits and Design (4th Edition), New Delhi, Vikas Publication, 2012.