Computer Architecture and Logical Design
Software Engineering
Faculty of Engineering
First Cycle (Bachelor's Degree)
| Course Unit Title | Course Unit Code | Type of Course Unit | Level of Course Unit | Year of Study | Semester | ECTS Credits |
|---|---|---|---|---|---|---|
| Computer Architecture and Logical Design | YZM205 | Compulsory | Bachelor's degree | 2 | Fall | 4 |
Name of Lecturer(s)
Prof. Dr. Kerem KÜÇÜK
Assistant Prof. Dr. Kaplan KAPLAN
Learning Outcomes of the Course Unit
1) Knows analog / digital signs and coding.
2) Knows Boolean mathematics, simplifies logical expressions.
3) Knows hardware programming language (Verilog-HDL or V-HDL).
4) Makes complex combinational and sequential circuit design.
5) Simulate and synthesize complex logic circuits using software tools.
6) Designs commands of a simple processor and simulates them with software tools.
7) Explain caching architectures and their effects on performance.
Program Competencies-Learning Outcomes Relation
| Program Competencies | |||||||||||||
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | ||
| Learning Outcomes | |||||||||||||
| 1 | No relation | No relation | No relation | Middle | No relation | No relation | No relation | No relation | No relation | High | No relation | No relation | |
| 2 | High | No relation | High | No relation | No relation | No relation | No relation | No relation | No relation | High | No relation | No relation | |
| 3 | No relation | No relation | No relation | No relation | High | High | No relation | No relation | No relation | No relation | High | No relation | |
| 4 | No relation | No relation | No relation | No relation | No relation | No relation | No relation | High | No relation | High | No relation | No relation | |
| 5 | No relation | No relation | High | High | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | |
| 6 | No relation | No relation | No relation | No relation | High | No relation | No relation | No relation | No relation | No relation | No relation | No relation | |
| 7 | No relation | No relation | High | High | No relation | No relation | High | High | High | High | High | High | |
Mode of Delivery
Face to Face
Prerequisites and Co-Requisites
None
Recommended Optional Programme Components
Not Required
Course Contents
Introduction to number systems, Postulates of Boolean Algebra, Fundamentals Theorems, Laws of Boolean Algebra, De Morgan’s Theorem, Duality in Boolean Algebra, Complements, Boolean Constants, Variables and Functions, Switching Algebra, Electronic Gates and Mechanical Contacts, Boolean Functions, Logical Operations, Canonical and Standard Forms, ‘Binary, Octal and Hexadecimal’ Designations, Logical Operations (OR, NOR, AND, NAND, EXCLUSIVE OR), Simplification of Boolean Functions, The Tabulation Method, The Karnough Map, S-R Flip-Flop, J-K Flip-Flop, D Flip-Flop, T Flip-Flop, Counters and their design, Introduction to Programmable logic design, Labrotuary application of this course.
Recommended or Required Reading
Planned Learning Activities and Teaching Methods
1) Lecture
2) Simulation
3) Case Study
4) Problem Solving
5) Project Based Learning
Assessment Methods and Criteria
Contribution of Semester Studies to Course Grade |
50% |
|||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
|
||||||||||||
Contribution of Final Examination to Course Grade |
50% |
|||||||||||
Total | 100% | |||||||||||
Language of Instruction
Turkish
Work Placement(s)
Not Required