Information Package / Course Catalogue
Digital Circuits
Course Code: CSE211
Course Type: Required
Couse Group: First Cycle (Bachelor's Degree)
Education Language: English
Work Placement: N/A
Theory: 3
Prt.: 0
Credit: 3
Lab: 0
ECTS: 4
Objectives of the Course

To learn the basic logic circuit elements and their applications

Course Content

Applications of compound logic, concept of sequential logic, functions, definition and types of multivibrators; monostable, astable, bistable multivibrators. Flip-flop concepts and types; RS, JK, D, T, Master / Slave RS flip-flops. Synchronous and asynchronous sequential circuit design, counters; asynchronous counters, synchronous counters, ripple, ring, cascade counters, up and down counters, counter applications, recorders, shift recorder applications. State diagrams of sequential logic circuits and state reduction. Belek elements, memory arrangement, memory decoder circuits, memory types, programmable logic elements, PLA, PAL, GAL. Design of arithmetic-logic units with sequential circuit elements

Name of Lecturer(s)
Lec. Mahmut SİNECEN
Learning Outcomes
1.An ability to perform arithmetic operations on binary integer numbers.
2.An ability to manipulate and simplify logic expressions using the postulates/theorems of Boolean algebra.
3.An ability to generate the prime implicants of logic functions using graphical (Karnaugh map) and tabular (Quine-McCluskey) methods, and to obtain their implementations with and without don't cares.
4.An ability to implement simple digital systems using MSI building blocks (Adders, multiplexers, decoders).
5.An ability to understand the basic functional and timing (clocking) properties of state devices (latches and flip-flops).
Recommended or Required Reading
1.Sayısal Elektronik, Hüseyin EKGZ, Değişim Yayınları, 2001.
2.Mano, M. Morris. Digital design. Pearson Educación, 2002.
Weekly Detailed Course Contents
Week 1 - Theoretical
Giriş: Dijital sistemlerin özellikleri, Sayı sistemleri, ikili sayılarla aritmetik işlemler
Week 2 - Theoretical
Fundamentals of Boolean Algebra, Axioms and theorems
Week 3 - Theoretical
Logic functions, canonical and standard forms
Week 4 - Theoretical
Logic gates, Universal gates. Implementation of logic functions using only NAND (NOR) gates.
Week 5 - Theoretical
Minimization of logical functions: Determining prime implicants using Karnaugh maps. Finding essential and sufficient prime implicants.
Week 6 - Theoretical
Minimization of logical functions: Determining prime implicants using Karnaugh maps. Finding essential and sufficient prime implicants.
Week 7 - Theoretical
Simplification: Selection of the Most Appropriate Prime Implicants Determining prime implicants using Tabular (Quine-McCluskey) method.
Week 8 - Theoretical
MSI building blocks (Adders, multiplexers, decoders). Design of combinational logic circuits using these devices. Programmable Logic Devices (PLD)
Week 9 - Theoretical
Latches and flip-flops
Week 10 - Theoretical
Latches and flip-flops
Week 11 - Theoretical
Analysis of synchronous sequential circuits
Week 12 - Theoretical
Analysis of synchronous sequential circuits
Week 13 - Theoretical
Analysis of synchronous sequential circuits
Week 14 - Theoretical
Electrical Behavior of logic circuits, TTL family, Characteristics of CMOS family
Assessment Methods and Criteria
Type of AssessmentCountPercent
Midterm Examination1%40
Final Examination1%60
Workload Calculation
ActivitiesCountPreparationTimeTotal Work Load (hours)
Lecture - Theory142370
Midterm Examination18210
Final Examination118220
TOTAL WORKLOAD (hours)100
Contribution of Learning Outcomes to Programme Outcomes
PÇ-1
PÇ-2
PÇ-3
PÇ-4
PÇ-5
PÇ-6
PÇ-7
PÇ-8
PÇ-9
PÇ-10
PÇ-11
OÇ-1
4
3
4
4
4
3
OÇ-2
4
4
4
4
3
3
OÇ-3
4
4
3
3
3
3
OÇ-4
4
4
3
3
3
3
OÇ-5
4
4
4
3
3
3
Adnan Menderes University - Information Package / Course Catalogue
2026