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
3
0
3
7

Prerequisites
  CE 215 To succeed (To get a grade of at least DD)
Course Language
English
Course Type
Required
Course Level
First Cycle
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.
Course Description The students who succeeded in this course;
  • will be able to articulate Chomsky language hierarchy and corresponding automata and grammar types,
  • will be able to trace a given automata or grammar
  • will be able to convert a given automata (DFA, NFA, PDA, TM) or grammar to another equivalent form,
  • will be able to design an automata or grammar for a given language,
  • will be able to define basic computational complexity concepts of polynomial time, non-deterministic polynomial time, NP-completeness, decidability and undecidability.
Course Content The following topics will be included: regular expressions and contextfree languages, finite and pushdown automata, Turing machines, computability, undecidability, and complexity of problems.

 



Course Category

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.3. Introduction to the theory of computation. Michael Sipser. ISBN 053494728X
5 Regular expressions Chapter 2. Sections 2.1. Introduction to the theory of computation. Michael Sipser. ISBN 053494728X
6 Regular expressions Chapter 2. Sections 2.2. Introduction to the theory of computation. Michael Sipser. ISBN 053494728X
7 Contextfree grammars Chapter 3. Sections 3.1. Introduction to the theory of computation. Michael Sipser. ISBN 053494728X
8 Contextfree grammars Chapter 3. Sections 3.2, 3.3. Introduction to the theory of computation. Michael Sipser. ISBN 053494728X
9 Pushdown automata Chapter 4. Introduction to the theory of computation. Michael Sipser. ISBN 053494728X
10 Pushdown automata Chapter 7. Sections 7.2. Introduction to the theory of computation. Michael Sipser. ISBN 053494728X
11 Turing machines Chapter 7. Sections 7.3. Introduction to the theory of computation. Michael Sipser. ISBN 053494728X
12 Turing machines Chapter 7. Sections 7.4. Introduction to the theory of computation. Michael Sipser. ISBN 053494728X
13 The class P and NP Chapter 7. Sections 7.4. Introduction to the theory of computation. Michael Sipser. ISBN 053494728X
14 NP completeness Chapter 7. Sections 7.5. Introduction to the theory of computation. Michael Sipser. ISBN 053494728X
15 Decidability and undecidability Chapter 7. Sections 7.5. Introduction to the theory of computation. Michael Sipser. ISBN 053494728X
16 Review of the Semester

 

Course Notes/Textbooks Introduction to the theory of computation. Michael Sipser. ISBN 053494728X
Suggested Readings/Materials

 

EVALUATION SYSTEM

Semester Activities Number Weigthing
Participation
1
15
Laboratory / Application
Field Work
Quizzes / Studio Critiques
Homework / Assignments
Presentation / Jury
Project
Seminar / Workshop
Oral Exams
Midterm
2
50
Final Exam
1
35
Total

Weighting of Semester Activities on the Final Grade
3
65
Weighting of End-of-Semester Activities on the Final Grade
1
35
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
Study Hours Out of Class
15
8
Field Work
Quizzes / Studio Critiques
Homework / Assignments
Presentation / Jury
Project
Seminar / Workshop
Oral Exam
Midterms
2
13
Final Exam
1
16
    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, Computer Science and Software 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 Software Engineering problems; to be able to select and apply proper analysis and modeling methods for this purpose.

X
3

To be able to design, implement, verify, validate, document, measure and maintain a complex software system, process, or product under realistic constraints and conditions, in such a way as to meet the requirements; ability to apply modern 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 software 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 Software Engineering problems.

X
6

To be able to work effectively in Software 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 be able to present effectively, to be able to give and receive clear and comprehensible instructions.

8

To have knowledge about global and social impact of engineering practices and software applications on health, environment, and safety; to have knowledge about contemporary issues as they pertain to engineering; to be aware of the legal ramifications of Engineering and Software 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 Software Engineering, and to be able to communicate with colleagues in a foreign language.

X
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 Software Engineering.

X

*1 Lowest, 2 Low, 3 Average, 4 High, 5 Highest