CE1111  -  Logic Design
Units Hours
Theoretical Practical
3 3 0
Course Catalog Description

History and overview, Numbers and conversions, Switching theory, Boolean Algebra, Combinational logic circuits, Function Optimization, Modular design of combinational circuits, Memory elements, Sequential logic circuits, Finite State Machines (FSMs) models, state diagrams, state tables, state reduction and state assignment .

Course Requirements

Digital Design with an Introduction to the Verilog HDL


Published by Pearson, 2013

ISBN-13: 978-0-13-277420-8


M. Morris R. Mano, Michael D. Ciletti


Eng. Abdullah Elsir

Grading Policy
Learning Outcome
Outcome Proficiency Assessment
   1 .  Convert between different number systems and perform binary addition and subtraction using 1’s complement and 2’s complement representations Exam, Quiz, Assignment
   2 .  Recall the axioms and laws of Boolean algebra and apply them for logic functions. Exam, Quiz, Assignment
   3 .  Analyse any logic circuit to obtain the logic function and truth table. Exam, Quiz, Assignment
   4 .  Use the Karnaugh map to perform an algorithmic reduction of logic functions. Exam, Quiz, Assignment
   5 .  Design any combinational logic circuit and examine the following combinational components: encoders/decoders, multiplexers, exclusive-ORs, comparators. Exam, Quiz, Assignment
   6 .  Recognize the operation of latches and flip-flops and be able to analyze and design different sequential circuits. Exam, Quiz, Assignment
Week Description - Reading  
1 & 2

Digital systems, Number systems, Codes and Conversion.

3 & 4

Boolean algebra: axioms and theorems and functions forms and conversions.

5 & 6

Gate level minimization methods.

7 & 8 & 9

Combinational logic: analysis and design.

10 & 11 & 12

Sequential logic: latches and flip-flops, circuit analysis and design.

13 & 14

Sequential logic applications: registers and counters