EEF 205E
From The Emerging Circuits and Computation Group at ITU
(Difference between revisions)
(→Weekly Course Plan) |
|||
| Line 27: | Line 27: | ||
* Midterm Exams: '''50%''' | * Midterm Exams: '''50%''' | ||
| − | ** 2 midterms (25% each) during the lecture time that will on ''' | + | ** 2 midterms (25% each) during the lecture time that will on '''13/11/2026''' and '''18/12/2026'''. |
* Final Exam: '''40%''' | * Final Exam: '''40%''' | ||
| Line 62: | Line 62: | ||
|| <div style="font-size: 120%;"> '''Topic'''</div> | || <div style="font-size: 120%;"> '''Topic'''</div> | ||
|- | |- | ||
| − | | Week 1, | + | | Week 1, 2/10/2026 || Introduction |
|- | |- | ||
| − | | Week 2, | + | | Week 2, 9/10/2026 || Digital logic fundamentals: gates, combinational circuits, Boolean expressions |
|- | |- | ||
| − | | Week 3, | + | | Week 3, 16/10/2026 || Digital logic fundamentals: truth tables, two-level forms (AND/OR/NAND/NOR), "don't cares" |
|- | |- | ||
| − | | Weeks 4, | + | | Weeks 4, 23/10/2026 || Logic minimization: Karnaugh maps, Quine-McCluskey method |
|- | |- | ||
| − | | Weeks 5, | + | | Weeks 5, 30/10/2026 || Logic minimization: Karnaugh maps, Quine-McCluskey method |
|- | |- | ||
| − | | Week 6, | + | | Week 6, 6/11/2026 || Combinational circuit design: building blocks (adders, multiplexers, decoders, etc.) |
|- | |- | ||
| − | | Weeks 7, | + | | Weeks 7, 13/11/2026 || MIDTERM I |
|- | |- | ||
| − | | Week 8, | + | | Week 8, 20/11/2026 || HOLIDAY! |
|- | |- | ||
| − | | Week 9, | + | | Week 9, 27/11/2026 || Combinational circuit design: implementing Boolean and arithmetic operations |
|- | |- | ||
| − | | Weeks 10, | + | | Weeks 10, 4/12/2026 || Sequential circuits: latches & flip-flops |
|- | |- | ||
| − | | Week 11, | + | | Week 11, 11/12/2026 || Sequential circuit design: state graphs and tables, modules |
|- | |- | ||
| − | | Week 12, | + | | Week 12, 18/12/2026 || MIDTERM II |
|- | |- | ||
| − | | Weeks 13, | + | | Weeks 13, 25/12/2026 || Sequential circuit design: modules, state machines |
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
|} | |} | ||
Revision as of 11:28, 23 September 2026
Syllabus
EEF 205E: Introduction to Logic Design, CRN: 14414, Fridays 8:30-11:30, Room: 6309 (EEF), Fall 2026.
|
Instructor
|
|
| Teaching Assistant
|
İsmail Melik Türker
|
| Grading
|
|
| Textbook
|
|
| Reference Books
|
|
| Policies
|
|
Weekly Course Plan
|
Date
|
Topic
|
| Week 1, 2/10/2026 | Introduction |
| Week 2, 9/10/2026 | Digital logic fundamentals: gates, combinational circuits, Boolean expressions |
| Week 3, 16/10/2026 | Digital logic fundamentals: truth tables, two-level forms (AND/OR/NAND/NOR), "don't cares" |
| Weeks 4, 23/10/2026 | Logic minimization: Karnaugh maps, Quine-McCluskey method |
| Weeks 5, 30/10/2026 | Logic minimization: Karnaugh maps, Quine-McCluskey method |
| Week 6, 6/11/2026 | Combinational circuit design: building blocks (adders, multiplexers, decoders, etc.) |
| Weeks 7, 13/11/2026 | MIDTERM I |
| Week 8, 20/11/2026 | HOLIDAY! |
| Week 9, 27/11/2026 | Combinational circuit design: implementing Boolean and arithmetic operations |
| Weeks 10, 4/12/2026 | Sequential circuits: latches & flip-flops |
| Week 11, 11/12/2026 | Sequential circuit design: state graphs and tables, modules |
| Week 12, 18/12/2026 | MIDTERM II |
| Weeks 13, 25/12/2026 | Sequential circuit design: modules, state machines |
Course Materials
Shared through Ninova.