First Cycle - Faculty of Engineering - Computer Engineering (English)
Y : Year of Study S : Semester
Course Unit Code Course Unit Title Type of Course Y S ECTS
CSE3015 Digital Logic Design Compulsory 3 5 7
Objectives of the Course
to introduce the concepts and design of logic circuits, including various code systems, devices, and techniques for analyzing and designing combinational circuits and sequential circuits.
Learning Outcomes
1 learn and effectively use new tools and development techniques
2 understand foundations of computer science, including logic, algorithims, and core concepts in hardware and software
3 use digital system design techniques an ability to develop and/or design a system or system components to meet desired specifications, performance, and capabilities
4 analyze and synthesize logic circuits.
5 understand of combinational and sequential digital/logic circuits, and modular design techniques.
6 understand the fundamental Boolean principles and manipulation and their application to digital desi
Mode of Delivery
Formal Education
Recommended Optional Programme Components
Course Contents
Number Systems and Conversion: Introduction, Conversion between bases, Arithmetic with bases other than ten, Negative numbers, Binary-coded decimal numbers. Boolean Algebra: Truth-functional calculus as a Boolean Algebra, Duality, Fundamental Theorems of Boolean Algebra, Set theory as an example of Boolean algebra, Examples of Boolean simplification, Remarks on switching functions. Minimization of Boolean Functions: Standard forms of boolean functions, Minterm and Maxterm Designation of functions, Karnaugh Map representation of Boolean Functions, Simplification of functions on Karnaugh Maps, Map minimizations of Product-of-Sums (POS) expressions, Incompletely specified functions. Tabular Minimization (Quine-McCluskey ) Method: Determination of prime implicants, The Prime Implicant Chart, Petrick?s Method, Simplification of Incompletely Specified Functions, Simplification Using Map-Entered Variables. Special Realizations and Codes: Binary adder, Coding of Numbers, the decoder, Code conversion and read-Only Memories, Multiplexers and PLAs, Multilevel Circuits, Introduction to Sequential Circuits: Model for Sequential Circuits, Memory Devices, Latches, Flip-Flops, Other Memory Devices, Timing Circuits.
Weekly Detailed Course Contents
Week Theoretical Practice Laboratory
1 Simplification of Switching Functions Quine-McCluskey Method
2 Quine-McCluskey Method(continued), Petrick's Algorithm
3 Modular Combinational Logic: Decoders, Encoders and Multiplexers
4 Combinational Circuit design with Programmable Logic Devices: Logic Array Circuits(PLA), Programmable Read- only Memory(PROM), Programmable Array Logic (PAL)
5 Combinational Circuit design with Programmable Logic Devices:Continued
6 Introduction to Sequential Devices: Latches, Flip-Flops, Timing Circuits
7 Modular Sequential Logic: Shift Registers and Design Example, Counters and Modulo-N Counters
8 Midterm exam
9 Analysis and Synthesis of Synchronous Sequential Circuits: Circuits Model(Mealy model, Moore Model)
10 Analysis and Synthesis of Synchronous Sequential Circuits:(continued) Syncronous Counters Design
11 Simplification of Sequential Circuits and Design
12 Simplification of Sequential Circuits and Design(continued)-Asynchronous Sequential Circuits and their design
13 Asynchronous Sequential Circuits and their design(continued)
14 Asynchronous Sequential Circuits and their design(continued)
15 exercise, make-up exam
16 Final exam study
17 Final Exam
Recommended or Required Reading
Nelson P. V., Agle H.T., Carroll D B., Irwin J. D., 1995; Digital Logic Circuit Analysis and Design, Prentice Hall, New Jersey
Planned Learning Activities and Teaching Methods
Theoretical lessons and problem sessions.
Term (or Year) Learning Activities60
End Of Term (or Year) Learning Activities40
Term (or Year) Learning ActivitiesQuantityWeight
Midterm Exam2100
End Of Term (or Year) Learning ActivitiesQuantityWeight
Final Exam1100
Language of Instruction
Language Codes
Work Placement(s)
Workload Calculation
Activities Number Time (hours) Total Work Load (hours)
Theoretical 14 3 42
Applied 14 2 28
Post Application Self Study 14 2 28
Midterm Preparation 2 15 30
Final Preparation 1 15 15
Total 45 37 143
Contribution of Learning Outcomes to Programme Outcomes
PO 1PO 2PO 3PO 4PO 5PO 6PO 7PO 8PO 9PO 10PO 11PO 12PO 13PO 14PO 15PO 16
LO 10000000000000000
LO 20000000000000000
LO 30000000000000000
LO 40000000000000000
LO 50000000000000000