Updated DLD - Course Outline

You might also like

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 8

Faculty of Computing Digital Logic Design Riphah International University

Course Description

Course Code CS1144


Course Title Digital Logic Design
Credit Hours 04
Prerequisites Applied Physics
 Quizzes (4) 20%
 Assignments (4) 15%
 Lab-Work 20%
Assessment Instruments with  Midterm 20%
Weights (homework, quizzes,  Final Exam 25%
midterms, final, programming
assignments, lab work, etc.) *Tentative distribution and it can be changed

Mr. Shahbaz Hassan


Course Coordinator

URL (if any) moellim.riphah.edu.pk


This course is an introduction to the basic principles
and concepts of a digital system in particular digital
computers. It starts with a discussion of combinational
logic: logic gates, minimization techniques, arithmetic
circuits, and modern logic devices such as field
programmable logic gates. The second part of the
course deals with sequential circuits: flip-flops,
Course Description synthesis of sequential circuits, and case studies,
including counters, registers, and random access
memories. State machines will then be discussed and
illustrated through case studies of more complex
systems using programmable logic devices. Different
representations including truth table, logic gate, timing
diagram, switch representation, and state diagram will
be discussed
1. Digital fundamentals by Floyd. 9th Edition (Text
Book)
Textbook 2. Digital Design by Morris Mano. 3rd Edition
3. Fundamentals of Logic Design by Charles H.
Roth,Jr.
Reference Material Lecture handouts
Goal:
Course Goals/Objectives Students should be able to understand the theoretical
and practical aspects of digital logic design, and apply

1
Digital logic design methodologies and tools in real
projects.

Laboratory Projects/Experiments Lab Task : 10


Done in the Course Project : 1
Programming Assignments Done in NA
the Course
Problem Solution Social and Ethical
Theory
Class Time Spent in (in credit hours) Analysis Design Issues
0.75 0.75 1.25 0.25
Every student is required to make one oral
Oral and Written Communication
presentations/demonstration of typically 20 min.
Code Bloom’s Taxonomy Course Course
And Course Learning Teaching Assessment Weightage
# Outcomes Strategies Methods
1.0 Understand

Explain the basic concepts of Quiz,


1.1 digital systems, computer Lectures Assignment, 25%
arithmetic, and Boolean algebra. Mid-Term

2.0 Apply

Implement the simplification Lectures Quizzes


techniques (K- map and Boolean Labs Lab Task
rules) for combinational and Class activity Assignments
2.1 sequential circuits. Midterm &Final 20%

2.2 Implement the combinational Lectures Quizzes


logic circuits using logic- gates Labs Lab Task
Class activity Assignments 20%
Midterm &Final

2.3 Implement the sequential circuits Lectures Quizzes 20%


using logic gates Labs Lab Task
Class activity Assignments
Midterm &Final

3.0 Create

Design an intermediate level Lectures


complex circuits within given Labs Lab Task
3.1 15%
hardware constraints Project
Topics Covered in the Course, with Number of Lectures on Each Topic

Topics Hours

Digital and analog quantities, Binary Digits, Logic Levels & waveforms,
Basic logic operations, overview of basic logic functions and fixed function
integrated circuits. Decimal Numbers, Binary Numbers, Decimal to Binary 6
Conversion.

Binary Arithmetic Operations, 1’s & 2’s Complements of Binary Numbers


and Signed Numbers, Arithmetic operations with signed number 3

Hexadecimal numbers, Octal Numbers and Binary Coded Decimal (BCD) 3


Digital codes and Error Detection, Correction Codes, Inverter, Binary Gates
(AND, OR, NAND, NOR, X-OR & X-NOR) and fixed function logic, 4
Boolean operation and expressions
Laws and rules of Boolean algebra, DeMorgan’s Law, Boolean analysis of
logic circuits, Simplification using Boolean algebra, Standard form of 4
Boolean expressions, Boolean Expression and truth table
The Karnaugh Map (K-MAP), K-Map SOP Minimization, K-Map POS
4
Minimization, five variable K-Map.
Combinational logic Analysis, Combinational logic Circuit (AND-OR,AND-
OR invert logic, XOR-Logic, XNOR-Logic, Universal Gate Implementation) 6

Combinational Logic (Adder, Parallel Binary Adder, Decoder, Encoder,


6
Multiplexer, De-Multiplexer ,Code Convertor)
Sequential Logic (Latches, Edge-Triggered Flip-Flops, Flip-Flop Operating
Characteristics, Flip-Flop Applications, JK Flip-Flop, D-Flip Flop 6

Asynchronous Counter Operation, Synchronous Counter Operation,


6
Up/Down Synchronous Counters, Design of Synchronous Counters
Weekly Lecture Plan

Week Lecture Topic CLO


1 Introduction to course
Digital and analog quantities
1
2 Binary Digits, Logic Levels & waveforms
Basic logic operations

overview of basic logic functions 1.1


2 3
Fixed function integrated circuits
Decimal Numbers Conversions
Binary Numbers
4
Decimal to Binary Conversion.
Quiz – 1
Binary Arithmetic Operations
5
1’s & 2’s Complements of Binary Numbers
3
Signed Numbers
6
Arithmetic operations with signed number 1.1
Hexadecimal numbers
7
Octal Numbers
4
Binary Coded Decimal (BCD)
8
Assignment – 1
Digital codes
1.1
9 Error Detection
Correction Codes
5
1.1
Inverter
10
Binary Gates (AND, OR, NAND)NOR, X-OR & X-NOR) 3.1
1.1
Binary Gates (NOR, X-OR & X-NOR) 3.1
11
Fixed function logic
6

1.1
Boolean operation and expressions.
12 2.1
Quiz – 2

1.1
Laws and rules of Boolean algebra
13 2.1
DeMorgan’s Law

7
1.1
Boolean analysis of logic circuits
14 2.1
Simplification using Boolean algebra
3.1
1.1
15 Standard form of Boolean expressions 2.1

8 1.1
Boolean Expression and truth table 2.1
16
Assignment – 2 3.1

1.1
17 The Karnaugh Map (K-MAP) 2.1
3.1
9
1.1
18 K-Map SOP Minimization 2.1
3.1

10 19 K-Map POS Minimization 1.1


2.1
3.1
1.1
Five variable K-Map
20 2.1
Quiz – 3
3.1
1.1
21 Combinational logic Analysis 2.2

11

Combinational logic Circuit (AND-OR, AND-OR invert 1.1


22
logic) 2.2
3.1
1.1
23 Combinational logic Circuit (XOR-Logic, XNOR-Logic) 2.2
3.1
12 1.1
Combinational logic Circuit (Universal Gate
2.2
24 Implementation)
3.1
Assignment – 3

1.1
25 Combinational Logic (Adder, Parallel Binary Adder) 2.2

13 3.1

1.1
26 Combinational Logic (Decoder, Encoder)
2.2
3.1
1.1
27 Combinational Logic (Multiplexer, De-Multiplexer) 2.2
14
3.1
28 Combinational Logic (Code Convertor) 1.1
Quiz – 4
2.2
3.1

1.1
Sequential Logic (Latches, Edge-Triggered Flip-Flops,
29 Flip-Flop Operating Characteristics, Flip-Flop 2.3
Applications, JK Flip-Flop, D-Flip Flop)
3.1
15
1.1
Asynchronous Counter Operation,
30 2.3
Synchronous Counter Operation
3.1

31 Design of Synchronous Counters 2.3


3.1
16

32 Assignment – 4 2.3
3.1

You might also like