• 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 (English)

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

ASSOCIATE PROFESSOR ÖZLEM VARLIKLAR

Offered to

Computer Engineering (English)

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 and apply reduction to given problems 2   Define regular languages and finite state machines 3   Define context-free languages and push-down automata 4   Define Turing Machines 5   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, Mathematical Preliminaries, Theorems and Proofs 2 State Machines and Modelling Computation with State Machines, Finite State Automata (FSA) 3 Nondeterministic Finite State Automata (NFA) 4 Regular Languages (RL) & Regular Expressions (RE) 5 Non-Regular Languages (NRL) & Pumping Lemma 6 Context Free Grammars (CFG) 7 Different Forms of Grammars, Chomsky Normal Form 8 Push Down Automata (PDA) 9 Properties of Context Free Languages, Non-Context Free Grammars (NCFG) 10 Turing Machines (TM) 11 Computability and Decidability- Decidable languages 12 Undecidable Languages 13 Halting Problem, Reducing a problem into another one 14 Complexity Theory, The Class P and NP

Recomended or Required Reading

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

Planned Learning Activities and Teaching Methods

Lectures and exams.

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.40 + ASG * 0.10 + FIN * 0.50 5 RST RESIT 6 FCGR FINAL COURSE GRADE (RESIT) MTE * 0.40 + ASG * 0.10 + RST * 0.50

Further Notes About Assessment Methods

None

Assessment Criteria

Midterm exam is 40%, Assignments 10%, Final exam is 50% of the course grade.

Language of Instruction

English

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

e-mail: aktas.ozlem@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 14 2 28 Labratory 14 2 28 Preparations before/after weekly lectures 14 2 28 Preparation for midterm exam 1 18 18 Preparation for final exam 1 18 18 Preparing assignments 1 16 16 Midterm 1 4 4 Final 1 4 4 TOTAL WORKLOAD (hours) 144

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 3 LO.2 5 3 3 3 LO.3 5 3 LO.4 5 3 LO.5 5 3