| Academic Unit: |
Department of Computer Engineering |
| Mode of Delivery: |
Face to face |
| Prerequisites: |
None |
| Language of Instruction: |
English |
| Level of Course Unit: |
Graduate |
| Course Coordinator: |
Öznur YAŞAR DİNER |
| Course Lecturer(s): |
Öznur YAŞAR DİNER |
| Course Objectives: |
This course aims to introduce the fundamentals of
the theory of computation and how its used in
computer science. |
| Course Contents: |
Finite Automata, Languages. Turing Machines. Gödel`s
Incompleteness Theorems. Complexity Theory (Time
Complexity and Space Complexity) Approximation
Algorithms, Probabilistic Algorithms. |
| Learning Outcomes of the Course Unit (LO): |
- 1- Demonstrate advanced knowledge of formal computation and its relationship to languages
- 2- Distinguish different computing languages and classify their respective types
- 3- Show a competent understanding of the basic concepts of complexity theory.
- 4- Correctly define computational complexity classes and analyze the time and space complexity of algorithms
- 5- Present procedures of proving NP-completeness and NP-hardness, and be able to provide proofs for network design problems defined as decision problems
|
| Planned Learning Activities and Teaching Methods: |
Lecture, Discussion, Sampling, Problem Solving, Question and Answer, Group Work |
At Kadir Has University, a Semester is 14 weeks; The weeks 15 and 16 are reserved for final exams.
THE RELATIONSHIP BETWEEN COURSE LEARNING OUTCOMES (LO) AND PROGRAM QUALIFICATIONS (PQ)
| # |
PQ1 |
PQ2 |
PQ3 |
PQ4 |
PQ5 |
PQ6 |
PQ7 |
PQ8 |
PQ9 |
PQ10 |
| LO1 |
|
|
|
|
|
|
|
|
|
|
| LO2 |
|
|
|
|
|
|
|
|
|
|
| LO3 |
|
|
|
|
|
|
|
|
|
|
| LO4 |
|
|
|
|
|
|
|
|
|
|
| LO5 |
|
|
|
|
|
|
|
|
|
|
Contribution: 1 Low, 2 Average, 3 High
