|
|
| BMCT1001 | Digital Electronic | 3+1+0 | ECTS:4 | | Year / Semester | Fall Semester | | Level of Course | Short Cycle | | Status | Compulsory | | Department | DEPARTMENT of ELECTRONICS and AUTOMATION | | Prerequisites and co-requisites | None | | Mode of Delivery | | | Contact Hours | 14 weeks - 3 hours of lectures and 1 hour of practicals per week | | Lecturer | Öğr. Gör. Bülent ATASEVEN | | Co-Lecturer | | | Language of instruction | Turkish | | Professional practise ( internship ) | None | | | | The aim of the course: | | This course aims to understand the functioning of the computer and to give basic information about digital electronics. In this way, it is aimed for computer programmers to have information about the functioning and structure of the hardware system they use. |
| Learning Outcomes | CTPO | TOA | | Upon successful completion of the course, the students will be able to : | | | | LO - 1 : | Establish the basic logic circuits. | 3,4 | 1, | | LO - 2 : | Simplify the basic logic circuits. | 2,4,6 | 1, | | LO - 3 : | Build compound logic circuits. | 3,4,6 | 1, | | LO - 4 : | Build arithmetic logic circuits. | 4,6 | 1, | | LO - 5 : | Will be able to explain numerical concept and number systems. | 2,3 | 1, | | LO - 6 : | Will be able to recognize Combinational and Sequential Circuits. | 4,6 | 1, | | LO - 7 : | Will understand that digital electronics is the basis of microprocessor-based systems | 4 | 1, | | LO - 8 : | Learns the internal structures of logic gates (transistor, diode...) | 4 | 1, | | LO - 9 : | Will understand the working principle of the computer. In particular, they will understand how the arithmetic logic unit in the computer works. | 4,6 | 1, | | CTPO : Contribution to programme outcomes, TOA :Type of assessment (1: written exam, 2: Oral exam, 3: Homework assignment, 4: Laboratory exercise/exam, 5: Seminar / presentation, 6: Term paper), LO : Learning Outcome | | |
| Analog and digital signals, Number systems, Four operations in number systems, Complement arithmetic, Codes, What is integration and its classification, Boolean algebra, Logic gates, Basic expansions and standard forms, Representing logic functions in mathematical form, Mini term and maxi term, Karno maps, Writing logic functions in 1.Canonical and 2.Canonical forms. Table method, Encoders, Decoders, Data selectors, Information distributors, Arithmetic processing circuits (Half and full adder, Half and full subtractor, Comparators, Beaters and cascade connections, Programmable logic circuits) |
| |
| Course Syllabus | | Week | Subject | Related Notes / Files | | Week 1 | Number systems, Number systems recognize each other to convert number systems, binary numbers, Subtraction, Multiplication and Division Operations | | | Week 2 | Number systems, Number systems recognize each other to convert number systems, binary numbers, Subtraction, Multiplication and Division Operations,Operations with complement arithmetic | | | Week 3 | Coding systems | | | Week 4 | Logic IC, Logic gates, Logic circuits and Boolean mathematics | | | Week 5 | Logic circuits and boolean mathematics, simplification of logic expressions with Boolean algebra and circuit design | | | Week 6 | Basic expansions (miniterim, maxiterm, 1st canonical and 2nd canonical form, representing logic functions in mathematical form, product of sums form, sum of products form) and circuit design using a single type of gate. | | | Week 7 | Simplification with the table method (Quine McCluskey), Simplification with the map method (karnough maps), simplification of logical expressions with karno maps, various applications with karnough maps | | | Week 8 | Simplification with the table method (Quine McCluskey), Simplification with the map method (karnough maps), simplification of logical expressions with karno maps, various applications with karnough maps | | | Week 9 | Midterm | | | Week 10 | Combinational Circuits Code Converters, Encoders, Decoders, Multiplexer, Demultiplexer | | | Week 11 | Combinational Circuits Code Converters, Encoders, Decoders, Multiplexer, Demultiplexerr | | | Week 12 | Arithmetic circuits adders, subtractors, multiplication circuits, comparators, arithmetic logic units | | | Week 13 | Arithmetic circuits adders, subtractors, multiplication circuits, comparators, arithmetic logic units | | | Week 14 | Programmable Logic Devices | | | Week 15 | End of term course repetition | | | Week 16 | Final Exam | | | |
| 1 | YAĞIMLI, Mustafa ve AKAR Feyzi. 2018; Beta Basım Yayım. | | | |
| 1 | Kleitz, William. 2010; Digital Electronics A Practical Approach with VHDL. | | | 2 | 2012, Megep Temel Mantık Devreleri | | | |
| Method of Assessment | | Type of assessment | Week No | Date | Duration (hours) | Weight (%) | | Mid-term exam | 9 | 27/11/2023 | 1 | 50 | | End-of-term exam | 16 | 16/01/2024 | 1 | 50 | | |
| Student Work Load and its Distribution | | Type of work | Duration (hours pw) | No of weeks / Number of activity | Hours in total per term | | Yüz yüze eğitim | 3 | 14 | 42 | | Sınıf dışı çalışma | 1 | 14 | 14 | | Laboratuar çalışması | 0 | 0 | 0 | | Arasınav için hazırlık | 5 | 4 | 20 | | Arasınav | 1 | 1 | 1 | | Uygulama | 1 | 14 | 14 | | Klinik Uygulama | 0 | 0 | 0 | | Kısa sınav | 0 | 0 | 0 | | Dönem sonu sınavı için hazırlık | 7 | 4 | 28 | | Dönem sonu sınavı | 1 | 1 | 1 | | Diğer 1 | 0 | 0 | 0 | | Diğer 2 | 0 | 0 | 0 | | Total work load | | | 120 |
|