DSD Syllabus
DSD Syllabus
NAAC
Department of First-Year Engineering
Bachelor of Engineering
Course Course Name Credits Assigned
Code Teaching Scheme
(Hrs.) Total
Practical Tutorial
FEL203 Theory Practical Tutorial Theory 01
Digital System 02 01
Design Lab
Pre-requisite:
1. Knowledge of Basic Electrical &Electronics Engineering (FEC103).
Lab Objectives:
1. To verify the truth table of various logic gates using ICs.
2. To simplify Boolean algebraic expressions using Boolean laws.
3. To realize logic gates using universal gates.
4. Toimplement digitalcircuits for various arithmetic operations, logical functions, and code con
versions.
5. To design and simulate combinational logic circuits.
6. To design and simulate sequential logic circuits.
Lab Outcomes:
After successful completion of the course, students will be able to:
1. Verify truth tables for various logic gates using ICs.
universal logic gates.
2. Realize logic expressions using basic anduniversal
using gates.
3. Construct and validate logic gates logical func
4. Design and implement digital circuits for performing various arithmetic operations,
tions, and code conversions.
5. Design and simulate combinational logic circuits using appropriate tools and techniques.
effectively.
Design and simulate sequential logic circuits
64
Cadoates
chonto SIES Graduate School of Technology (AutonomoUs)
Thnolog (A
FYchn
SIPTH LDUCATIoN
MACA4
Departnment of First-Ycar Engincering
Bachelor of Enginecring
Course Name Credits Assigned
Course Teaching Scheme
Code (Hrs.)
Tutorial Total
Theory Practical Tutorial Theory Practical
03
FEC204 Digital System 03 03
Design
Course Objectives:
1. To understand number system representations and their inter-conversions utilized in digital electronic
circuits.
2. To understand Boolean algebra, its simplification techniques, and the design of logic circuits using
basic and universal gates.
combinational logic
3. To evaluate digital logic processes and implement logical operations using
circuits.
4. To analyze, design and implement logical operations using sequential logic circuits.
practical sequential circuits.
5. To apply Moore and Mealy state machine concepts and designdevices.
6. To understand memory types andprogrammable logic
Course Outcomes:
able to:
After successful completion of the course, students will be arithmetic and coding
1. Explain digital systems, perform umber system conversions, and apply binary
techniques. various logic gates, including NAND
2. Simplify Boolean expressions and design logic circuits using
and NOR.
combinational logic circuits.
3. Analyze Boolean expressions and design counters, shift registers, and sequential logic circuits.
4. Design and implement various flip-flops, and design functional sequential circuits.
5. Differentiate between state machine types logic devices.
6. Distinguish memories and programmable
Topics Hrs.
Module Unit
No. No. 06
1.0 Introduction to Digital Systems
Introduction: Overview of Digital Systems, Importance in modern
1.1 analog and digital
technology, Analog vs. Digital Systems, Examples of
systemns. Decimal, Hexadecimal
1,2 Fundamental Concepts and Logic: Binary, Octal, Arithmetic operations.
Number Systems, their inter-conversion, Binary
ASCII.
Codes: Grey, BCD, Excess-3, 05
Boolean Algebra
2.0 Logic Gates and Gates (AND, OR, NOT NAND
2.1 Logic Gates: Basic Logic and UniversalNAND and NOR pates
using
NOR, XOR, XNOR), Realization
Boolean Algebra: Boolean Algebra Rules and Simplification Techniaues
2.2
De Morgan's Theorem.
54
School of Technology (Autonomous)
SIES Graduate Engineering
Department of First-Year
Crsdeate Schonl
Tchnolegt
Bachelor of Engineering
TESI1EDECATIO 10
A
bit). Conversion of
Sequential Logic T&Dflip flops,
4.0 Master-slave flip flops,
4.1 Flip flops: SR, JK, counters with
flip flops. Asynchronous and Synchronous
Introduction to Shift
4.2 Counters and Registers:Up/Down, BCD Counter,
diagram,
State transition 04
Registers. circuits, Clocked
Seguential Logic Design
Moore and Mealy
5.0 Introduction: Introduction
to techniques (inspection,
5.1 State reduction
analysis,
synchronous state machine method) and state
assignment.
implication chart detector, Clocked
partition and Sequential circuit: Sequence
5.2 Application of design. Programmable Logic Devices
04