| Course Title | Code | Semester | L+U Hour | Credits | ECTS |
|---|---|---|---|---|---|
| Logic Design | ABL2008 | 2. Semester | 3 + 1 | 4.0 | 5.0 |
| Prerequisites | None |
| Language of Instruction | Turkish |
| Course Level | Associate |
| Course Type | |
| Mode of delivery | Lecture, Problem Solving, Computer Aided Instruction |
| Course Coordinator |
Lect. Emrah MERCAN |
| Instructor(s) |
Emrah MERCAN |
| Assistants | |
| Goals | This lesson; Explains number systems and code types, analysis and design of arithmetic and logic circuits using boolean algebra and karnough maps, operation and design of flip-flop circuits and memory circuits. |
| Course Content | Analog Numerical Concepts, Number systems and codes, Logic Gates, Boolean mathematics and Simplification methods, Karnough maps, Encoders and Code converters, Arithmetic Circuits, Flip-Flops, Registers and Memories |
| Learning Outcomes |
- To be able to convert number systems and code types. - To have knowledge about logic gates, truth tables and gate transformations. - Ability to design and simplify using Boolean mathematics and Karnough maps. - Having knowledge about combinational circuits - To be able to design arithmetic circuits. - To be able to design counters and registers using flip-flops. - ALU, ADC ve PLA kavramları hakkında bilgi sahibi olmak. - To have knowledge about Memory and Memory Types. |
| Week | Topics | Learning Methods |
|---|---|---|
| 1. Week | Analog and Digital Concepts, Number Systems | Course Hours |
| 2. Week | Conversion of number systems and arithmetic operations. | Course Hours |
| 3. Week | BCD, Excess-3, Parity, Gray, ASCII codes | Course Hours |
| 4. Week | Logic Propositions, Logic Gates and Truth Tables, Logic Integrators, Positive and Negative Logic, TTL and CMOS Logic. | Practice Course Hours |
| 5. Week | Design of a logic circuit (diagram) from a logic expression, Finding a logical expression from a logic circuit. Increasing and decreasing the logic gate inputs, obtaining other gates from the Nand gate. | Practice Course Hours |
| 6. Week | Boolean Mathematics, Finding the output expression from the truth table. Simplification operations with Boolean Mathematics. | Course Hours Practice |
| 7. Week | Simplification methods with Karnaugh map | Course Hours Practice |
| 8. Week | Midterm | Practice Course Hours |
| 9. Week | Logical designs for problems. | Course Hours Practice |
| 10. Week | Combinational Circuits; Code converters, Encoders, Decoders, Multiplexer, Demultiplexer, | Course Hours Practice |
| 11. Week | Arithmetic Circuits; Half-Full-Parallel Adder, Half-Full-Parallel Subtractor, Half-Full-Parallel Comparator. ALU. | Practice Course Hours |
| 12. Week | Flip-Flops; RS-JK-D-T type flip flops, accuracy and transition tables. | Practice Course Hours |
| 13. Week | Asynchronous and Synchronous counters. | Course Hours Practice |
| 14. Week | Registers, PLA, ADC and Memories | Course Hours Practice |
| Dijital Elektronik (Metin BEREKET - Engin TEKİN) Mavi Kitaplar. |
| Sayısal Tasarım (Morris Mano) Literatür Yayıncılık |
| Program Requirements | Contribution Level | DK1 | DK2 | DK3 | DK4 | DK5 | DK6 | DK7 | DK8 | Measurement Method |
|---|---|---|---|---|---|---|---|---|---|---|
| PY1 | 1 | 5 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | - |
| PY2 | 4 | 5 | 5 | 5 | 5 | 5 | 2 | 2 | 5 | - |
| PY3 | 3 | 3 | 2 | 3 | 2 | 4 | 4 | 2 | 5 | - |
| PY6 | 3 | 3 | 3 | 3 | 3 | 2 | 2 | 4 | 2 | - |
| PY7 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | - |
| 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 |
| Research | 5 | 2 | 10 |
| Practice | 10 | 3 | 30 |
| Midterm 1 | 1 | 2 | 2 |
| Final | 1 | 2 | 2 |
| Practice | 5 | 5 | 25 |
| Total Workload | 125 | ||
| ECTS Credit of the Course | 5.0 | ||
