• 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 BIL 4114 INTRODUCTION TO COMPUTATION THEORY ELECTIVE 3 0 0 5

Offered By

Computer Science

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

PROFESSOR DOCTOR MURAT ERŞEN BERBERLER

Offered to

Computer Science

Course Objective

To teach computation theory concepts to solve computer science problems.

Learning Outcomes of the Course Unit

1   Have a knowledge of basic concepts of computation theory. 2   Be able to solve problems of computation theory. 3   Be able to solve computer science problems by using computation theory concepts. 4   Be able to design efficient algorithms by using computation theory concepts. 5   Be able to solve problems of different type of disciplines by using concepts of computation theory.

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description 1 Introduction to computation theory 2 Formal proof, forms of proof, inductive proofs 3 Introduction to finite automata 4 Deterministic finite automata 5 Deterministic finite automata (continues to) 6 Non-Deterministic finite automata 7 Non-Deterministic finite automata (continues to) 8 General review 9 Finite automata with epsilon transitions 10 Finite automata with epsilon transitions (continues to) 11 Regular expressions 12 Finite automata and regular expressions 13 Applications of regular expressions 14 Turing machines

Recomended or Required Reading

Textbook(s): Introduction to Automata Theory, Languages and Computation, John E. Hopcroft, R. M., J. D. U., ISBN 0321476174. Supplementary Book(s): Özdevinirler (Otomatlar) Kuramı ve Biçimsel Diller, A. Ünal Yarımağan, 2004.

Planned Learning Activities and Teaching Methods

The course is taught in a lecture, class presentation and discussion format. Besides the taught lecture, group presentations are to be prepared by the groups assigned and presented in a discussion session. In some weeks of the course, results of the homework given previously are discussed.

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA 1 VZ Vize 2 FN Final 3 BNS BNS VZ * 0.40 + FN * 0.60 4 BUT Bütünleme Notu 5 BBN Bütünleme Sonu Başarı Notu VZ * 0.40 + BUT * 0.60

Further Notes About Assessment Methods

None

Assessment Criteria

Will be announced.

Language of Instruction

Turkish

Course Policies and Rules

Will be announced.

Contact Details for the Lecturer(s)

murat.berberler@deu.edu.tr

Office Hours

Will be announced.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours) Lectures 14 3 42 Preparations before/after weekly lectures 14 4 56 Preparation for midterm exam 1 10 10 Preparation for final exam 1 20 20 Final 1 2 2 Midterm 1 2 2 TOTAL WORKLOAD (hours) 132

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 PO.11 PO.12 PO.13 LO.1 5 LO.2 5 5 LO.3 5 5 5 LO.4 5 5 LO.5 5 5