| Course Title | Code | Semester | L+U Hour | Credits | ECTS |
|---|---|---|---|---|---|
| Digital Electronics | MEK1106 | 2. Semester | 3 + 1 | 4.0 | 4.0 |
| Prerequisites | None |
| Language of Instruction | Turkish |
| Course Level | Associate |
| Course Type | |
| Mode of delivery | Face to face |
| Course Coordinator |
Assist. Prof. Dr. Oğuzhan KENDİRLİ |
| Instructor(s) |
Oğuzhan KENDİRLİ |
| Assistants | |
| Goals | Learning and use information to Analog-to-digital concepts, numbers and coding systems, basic logic gates, the circuit output functions to obtain, Boolean Algebra and Karnaugh Maps using the logic function simplification, combinational and Arithmetic circuits about. |
| Course Content | Number systems, Logic gates, Integrated logical kinds, Boolean math, Karno map, Encoders, Decoders, Data selectors, Data distributors, Data collectors, Data extractors, Data comparators |
| Learning Outcomes |
- Distinguish between analog and digital system concepts. - Recognize Coding systems commonly used in digital systems. - Karnaugh creates maps and uses them for simplification. - Recognize number systems used in digital systems, transform and add-subtraction-multiplication. - Comprehend logic diagram drawing from given function or verbal expression, |
| Week | Topics | Learning Methods |
|---|---|---|
| 1. Week | Analog and Digital Systems. Decimal system of numeration, basic arithmetic operations. | |
| 2. Week | Binary, octal and hexadecimal counting system, basic arithmetic operations. | |
| 3. Week | Conversions between number systems. | |
| 4. Week | Encoding types, Code transformations between systems. | |
| 5. Week | Criteria of Digital Integrated classification, transistor logic circuit examples. | |
| 6. Week | Definition of basic logic gates, truth tables, output functions (And, Or, Not, Buffer, NAND, NOR , EXOR, EXNOR). | |
| 7. Week | Output Function - Logic diagram of the relationship. Equivalent logic gate (door to increase the number of entries, the NAND-NOR gates to get the other doors). | |
| 8. Week | Midterm | |
| 9. Week | Boolean Algebra Rules. Functions to be used in simplification. | |
| 10. Week | Maxterm, Minters concepts. Simplification of logic functions using Karnaugh Maps | |
| 11. Week | Combinational circuits -Code Converters, Encoders, Decoders | |
| 12. Week | Combinational Circuits - Decoders, 7-segment display, Information Distributors (DEMUX) | |
| 13. Week | Combinational circuits - Multiplexers (MUX), mux and function implementations. | |
| 14. Week | Arithmetic circuits - Half and Full Adder / Extractor |
| Yağımcı M., Akar F., Dijital Elektronik, Beta Yayınevi |
| Dijital Elektronik, M.YAĞIMLI-F.AKAR. 2-Dijital Elektronik, M.BEREKET-E.TEKİN. |
| Document | Sayısal Elektronik Tüm Dönem |
| Program Requirements | Contribution Level | DK1 | DK2 | DK3 | DK4 | DK5 | Measurement Method |
|---|---|---|---|---|---|---|---|
| PY2 | 3 | 0 | 0 | 0 | 0 | 0 | - |
| PY3 | 3 | 0 | 0 | 0 | 0 | 0 | - |
| PY4 | 5 | 0 | 0 | 0 | 0 | 0 | - |
| PY5 | 3 | 0 | 0 | 0 | 0 | 0 | - |
| PY6 | 3 | 0 | 0 | 0 | 0 | 0 | - |
| PY7 | 3 | 0 | 0 | 0 | 0 | 0 | - |
| PY8 | 2 | 0 | 0 | 0 | 0 | 0 | - |
| PY9 | 1 | 0 | 0 | 0 | 0 | 0 | - |
| PY10 | 1 | 0 | 0 | 0 | 0 | 0 | - |
| PY11 | 1 | 0 | 0 | 0 | 0 | 0 | - |
| PY12 | 1 | 0 | 0 | 0 | 0 | 0 | - |
| PY14 | 1 | 0 | 0 | 0 | 0 | 0 | - |
| 0 | 1 | 2 | 3 | 4 | 5 | |
|---|---|---|---|---|---|---|
| Course's Level of contribution | None | Very Low | Low | Fair | High | Very High |
| Method of assessment/evaluation | Written exam | Oral Exams | Assignment/Project | Laboratory work | Presentation/Seminar |
| Event | Quantity | Duration (Hour) | Total Workload (Hour) |
|---|---|---|---|
| Course Hours | 14 | 4 | 56 |
| Preparation, After Class Study | 14 | 2 | 28 |
| Midterm 1 | 1 | 8 | 8 |
| Practice | 1 | 10 | 10 |
| Total Workload | 102 | ||
| ECTS Credit of the Course | 4.0 | ||
