COMPUTER ENGINEERING (ENGLISH) | |||||
---|---|---|---|---|---|
Qualification Awarded | Program Süresi | Toplam Kredi (AKTS) | Öğretim Şekli | Yeterliliğin Düzeyi ve Öğrenme Alanı | |
Bachelor's (First Cycle) Degree | 4 | 240 | FULL TIME |
TYÇ, TR-NQF-HE, EQF-LLL, ISCED (2011):Level 6 QF-EHEA:First Cycle TR-NQF-HE, ISCED (1997-2013): |
Course Code: | 1415311001 | ||||||||||
Ders İsmi: | Computer Organization and Architecture | ||||||||||
Ders Yarıyılı: | Fall | ||||||||||
Ders Kredileri: |
|
||||||||||
Language of instruction: | EN | ||||||||||
Ders Koşulu: | |||||||||||
Ders İş Deneyimini Gerektiriyor mu?: | No | ||||||||||
Other Recommended Topics for the Course: | |||||||||||
Type of course: | Necessary | ||||||||||
Course Level: |
|
||||||||||
Mode of Delivery: | Face to face | ||||||||||
Course Coordinator : | Dr.Öğr.Üyesi Recep DURANAY | ||||||||||
Course Lecturer(s): | |||||||||||
Course Assistants: |
Course Objectives: | The aim of this course is to provide the students with the knowledge of general design principles of computer hardware and the ability to implement these designs using modern development tools. |
Course Content: | Buses, registers, command execution loop, control unit design methods, computer arithmetic, RAM, ROM, associative memory, cache, virtual memory, input / output, pipeline, RISC architecture, multiprocessor systems, term project. |
The students who have succeeded in this course;
|
Week | Subject | Related Preparation |
1) | INTRODUCTION | D.A. Patterson, J.L. Hennessy, “Computer Organization and Design”, Morgan Kaufmann |
2) | Virtual Memory | D.A. Patterson, J.L. Hennessy, “Computer Organization and Design”, Morgan Kaufmann |
3) | Buses, registers, command execution loop | D.A. Patterson, J.L. Hennessy, “Computer Organization and Design”, Morgan Kaufmann |
4) | Clever Agents | D.A. Patterson, J.L. Hennessy, “Computer Organization and Design”, Morgan Kaufmann |
5) | Physically related control | D.A. Patterson, J.L. Hennessy, “Computer Organization and Design”, Morgan Kaufmann |
6) | Introduction to Problem Solving and Search Algorithms with Artificial Intelligence | D.A. Patterson, J.L. Hennessy, “Computer Organization and Design”, Morgan Kaufmann |
7) | Microprogram control | D.A. Patterson, J.L. Hennessy, “Computer Organization and Design”, Morgan Kaufmann |
8) | Midterm | D.A. Patterson, J.L. Hennessy, “Computer Organization and Design”, Morgan Kaufmann |
9) | Search Algorithms That Don't Use Problem Information | D.A. Patterson, J.L. Hennessy, “Computer Organization and Design”, Morgan Kaufmann |
10) | Heuristic Search | D.A. Patterson, J.L. Hennessy, “Computer Organization and Design”, Morgan Kaufmann |
11) | Computer arithmetic | D.A. Patterson, J.L. Hennessy, “Computer Organization and Design”, Morgan Kaufmann |
12) | Meta-Heuristic Search Methods | D.A. Patterson, J.L. Hennessy, “Computer Organization and Design”, Morgan Kaufmann |
13) | Artificial neural networks | D.A. Patterson, J.L. Hennessy, “Computer Organization and Design”, Morgan Kaufmann |
14) | RAM, ROM, associative memory | D.A. Patterson, J.L. Hennessy, “Computer Organization and Design”, Morgan Kaufmann |
15) | Cache | D.A. Patterson, J.L. Hennessy, “Computer Organization and Design”, Morgan Kaufmann |
16) | Inference in First Order Logic | D.A. Patterson, J.L. Hennessy, “Computer Organization and Design”, Morgan Kaufmann |
Course Notes / Textbooks: | D.A. Patterson, J.L. Hennessy, “Computer Organization and Design”, Morgan Kaufmann |
References: | D.A. Patterson, J.L. Hennessy, “Computer Organization and Design”, Morgan Kaufmann |
Ders Öğrenme Kazanımları |
---|
Program Outcomes |
No Effect | 1 Lowest | 2 Low | 3 Average | 4 High | 5 Highest |
Program Outcomes | Level of Contribution |
Semester Requirements | Number of Activities | Level of Contribution |
Midterms | 1 | % 40 |
Semester Final Exam | 1 | % 60 |
total | % 100 | |
PERCENTAGE OF SEMESTER WORK | % 40 | |
PERCENTAGE OF FINAL WORK | % 60 | |
total | % 100 |
Activities | Number of Activities | Duration (Hours) | Workload |
Course Hours | 14 | 3 | 42 |
Study Hours Out of Class | 14 | 3 | 42 |
Midterms | 1 | 2 | 2 |
Final | 1 | 3 | 3 |
Total Workload | 89 |