TÜRKÇE
ENGLISH
Information
| Unit | FACULTY OF ENGINEERING |
| COMPUTER ENGINEERING PR. (ENGLISH) | |
| Code | CEN343 |
| Name | Theory of Computation |
| Term | 2019-2020 Academic Year |
| Semester | 5. Semester |
| Duration (T+A) | 3-0 (T-A) (17 Week) |
| ECTS | 5 ECTS |
| National Credit | 3 National Credit |
| Teaching Language | İngilizce |
| Level | Lisans Dersi |
| Type | Normal |
| Label | C Compulsory |
| Mode of study | Yüz Yüze Öğretim |
| Catalog Information Coordinator | Prof. Dr. UMUT ORHAN |
| Course Instructor |
Prof. Dr. UMUT ORHAN
(Güz)
(A Group)
(Ins. in Charge)
|
Course Goal / Objective
In this course, the main goal is to define the language classes in terms of grammars and automata.
Course Content
Chomsky hierarchy, Regular languages, Context free languages, Turing machines, Decidability, P and NP languages, NP-complete languages
Course Precondition
Resources
Notes
Course Learning Outcomes
| Order | Course Learning Outcomes |
|---|---|
| LO01 | Knows Chomsky hierarchy |
| LO02 | Knows Regular languages |
| LO03 | Knows Context free languages |
| LO04 | Knows Turing machines |
| LO05 | Knows Decidability |
| LO06 | Knows P, NP and NP-complete languages |
Relation with Program Learning Outcome
| Order | Type | Program Learning Outcomes | Level |
|---|---|---|---|
| PLO01 | - | Has capability in the fields of mathematics, science and computer that form the foundations of engineering | 4 |
| PLO02 | - | Identifies, formulates, and solves engineering problems, selects and applies appropriate analytical methods and modeling techniques, | 4 |
| PLO03 | - | Analyzes a system, its component, or process and designs under realistic constraints to meet the desired requirements,gains the ability to apply the methods of modern design accordingly. | 3 |
| PLO04 | - | Ability to use modern techniques and tools necessary for engineering practice and information technologies effectively. | 3 |
| PLO05 | - | Ability to design and to conduct experiments, to collect data, to analyze and to interpret results | 1 |
| PLO06 | - | Has ability to work effectively as an individual and in multi-disciplinary teams, take sresponsibility and builds self-confidence | 2 |
| PLO07 | - | Can access information,gains the ability to do resource research and uses information resources | 2 |
| PLO08 | - | Awareness of the requirement of lifelong learning, to follow developments in science and technology and continuous self-renewal ability | 3 |
| PLO09 | - | Ability to communicate effectively orally and in writing, and to read and understand technical publications in at least one foreign language | 3 |
| PLO10 | - | Professional and ethical responsibility, | 2 |
| PLO11 | - | Awareness about project management, workplace practices, employee health, environmental and occupational safety, and the legal implications of engineering applications, | 0 |
| PLO12 | - | Becomes aware of universal and social effects of engineering solutions and applications, entrepreneurship and innovation, and knowledge of contemporary issues | 1 |
Week Plan
| Week | Topic | Preparation | Methods |
|---|---|---|---|
| 1 | Discrete Mathematical Structures review | Reading related chapter in lecture notes | |
| 2 | Deterministic Finite Automata (DFA) and Non-Deterministic Finite Automata (NFA) | Reading related chapter in lecture notes | |
| 3 | NFA to DFA, Regular Expressions | Reading related chapter in lecture notes | |
| 4 | DFA to Regular Expression, Pumping Lemma for Regular Languages | Reading related chapter in lecture notes | |
| 5 | Context-Free Grammars, Chomsky Normal Form | Reading related chapter in lecture notes | |
| 6 | Push-Down Automata | Reading related chapter in lecture notes | |
| 7 | Pumping Lemma for Context-Free Languages | Reading related chapter in lecture notes | |
| 8 | Midterm Exam | Study to lecture notes and apllications | |
| 9 | Turing Machines, Church-Turing Thesis | Reading related chapter in lecture notes | |
| 10 | Non-Deterministic Turing Machines | Reading related chapter in lecture notes | |
| 11 | Decidable and Undecidable Languages | Reading related chapter in lecture notes | |
| 12 | Enumerability and Enumarable Languages | Reading related chapter in lecture notes | |
| 13 | Introduction to Complexity Theory, P and NP classes | Reading related chapter in lecture notes | |
| 14 | Non-Deterministic algorithms, NP-Complete Languages | Reading related chapter in lecture notes | |
| 15 | Review for final exam | Reading related chapter in lecture notes | |
| 16 | Final Exam | Study to lecture notes and apllications | |
| 17 | Final Exam | Study to lecture notes and apllications |
Assessment (Exam) Methods and Criteria
| Assessment Type | Midterm / Year Impact | End of Term / End of Year Impact |
|---|---|---|
| 1. Midterm Exam | 100 | 40 |
| General Assessment | ||
| Midterm / Year Total | 100 | 40 |
| 1. Final Exam | - | 60 |
| Grand Total | - | 100 |
Student Workload - ECTS
| Works | Number | Time (Hour) | Workload (Hour) |
|---|---|---|---|
| Course Related Works | |||
| Class Time (Exam weeks are excluded) | 14 | 3 | 42 |
| Out of Class Study (Preliminary Work, Practice) | 14 | 3 | 42 |
| Assesment Related Works | |||
| Homeworks, Projects, Others | 0 | 0 | 0 |
| Mid-term Exams (Written, Oral, etc.) | 1 | 12 | 12 |
| Final Exam | 1 | 18 | 18 |
| Total Workload (Hour) | 114 | ||
| Total Workload / 25 (h) | 4,56 | ||
| ECTS | 5 ECTS | ||