• 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 CSE 5041 THEORY OF COMPUTER SCIENCE ELECTIVE 3 0 0 8

Offered By

Graduate School of Natural and Applied Sciences

Level of Course Unit

Second Cycle Programmes (Master's Degree)

Course Coordinator

ASSOCIATE PROFESSOR ZERRIN IŞIK

Offered to

Computer Engineering Non-Thesis COMPUTER ENGINEERING Computer Engineering Computer Engineering Computer Engineering (Non-Thesis-Evening)

Course Objective

This course introduces students to theoretical foundations of computing.

Learning Outcomes of the Course Unit

1   Identify classes of languages and machines 2   pecify solvable and unsolvable computational problems 3   Draw out limits on algorithmic performance of known solutions to classes of computational problems, 4   Classify computational problems into complexity classes 5   Develop and use Approximation Algorithms and Probabilistic Algorithms as practically acceptable solutions to engineering problems.

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description 1 Mathematical Basis: Notation, Sets, Languages, Formal Logic and Arithmetic 2 Regular Languages, Regular Expressions and Finite Automata 3 Non-Regular Languages and Pumping Lemma 4 Context-Free Languages and Pushdown Automata 5 Unrestricted Grammars and Turing Machines 6 The Church-Turing Thesis 7 Midterm Exam Review 8 Decidability, The Halting Problem 9 Reducability 10 The Recursion Theorem, Decidability of Logical Theories, A Definition of Information 11 Primitive Recursive Functions 12 Mu-Recursive Functions 13 Theory of Computational Complexity 14 Approximate Algorithms, Probablistic Algorithms

Recomended or Required Reading

Textbook(s): Sipser, Michael. Introduction to the Theory of Computation. 2nd ed. Boston, MA: Thomson Course Technology, 2006. ISBN: 0534950973. Supplementary Book(s): Sudkamp, Thomas A. Languages and Machines, Addison-Wesley, 1988. References: Materials: Lecture Notes,problem sets.

Planned Learning Activities and Teaching Methods

Assessment Methods

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

Further Notes About Assessment Methods

None

Assessment Criteria

To be announced.

Language of Instruction

English

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

Prof.Dr. Suleyman Sevinc Dokuz Eylul University Department of Computer Engineering Tinaztepe Campus 35160 BUCA/IZMIR Tel: +90 (232) 301 74 01 e-mail: suleyman.sevinc@cs.deu.edu.tr

Office Hours

TBA in the first lecture

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours) Lectures 39 1 39 Preparations before/after weekly lectures 13 5 65 Preparation for midterm exam 2 10 20 Preparation for final exam 1 15 15 Preparation for quiz etc. 3 3 9 Preparing assignments 4 4 16 Reading 3 7 21 Final 1 2 2 Midterm 2 2 4 Quiz etc. 3 3 9 TOTAL WORKLOAD (hours) 200

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