Department of Computer Science

National University of Computer and Emerging Sciences

Lahore Campus

Course Outline Digital Logic Design EE227

Spring 2021

Instructor Name: Sobia Tariq Javed

Email address: [email protected]
Program: BS
Credit Hours: 3+1
Type: Core
Course Group:
Class Code: nszlo6a (section A)
TA: Maryam Ahmad
Office Hours: Tuesday and Thursday 11:00am to 12:00 pm
Course Description/Objectives/Goals:
This course introduces the fundamentals of digital computers. It covers the design and
analysis techniques for digital circuits – combinational as well as sequential.

Course Learning Outcomes (CLOs):

At the end of the course students will be able to:
Understand different Number systems & Boolean Algebra
Design combinational and sequential circuits
Understand the internal working of different components of a digital computer
Design moderately complex sequential digital circuits
Be able to undertake Computer Architecture course in future

Textbook Name: M. Morris Mano & Charles R. Kime, Logic and Computer Design
Fundamentals Edition: (5th Edition Updated, Prentice Hall)

Additional Reference Material Used (if any):

1. John F. Wakerly, Digital Design: Principles and Practices (3rd Edition,
Pearson Education, 2001)
2. Thomas L. Floyd, Digital Fundamentals (7th Edition, Prentice Hall, 2000)

Percentage Grade Distribution:

QUIZZES 15%
MIDTERMS 30%
FINAL 40%
ASSIGNMENTS + PROJECT 15%
Lec.No. Course Contents Covered
 1. Information Representation, Digital Computer
1 2. Number Systems (Binary, Octal, Hex) and Conversions
3. Data Ranges, Conventions (KB, MB, GB)
1. BCD
2. ASCII Code
2 3. Parity Bit
4. Arithmetic Operations (Addition, Subtraction using borrow method,
Multiplication)
1. Signed Unsiged Binary Numbers
2. Signed Magnitude Representation
3 3. 2’s Complement Representation
4. 1’s Complement
5. Subtraction using 2’s Complement
1. Logic Gates
2. Timing Diagram
3. Gate Delay
4. Boolean Equation, Logic Circuit, Truth Table
4
5. Boolean Identities and Laws (Commutative etc.)
6. Dual and Duality Principle
7. Proof of Distributive Law and Consensus Theorem
8. Complementing Function using DE Morgan’s Law and Dual
1. Boolean Functions and their implementation
 Definition of Combinational logic circuit.
 Examples of making truth table and circuit diagram from Boolean
equation.
2. Dual of a function
5
3. Complement of a function
4. Dual vs complement
5. Practice of questions reducing to particular number of literals.
6. Implementing functions with only OR and NOT gates.
7. Implementing functions with only AND and NOT gates.
1. Canonical and Standard Forms (Minterms, Maxterms, Conversions)
 How to write minterms/maxterms from truth table
 Writing a function in terms of its minterms/maxterms
6
 Properties of minterms /maxterms.
2. Literal cost
3. Gate input cost
1. Minimization of Boolean functions using K-Map
 How to build table and why there should be a difference of 1
7 between 2 cells?
 2 variables
 3 variables
8 1. Minimization of Boolean functions using K-Map
2. Implicants, prime implicants, essential prime implicants, Non
essential Prime implicants (just introduction)
3. 4 variables
 4. 5 variables (just table)
5. Don't Care States
9 Universal gates, XOR, XNOR, Parity Generators/ Checkers
1. Implementation of Boolean functions using universal gates
2. Combinational circuits
3. Design Procedure
 a circuit that accepts 3-bit number and generates a 6 bit binary
10 number equal to square of the given number
 Code convertors
 2 bit multiplier
 BCD numbers
 BCD to 7 segment display
11 Mid I
1. Decoders + Examples
 1-to -2 line decoder
 2-to -4 line decoder
 3-to -8 line decoder
12 2. Decoders with enable input
3. Encoders
4. Priority encoder
 BCD to decimal example.
5. Decoders and combinational circuits
 Forming larger size decoder from smaller one (3-to-8 line decoder
13
from 1-to -2 line decoders and 2-to -4 line decoders)
14 1. Multiplexers + Examples
 2x1 Mux
 4x1 Mux
 8x1 Mux
2. Dual and Quad MUX
3. Forming functions using decoders and multiplexer.
4. Demultiplexer + Examples
15 1. Forming larger size MUX from smaller one
16 1. Binary Adders
 Half Adder
 Full Adders
 Binary Ripple Carry Adder
 Binary Multipliers
17 1. 1’s and 2’s Complements
2. Binary Adder/Subtractor
3. BCD Adder
4. 2-bit magnitude comparator
18 1. Introduction to Sequential Circuits
2. Introduction to Latches
 SR Latch
 S’R’ Latch
 SR Latch with a control
  Timing Diagram with Latches
19 1. Introduction to Flip Flops
 how flip flops are different from latches
 why we use flip flops
 Master Slave S-R flip flop
 Problem of 1’s catching in Master slave flip flop, timing diagram and
its explanation.
20 1. Types of flip flop
 Edge triggered Flip flop
 JK flip flop
 Characteristic table and equations of SR, D and JK flip flop.
21 1. Flip-Flops with Direct Inputs
2. Sequential Analysis With examples
3. Given the circuit generate the state diagram
4. Some more examples of Sequential Design

22 Mid II
23 1. Given description form state diagram and design the circuit
2. Excitation tables for flip flops, D, SR and JK.
3. Sequential circuit design practice problems. 5.13, 5.14, 5.15
24 1. Registers implementation with flip flops
2. 4 bit register with parallel load
25 1. Shift register
2. Serial addition with registers
3. Shift register with parallel load
4. Bidirectional Shift Register
5. Serial In/Parallel Out
26 1. Microoperations, Register Transfers
2. Counters (synchronous and asynchronous)
3. 4 bit Ripple counter
27 1. Serial and Parallel Counters
2. Parallel gating counter
3. upward and downward counters
28 1. RAM, ROM
2. Memory Access
 Random Access
 Sequential Access
3. RAM Operation
 Read
 Write
4. Chip select option in RAMS.
29  RAM- (8.3 to 8.4)