FACULTY OF ENGINEERING
Department of Computer Engineering
CE 308 | Course Introduction and Application Information
Course Name |
Computing Theory
|
Code
|
Semester
|
Theory
(hour/week) |
Application/Lab
(hour/week) |
Local Credits
|
ECTS
|
CE 308
|
Fall/Spring
|
3
|
2
|
4
|
7
|
Prerequisites |
|
|||||||
Course Language |
English
|
|||||||
Course Type |
Service Course
|
|||||||
Course Level |
First Cycle
|
|||||||
Mode of Delivery | - | |||||||
Teaching Methods and Techniques of the Course | DiscussionProblem SolvingQ&ACritical feedbackLecture / Presentation | |||||||
Course Coordinator | ||||||||
Course Lecturer(s) | ||||||||
Assistant(s) |
Course Objectives | The objective of this course is to introduce the theory of automata and formal languages as a further step in abstracting the attention away from any particular kind of programming language. Basic models of computation will be presented which will set the grounds for many branches of computer science such as compiler design and software engineering. At the end of the course, students are expected to deal with all these concepts from an engineering viewpoint. |
Learning Outcomes |
The students who succeeded in this course;
|
Course Description | The following topics will be included: regular expressions and contextfree languages, finite and pushdown automata, Turing machines, computability, undecidability, and complexity of problems. |
|
Core Courses |
X
|
Major Area Courses | ||
Supportive Courses | ||
Media and Management Skills Courses | ||
Transferable Skill Courses |
WEEKLY SUBJECTS AND RELATED PREPARATION STUDIES
Week | Subjects | Related Preparation |
1 | Deterministic Finite Automata | Chapter 1. Sections 1.1. Introduction to the theory of computation. Michael Sipser. ISBN 053494728X |
2 | Deterministic Finite Automata | Chapter 1. Sections 1.1. Introduction to the theory of computation. Michael Sipser. ISBN 053494728X |
3 | Nondeterministic finite automata | Chapter 1. Sections 1.2. Introduction to the theory of computation. Michael Sipser. ISBN 053494728X |
4 | Nondeterministic finite automata | Chapter 1. Sections 1.2. Introduction to the theory of computation. Michael Sipser. ISBN 053494728X |
5 | Regular Expressions | Chapter 1. Sections 1.3. Introduction to the theory of computation. Michael Sipser. ISBN 053494728X |
6 | Regular Expressions | Chapter 1. Sections 1.3. Introduction to the theory of computation. Michael Sipser. ISBN 053494728X |
7 | Context-free Grammars | Chapter 2. Sections 2.1. Introduction to the theory of computation. Michael Sipser. ISBN 053494728X |
8 | Context-free Grammars | Chapter 2. Sections 2.1. Introduction to the theory of computation. Michael Sipser. ISBN 053494728X |
9 | Pushdown Automata | Chapter 2. Sections 2.2. Introduction to the theory of computation. Michael Sipser. ISBN 053494728X |
10 | Pushdown Automata | Chapter 2. Sections 2.2. Introduction to the theory of computation. Michael Sipser. ISBN 053494728X |
11 | Turing Machines | Chapter 3. Sections 3.1. Introduction to the theory of computation. Michael Sipser. ISBN 053494728X |
12 | Turing Machines | Chapter 3. Sections 3.2, 3.3. Introduction to the theory of computation. Michael Sipser. ISBN 053494728X |
13 | The class P and NP | Chapter 7. Sections 7.2, 7.3. Introduction to the theory of computation. Michael Sipser. ISBN 053494728X |
14 | NP completeness | Chapter 7. Sections 7.4. Introduction to the theory of computation. Michael Sipser. ISBN 053494728X |
15 | Decidability and undecidability | Chapter 4. Introduction to the theory of computation. Michael Sipser. ISBN 053494728X |
16 | Review of Semester |
Course Notes/Textbooks | Introduction to the theory of computation, Michael Sipser. ISBN 053494728X |
Suggested Readings/Materials | https://ocw.mit.edu/courses/18-404j-theory-of-computation-fall-2020/ |
EVALUATION SYSTEM
Semester Activities | Number | Weigthing |
Participation | ||
Laboratory / Application | ||
Field Work | ||
Quizzes / Studio Critiques |
1
|
20
|
Portfolio | ||
Homework / Assignments |
1
|
12
|
Presentation / Jury | ||
Project | ||
Seminar / Workshop | ||
Oral Exams | ||
Midterm |
1
|
28
|
Final Exam |
1
|
40
|
Total |
Weighting of Semester Activities on the Final Grade |
3
|
60
|
Weighting of End-of-Semester Activities on the Final Grade |
1
|
40
|
Total |
ECTS / WORKLOAD TABLE
Semester Activities | Number | Duration (Hours) | Workload |
---|---|---|---|
Theoretical Course Hours (Including exam week: 16 x total hours) |
16
|
3
|
48
|
Laboratory / Application Hours (Including exam week: '.16.' x total hours) |
16
|
2
|
32
|
Study Hours Out of Class |
14
|
5
|
70
|
Field Work |
0
|
||
Quizzes / Studio Critiques |
1
|
10
|
10
|
Portfolio |
0
|
||
Homework / Assignments |
2
|
5
|
10
|
Presentation / Jury |
0
|
||
Project |
0
|
||
Seminar / Workshop |
0
|
||
Oral Exam |
0
|
||
Midterms |
1
|
20
|
20
|
Final Exam |
1
|
20
|
20
|
Total |
210
|
COURSE LEARNING OUTCOMES AND PROGRAM QUALIFICATIONS RELATIONSHIP
#
|
Program Competencies/Outcomes |
* Contribution Level
|
||||
1
|
2
|
3
|
4
|
5
|
||
1 | To have adequate knowledge in Mathematics, Science and Computer Engineering; to be able to use theoretical and applied information in these areas on complex engineering problems. |
X | ||||
2 | To be able to identify, define, formulate, and solve complex Computer Engineering problems; to be able to select and apply proper analysis and modeling methods for this purpose. |
X | ||||
3 | To be able to design a complex system, process, device or product under realistic constraints and conditions, in such a way as to meet the requirements; to be able to apply modern design methods for this purpose. |
X | ||||
4 | To be able to devise, select, and use modern techniques and tools needed for analysis and solution of complex problems in Computer Engineering applications; to be able to use information technologies effectively. |
X | ||||
5 | To be able to design and conduct experiments, gather data, analyze and interpret results for investigating complex engineering problems or Computer Engineering research topics. |
X | ||||
6 | To be able to work efficiently in Computer Engineering disciplinary and multi-disciplinary teams; to be able to work individually. |
X | ||||
7 | To be able to communicate effectively in Turkish, both orally and in writing; to be able to author and comprehend written reports, to be able to prepare design and implementation reports, to present effectively, to be able to give and receive clear and comprehensible instructions. |
|||||
8 | To have knowledge about global and social impact of Computer Engineering practices on health, environment, and safety; to have knowledge about contemporary issues as they pertain to engineering; to be aware of the legal ramifications of Computer Engineering solutions. |
|||||
9 | To be aware of ethical behavior, professional and ethical responsibility; to have knowledge about standards utilized in engineering applications. |
|||||
10 | To have knowledge about industrial practices such as project management, risk management, and change management; to have awareness of entrepreneurship and innovation; to have knowledge about sustainable development. |
|||||
11 | To be able to collect data in the area of Computer Engineering, and to be able to communicate with colleagues in a foreign language. ("European Language Portfolio Global Scale", Level B1) |
|||||
12 | To be able to speak a second foreign language at a medium level of fluency efficiently. |
|||||
13 | To recognize the need for lifelong learning; to be able to access information, to be able to stay current with developments in science and technology; to be able to relate the knowledge accumulated throughout the human history to Computer Engineering. |
*1 Lowest, 2 Low, 3 Average, 4 High, 5 Highest
NEWS |ALL NEWS
Home kitchens will be like ‘restaurant kitchens’
Esra-Melis Sarıhan sisters, graduates of Izmir University of Economics (IUE), developed an application called ‘Yedir’ that will bring home cooks and food
She became one of the 10 most successful women in the Middle East
Melda Akın, a graduate of Department of Computer Engineering, Izmir University of Economics (IUE), was named one of the 10 most successful
Watch out for pandemic scams
Fake job postings that promise people to work from home have been the latest tactic of scammers, who are looking for ways