• HOME
• ABOUT US
  • Name Address
  • General Description
  • Governance
  • Academic Calendar
  • Degree Programmes
  • List of Programmes in English
  • General Admission and Registration Procedures
  • Credit Mobility and Recognition of Prior Learning
  • ECTS Credit Allocation
  • Academic Guidance
  • Contacts
• Degree Programmes
  • Third Cycle Programmes (Doctorate Degree)
  • Second Cycle Programmes (Master's Degree)
  • First Cycle Programmes (Bachelor's Degree)
  • Short Cycle Programmes (Associate's Degree)
• GENERAL INFORMATION FOR STUDENTS
  • Cost of Living
  • Accommodation
  • Meals
  • Medical Facilities
  • Facilities for Disabled Students
  • Insurance
  • Financial Supports
  • Student Affairs Office
  • Practical Information for International Students
  • Language Courses
  • Work Placement Possibilities
  • Sports, Social and Cultural Facilities
  • Student Associations and Clubs
  • About İzmir - Turkey
• INTERNATIONAL RELATIONS
  • International Relations Office
  • Registration Procedures
  • Agreements
  • Coordinators
  • Documents
  • List of Programmes in English
  • ECTS / DS Labels

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS CME 3203 THEORY OF COMPUTATION COMPULSORY 2 2 0 6

Offered By

Computer Engineering

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

DOCTOR MELTEM YILDIRIM EKICI

Offered to

Computer Engineering

Course Objective

This course intends to equip students with knowledge and skills in computer languages, state machines, regular and context-free languages, Turing machines and computability.

Learning Outcomes of the Course Unit

1   Define proof techniques 2   Define finite state machines 3   Define regular languages 4   Define context-free languages 5   Define PDAs 6   Define Turing Machines 7   Apply reduction to given problems 8   Define P and NP classes

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

CME 1205 - DISCRETE COMPUTATIONAL STRUCTURES

Recomended Optional Programme Components

None

Course Contents

Week Subject Description 1 Introduction to proving and proofs, sound proofs and thinking, proof by construction,contradiction, induction 2 Recursive Definitions 3 State Machines and Modelling Computation with State Machines 4 Finite State Machines 5 Regular Languages Regular Expressions 6 Regular Languages - Nondeterminism 7 Non-Regular Languages The Pumping Lemma 8 Context-Free Languages Context-Free Grammars, Push- Down Automat 9 Midterm 10 Context-Free Languages Algorithms for membership 11 Non-Context-Free Languages The Pumping Lemma 12 Turing Machines 13 Turing Machines 14 The Definition Of An Algorithm - Decidability, The Halting Problem

Recomended or Required Reading

Sipser, Michael. Introduction to the Theory of Computation. 2nd ed. Boston, MA: Thomson Course Technology, 2006. ISBN: 0534950973.

Planned Learning Activities and Teaching Methods

Lectures and homeworks.

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA 1 MTE MIDTERM EXAM 2 ASG ASSIGNMENT 3 FIN FINAL EXAM 4 FCG FINAL COURSE GRADE MTE * 0.30 + ASG * 0.20 + FIN * 0.50 5 RST RESIT 6 FCGR FINAL COURSE GRADE (RESIT) MTE * 0.30 + ASG * 0.20 + RST * 0.50 *** Resit Exam is Not Administered in Institutions Where Resit is not Applicable.

Further Notes About Assessment Methods

None

Assessment Criteria

Students are asessed on their independent homework performance and through written exams (supervised).

Language of Instruction

English

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

x17409, meltem.yildirim@deu.edu.tr

Office Hours

To be announced in the first week of lectures.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours) Lectures 12 3 36 Preparations before/after weekly lectures 12 4 48 Preparation for midterm exam 1 15 15 Preparation for final exam 1 17 17 Preparing assignments 1 30 30 Midterm 1 2 2 Final 1 2 2 TOTAL WORKLOAD (hours) 150

Contribution of Learning Outcomes to Programme Outcomes

PO/LO PO.1 PO.2 PO.3 PO.4 PO.5 PO.6 PO.7 PO.8 PO.9 PO.10 LO.1 5 LO.2 5 4 4 LO.3 5 LO.4 5 LO.5 5 LO.6 5 LO.7 5 LO.8 5